forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathI.cpp
More file actions
49 lines (38 loc) · 1.32 KB
/
I.cpp
File metadata and controls
49 lines (38 loc) · 1.32 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
const int MN = 2000111;
int n;
struct Exam {
int t, c, day;
} a[MN];
vector<int> ev[2000 * 1011];
int main() {
ios :: sync_with_stdio(false);
while (scanf("%d", &n) == 1) {
FOR(i,1,2000*1000) ev[i].clear();
FOR(i,1,n) {
scanf("%d%d", &a[i].t, &a[i].c);
ev[a[i].t].push_back(i);
}
set< pair<int,int> > all;
FOR(time,1,1200111) {
for(int id : ev[time]) {
all.insert(make_pair(time - a[id].c, id));
}
if (!all.empty()) {
auto p = *all.begin(); all.erase(all.begin());
a[p.second].day = time;
}
}
FOR(i,1,n) printf("%d ", a[i].day); puts("");
}
return 0;
}