Ravintola

#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#define F first
#define S second
using namespace std;
int n;

vector<pair<pair<int, int>, int> > ab;
vector<pair<int, int> > ansp;


int mt[201010];
int st[201010];
set<int> times;
set<pair<int, int> > pt;
map<int, int> ixt;

int main(){
  cin >> n;
  for (int i=0; i<n; ++i){
    int a, b;
    cin >> a >> b;
    ab.push_back(make_pair(make_pair(a, b), i+1));
    times.insert(a); times.insert(b);
  }sort(ab.begin(), ab.end());
  
  int ix=1;
  for (auto a:times){
    ixt[a]=ix;
    ++ix;
  }
  
  for (int i=0; i<n; ++i){
    ab[i].F.F=ixt[ab[i].F.F];
    ab[i].F.S=ixt[ab[i].F.S];
    ++mt[ab[i].F.F]; --mt[ab[i].F.S];
  }
  
  for (int i=1; i<201010; ++i)st[i]=st[i-1]+mt[i];
  
  int pti=0;
  
  for (int i=0; i<201010; ++i) pti=max(pti, st[i]);
  cout << pti << endl;
  for (int i=1; i<=pti; ++i) pt.insert(make_pair(0, i));
  
  for (int i=0; i<n; ++i){
    int a=ab[i].F.F;
    int b=ab[i].F.S;
    int ix=ab[i].S;
    set<pair<int, int> >::iterator it=pt.lower_bound(make_pair(-a, 0));
    ansp.push_back(make_pair(ix, (*it).second));
    pt.insert(make_pair(-b, (*it).second));
    pt.erase(it);
  }
  sort(ansp.begin(), ansp.end());
  for (int i=0; i<n; ++i){
    cout << ansp[i].S <<"\n";
  }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED