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