oj.uz

Submission #41322

# Submission time Handle Problem Language Result Execution time Memory
41322 2018-02-16T00:22:55 Z MatheusLealV Trading (IZhO13_trading) C++14
100 / 100
 425 ms 11728 KB 
#include <bits/stdc++.h>
#define inf 2000000000
#define N 300005
#define l (2*nod)
#define r (2*nod + 1)
#define mid ((a + b)/2)
using namespace std;
 
int n, m, tree[4*N], lazy[4*N];
 
inline void prop(int nod, int a, int b)
{
	if(lazy[nod] == -inf) return;
 
	tree[nod] = max(tree[nod], lazy[nod]);
 
	if(a != b)
	{
		lazy[l] = max(lazy[l], lazy[nod]);
 
		lazy[r] = max(lazy[r], lazy[nod]);
	}
 
	lazy[nod] = -inf;
}
 
void upd(int nod, int a, int b, int i, int j, int x)
{
	prop(nod, a, b);
 
	if(j < a || i > b) return;
 
	if(i <= a && j >= b)
	{
		tree[nod] = max(tree[nod], x);
 
		if(a != b)
		{
			lazy[l] = max(lazy[l], x);
 
			lazy[r] = max(lazy[r], x);
		}
 
		return;
	}
 
	upd(l, a, mid, i, j, x), upd(r, mid + 1, b, i, j, x);
 
	tree[nod] = max(tree[l], tree[r]);
}
 
int query(int nod, int a, int b, int i, int j)
{
	prop(nod, a, b);
 
	if(j < a || i > b) return -inf;
 
	if(i <= a && j >= b) return tree[nod];
 
	return max(query(l, a, mid, i, j), query(r, mid + 1, b, i, j));
}
 
int main()
{
	ios::sync_with_stdio(false); cin.tie(0);
 
	cin>>n>>m;
 
	for(int i = 0; i < 4*N; i++) lazy[i] = tree[i] = -inf;
 
	for(int i = 1, a, b, x; i <= m; i++)
	{
		cin>>a>>b>>x;
 
		upd(1, 1, n, a, b, x - a);
	}
 
	for(int i = 1; i <= n; i++)
	{
		int ans = query(1, 1, n, i, i) + i;
 
		cout<<max(0, ans)<<" \n"[i == n];
	}
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9720 KB Output is correct
2 Correct 11 ms 9720 KB Output is correct
3 Correct 9 ms 9796 KB Output is correct
4 Correct 10 ms 9888 KB Output is correct
5 Correct 12 ms 9968 KB Output is correct
6 Correct 11 ms 9968 KB Output is correct
7 Correct 233 ms 10812 KB Output is correct
8 Correct 219 ms 11068 KB Output is correct
9 Correct 221 ms 11120 KB Output is correct
10 Correct 229 ms 11120 KB Output is correct
11 Correct 242 ms 11384 KB Output is correct
12 Correct 282 ms 11384 KB Output is correct
13 Correct 271 ms 11420 KB Output is correct
14 Correct 303 ms 11420 KB Output is correct
15 Correct 339 ms 11420 KB Output is correct
16 Correct 360 ms 11420 KB Output is correct
17 Correct 329 ms 11420 KB Output is correct
18 Correct 356 ms 11580 KB Output is correct
19 Correct 340 ms 11580 KB Output is correct
20 Correct 425 ms 11728 KB Output is correct