fork download 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<ii, int> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebear"
  33. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  34.  
  35. const int MOD = 1e9 + 7;
  36. const int inf = 1e9 + 27092008;
  37. const ll INF = 1e18 + 27092008;
  38. const int N = 2e5 + 5;
  39. int n;
  40. iii a[N];
  41. set<ii> s;
  42. vector<int> ans[N];
  43.  
  44. void init(void) {
  45.     cin >> n;
  46.     FOR(i, 1, n) {
  47.         cin >> a[i].fi.fi >> a[i].fi.se;
  48.         a[i].se = i;
  49.     }
  50. }
  51.  
  52. void process(void) {
  53.     sort(a + 1, a + n + 1, [&](const iii &x, const iii &y){return (x.fi.fi < y.fi.fi) || (x.fi.fi == y.fi.fi && x.fi.se > y.fi.se);});
  54.     int cur = 0;
  55.     FOR(i, 1, n) {
  56.         auto it = s.lower_bound(mp(a[i].fi.se, -inf));
  57.         if (it == s.begin()) {
  58.             ans[++cur].pb(a[i].se);
  59.             s.insert(mp(a[i].fi.se, cur));
  60.         } else {
  61.             ans[(--it)->se].pb(a[i].se);
  62.             s.insert(mp(a[i].fi.se, it->se));
  63.             s.erase(it);
  64.         }
  65.     }
  66.  
  67.     cout << cur << '\n';
  68.     FOR(i, 1, cur) {
  69.         reverse(all(ans[i]));
  70.         cout << (int)ans[i].size() << ' ';
  71.         for(int x : ans[i]) cout << x << ' ';
  72.         cout << '\n';
  73.     }
  74. }
  75.  
  76. int main() {
  77.     ios_base::sync_with_stdio(0);
  78.     cin.tie(0); cout.tie(0);
  79.     if (fopen(task".inp", "r")) {
  80.         freopen(task".inp", "r", stdin);
  81.         freopen(task".out", "w", stdout);
  82.     }
  83.     int tc = 1;
  84. //    cin >> tc;
  85.     while(tc--) {
  86.         init();
  87.         process();
  88.     }
  89.     return 0;
  90. }
  91.  
Success #stdin #stdout 0.01s 8520KB
comments (?)
stdin 
Standard input is empty
stdout 
0
https://ideone.com/0UNskO
language:
C++14 (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!