oj.uz

Submission #79340

# Submission time Handle Problem Language Result Execution time Memory
79340 2018-10-12T10:16:22 Z tmwilliamlin168 Trading (IZhO13_trading) C++14
100 / 100
 182 ms 65412 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN=3e5;
int n, m, st[2*mxN], l, r, x;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	while(m--) {
		cin >> l >> r >> x, --l, x+=n-l;
		for(l+=n, r+=n; l<r; ++l/=2, r/=2) {
			if(l&1)
				st[l]=max(x, st[l]);
			if(r&1)
				st[r-1]=max(x, st[r-1]);
		}
	}
	for(int i=1; i<n; ++i) {
		st[2*i]=max(st[i], st[2*i]);
		st[2*i+1]=max(st[i], st[2*i+1]);
	}
	for(int i=0; i<n; ++i)
		cout << max(st[n+i]-n+i, 0) << " ";
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 520 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 820 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 93 ms 5748 KB Output is correct
8 Correct 145 ms 9436 KB Output is correct
9 Correct 105 ms 12768 KB Output is correct
10 Correct 116 ms 16252 KB Output is correct
11 Correct 120 ms 20688 KB Output is correct
12 Correct 126 ms 24556 KB Output is correct
13 Correct 131 ms 29224 KB Output is correct
14 Correct 127 ms 33292 KB Output is correct
15 Correct 149 ms 38508 KB Output is correct
16 Correct 154 ms 43344 KB Output is correct
17 Correct 152 ms 48384 KB Output is correct
18 Correct 166 ms 53836 KB Output is correct
19 Correct 165 ms 58824 KB Output is correct
20 Correct 182 ms 65412 KB Output is correct