Ravintola

#include <bits/stdc++.h>
typedef long long ll;
#define F first
#define S second

using namespace std;

int chk[101010];
set<int> freed;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin>>n;
  set<pair<int,int>> ala;
  set<pair<int,int>> yla;
  for (int i=0;i<n;i++) {
     int a,b;
     cin>>a>>b;
     ala.insert({a,i});
     yla.insert({b,i});
  }
  auto it1=ala.begin();
  auto it2=yla.begin();
  int nd=0;
  while (it1!=ala.end()) {
    if (it2->F <= it1->F) {
      int tmp=it2->S;
      freed.insert(chk[tmp]);
      ++it2;
    } else {
      if (freed.empty()) {
	chk[it1->S]=++nd;
	++it1;
      } else {
	chk[it1->S]=*(freed.begin());
	freed.erase(freed.begin());
	++it1;
      }
    }
  }
  cout<<nd<<"\n";
  for (int i=0;i<n;i++) cout<<chk[i]<<"\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