Ravintola

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef pair<int,int> P;
const int MN=1<<20;
struct S {
	bool add;
	int t;
	int i;
	bool operator<(const S& s) const {
		if (t==s.t) return add < s.add;
		return t<s.t;
	}
};
S ss[MN];
int res[MN];
int M=0;

int main() {
	int n;
	cin>>n;
	for(int i=0;i<n; ++i) {
		int a,b;
		cin>>a>>b;
		ss[2*i] = {1, a, i};
		ss[2*i+1] = {0, b, i};
	}
	sort(ss,ss+2*n);
	vector<int> v;
	for(int i=0; i<2*n; ++i) {
		S s = ss[i];
		if (s.add) {
			if (v.empty()) {
				v.push_back(++M);
			}
			res[s.i]=v.back();
			v.pop_back();
		} else {
			v.push_back(res[s.i]);
		}
	}
	cout<<M<<'\n';
	for(int i=0; i<n; ++i) cout<<res[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