fork download 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define pb emplace_back 
  4. #define mp make_pair
  5. #define fi first
  6. #define se second
  7. #define all(v) v.begin(),v.end()
  8. #define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
  9.  
  10.  
  11. int  main()
  12.  {
  13.  
  14.  
  15.  
  16.           int  n,i,x,y,j,c;
  17.               cin>>n;
  18.  
  19.  
  20.  
  21.               vector<int>a(n,0),b(n,0),res;
  22.               vector<pair<int,int>>v;
  23.             map<pair<int,int>,set<int>>mm,mm1; 
  24.  
  25.                 for(i=0;i<n;i++)
  26.                 {
  27.                     cin>>a[i]>>b[i];
  28.                     v.pb(mp(a[i],b[i]));
  29.                     v.pb(mp(b[i]+1,-a[i]));
  30.                 }
  31.  
  32.                 sort(all(v));
  33.  
  34.                 set<int>sx;
  35.  
  36.                 for(i=1;i<=n;i++)
  37.                    sx.insert(i);
  38.  
  39.  
  40.  
  41.  
  42.                 for(i=0;i<v.size();i++)
  43.                 {
  44.                     x=v[i].fi;
  45.                     y=v[i].se;
  46.  
  47.  
  48.                     if(y>=0)
  49.                     {
  50.                         pair<int,int>xx;
  51.                         xx.fi=x;
  52.                         xx.se=y;
  53.                         auto it=sx.begin();
  54.                         sx.erase(it);
  55.                         c=*it;
  56.  
  57.                         mm[xx].insert(c);
  58.                         res.pb(c);
  59.                     }
  60.                     else
  61.                     {
  62.  
  63.                         pair<int,int>xx;
  64.                         xx.fi=abs(y);
  65.                         xx.se=x-1;
  66.                         auto it=mm[xx].begin();
  67.                         c=*it;
  68.                         sx.insert(c);
  69.                         mm[xx].erase(it);
  70.  
  71.  
  72.                     }
  73.  
  74.  
  75.                 }
  76.                 set<int>ss;
  77.  
  78.                for(i=0;i<res.size();i++)
  79.                ss.insert(res[i]);
  80.  
  81.  
  82.  
  83.                      j=0;
  84.  
  85.                for(i=0;i<v.size();i++)
  86.                {
  87.                    x=v[i].fi;
  88.                     y=v[i].se;
  89.                     if(y>=0)
  90.                     {
  91.                           pair<int,int>xx;
  92.                         xx.fi=x;
  93.                         xx.se=y;
  94.                         mm1[xx].insert(res[j]);
  95.                         j++;
  96.                     }
  97.                }
  98.  
  99.                cout<<ss.size()<<endl;
  100.  
  101.  
  102.                 for(i=0;i<n;i++)
  103.                 {
  104.                     x=a[i];
  105.                     y=b[i];
  106.  
  107.                     pair<int,int>xx;
  108.                         xx.fi=x;
  109.                         xx.se=y;
  110.  
  111.                          auto it=mm1[xx].begin();
  112.                         c=*it;
  113.  
  114.                         mm1[xx].erase(it);
  115.                         cout<<c<<" ";
  116.  
  117.                 }
  118.  
  119. }
Success #stdin #stdout 0s 4688KB
comments (?)
stdin 
3
1 2
2 4
4 4
stdout 
2
1 2 1
https://ideone.com/LY6ysT
3
1 2
2 4
4 4
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
secret

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!