oj.uz

답안 #689674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
689674 2023-01-29T05:26:45 Z sudheerays123 거래 (IZhO13_trading) C++17
100 / 100
 458 ms 30116 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 3e5+5 , INF = 1e18 , MOD = 1e9+7;

vector<ll> seg(4*N);
vector<pair<ll,ll>> lazy(4*N);

void build(ll node , ll left ,  ll right){

	if(left == right){
		seg[node] = 0;
		lazy[node].first = 0;
		lazy[node].second = 0;
		return;
	}

	ll mid = (left+right)/2;

	build(2*node,left,mid);
	build(2*node+1,mid+1,right);

	seg[node] = max(seg[2*node],seg[2*node+1]);
}

bool shouldIUpdate(ll beforeval , ll beforepos , ll newval , ll newpos , ll pos){
	if(beforepos == 0) return true;
	if(pos-newpos+newval >= pos-beforepos+beforeval) return true;
	return false;
}

void update(ll node , ll left , ll right , ll ql , ll qr , ll val){

	ll mid = (left+right)/2;

	if(lazy[node].first){

		seg[node] = max(seg[node],right-lazy[node].second+lazy[node].first);
		if(left != right){
			if(shouldIUpdate(lazy[2*node].first,lazy[2*node].second,lazy[node].first,lazy[node].second,mid)) lazy[2*node] = lazy[node];
			if(shouldIUpdate(lazy[2*node+1].first,lazy[2*node+1].second,lazy[node].first,lazy[node].second,right)) lazy[2*node+1] = lazy[node];
		}
		lazy[node].first = 0;
		lazy[node].second = 0;
	}

	if(left >= ql && right <= qr){

		seg[node] = max(seg[node],right-ql+val);
		if(left != right){
			if(shouldIUpdate(lazy[2*node].first,lazy[2*node].second,val,ql,mid)) lazy[2*node] = make_pair(val,ql);
			if(shouldIUpdate(lazy[2*node+1].first,lazy[2*node+1].second,val,ql,right)) lazy[2*node+1] = make_pair(val,ql);
		}
		return;
	}

	if(left > qr || right < ql) return;

	update(2*node,left,mid,ql,qr,val);
	update(2*node+1,mid+1,right,ql,qr,val);

	seg[node] = max(seg[2*node],seg[2*node+1]);
}

ll query(ll node , ll left , ll right , ll ql , ll qr){

	ll mid = (left+right)/2;

	if(lazy[node].first){

		seg[node] = max(seg[node],right-lazy[node].second+lazy[node].first);
		if(left != right){
			if(shouldIUpdate(lazy[2*node].first,lazy[2*node].second,lazy[node].first,lazy[node].second,mid)) lazy[2*node] = lazy[node];
			if(shouldIUpdate(lazy[2*node+1].first,lazy[2*node+1].second,lazy[node].first,lazy[node].second,right)) lazy[2*node+1] = lazy[node];
		}
		lazy[node].first = 0;
		lazy[node].second = 0;
	}

	if(left >= ql && right <= qr) return seg[node];
	if(left > qr || right < ql) return 0;

	ll l = query(2*node,left,mid,ql,qr);
	ll r = query(2*node+1,mid+1,right,ql,qr);

	return max(l,r);
}

void solve(){

	ll n,m;
	cin >> n >> m;

	build(1,1,n);

	while(m--){
		ll l,r,x;
		cin >> l >> r >> x;

		update(1,1,n,l,r,x);
	}

	for(ll i = 1; i <= n; i++) cout << query(1,1,n,i,i) << " ";
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 28500 KB Output is correct
2 Correct 11 ms 28484 KB Output is correct
3 Correct 12 ms 28500 KB Output is correct
4 Correct 12 ms 28396 KB Output is correct
5 Correct 13 ms 28512 KB Output is correct
6 Correct 14 ms 28436 KB Output is correct
7 Correct 216 ms 29236 KB Output is correct
8 Correct 235 ms 29528 KB Output is correct
9 Correct 236 ms 29520 KB Output is correct
10 Correct 269 ms 29272 KB Output is correct
11 Correct 313 ms 29896 KB Output is correct
12 Correct 306 ms 29484 KB Output is correct
13 Correct 295 ms 29784 KB Output is correct
14 Correct 314 ms 29660 KB Output is correct
15 Correct 346 ms 29820 KB Output is correct
16 Correct 388 ms 29776 KB Output is correct
17 Correct 349 ms 29904 KB Output is correct
18 Correct 423 ms 30044 KB Output is correct
19 Correct 377 ms 29876 KB Output is correct
20 Correct 458 ms 30116 KB Output is correct