oj.uz

답안 #915249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915249 2024-01-23T14:59:33 Z dsyz RMQ (NOI17_rmq) C++17
100 / 100
 145 ms 24872 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
ll N,Q;
struct node {
	ll s,e,m,lazy;
	pair<ll,ll> v;
	node *l, *r;
	node(ll _s,ll _e){
		s = _s;
		e = _e;
		m = (s + e) / 2;
		lazy = -1;
		v = {-1,s};
		if(s != e){
			l = new node(s,m);
			r = new node(m + 1,e);
		}
	}
	void propo() {
		if(lazy == -1) return;
		v.first = max(v.first,lazy);
		if(s != e){
			l->lazy = max(l->lazy,lazy);
			r->lazy = max(r->lazy,lazy);
		}
		lazy = -1;
	}
	void update(ll x,ll y,ll nval){
		propo();
		if(s == x && e == y){
			lazy = max(lazy,nval);
			return;
		}else{
			if(x > m) r -> update(x,y,nval);
			else if(y <= m) l -> update(x,y,nval);
			else l -> update(x,m,nval), r -> update(m + 1,y,nval);
			l->propo(), r->propo();
			v = min(l->v,r->v);
		}
	}
	pair<ll,ll> rmq(ll x,ll y){
		propo();
		if(s == x && e == y){
			return v;
		}else{
			if(x > m) return r -> rmq(x,y);
			else if(y <= m) return l -> rmq(x,y);
			else return min(l -> rmq(x,m),r -> rmq(m + 1,y));
		}
	}
} *root;
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	cin>>N>>Q;
	root = new node(0,N - 1);
	vector<pair<ll,ll> > ranges[N]; //ranges provided with RMQ = i
	for(ll q = 0;q < Q;q++){
		ll L,R,X;
		cin>>L>>R>>X; //0-indexed
		root -> update(L,R,X);
		ranges[X].push_back({L,R});
	}
	ll ans[N];
	memset(ans,-1,sizeof(ans));
	bool ok = 1;
	set<ll> values;
	for(ll i = 0;i < N;i++){
		values.insert(i);
	}
	for(ll rmq = N - 1;rmq >= 0;rmq--){
		if(ranges[rmq].empty()) continue;
		ll Lb = -1e18, Ub = 1e18;
		for(auto u : ranges[rmq]){
			Lb = max(Lb,u.first);
			Ub = min(Ub,u.second);
		}
		if(Lb > Ub){ //no intersection at all between ranges with RMQ = value rmq
			ok = 0;
			break;
		}
		pair<ll,ll> a = root -> rmq(Lb,Ub);
		if(a.first > rmq){
			ok = 0;
		}else{
			ans[a.second] = rmq; //I can prove that setting any element whose v.first == rmq to value rmq between [Lb,Ub] intersection are always optimal
			values.erase(values.find(rmq));
			root -> update(a.second,a.second,1e9); //position a.second is already filled up
		}
	}
	vector<pair<ll,ll> > left;
	for(ll i = 0;i < N && ok;i++){
		if(ans[i] == -1){
			pair<ll,ll> a = root -> rmq(i,i);
			left.push_back({a.first,i});
		}
	}
	sort(left.begin(),left.end(),greater<pair<ll,ll> >());
	for(auto u : left){
		if(values.empty() || *prev(values.end()) < u.first){
			ok = 0;
			break;
		}else{
			ans[u.second] = *prev(values.end());
			values.erase(prev(values.end()));
		}
	}
	if(!ok){
		memset(ans,-1,sizeof(ans));
		for(ll i = 0;i < N;i++){
			cout<<ans[i]<<" ";
		}
		cout<<'\n';
	}else{
		for(ll i = 0;i < N;i++){
			cout<<ans[i]<<" ";
		}
		cout<<'\n';
	}
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 708 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 344 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 452 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 708 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 620 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 143 ms 21372 KB Output is correct
28 Correct 145 ms 23556 KB Output is correct
29 Correct 123 ms 22472 KB Output is correct
30 Correct 135 ms 24872 KB Output is correct
31 Correct 101 ms 18752 KB Output is correct
32 Correct 118 ms 18372 KB Output is correct
33 Correct 43 ms 21456 KB Output is correct
34 Correct 27 ms 14680 KB Output is correct
35 Correct 59 ms 24716 KB Output is correct
36 Correct 113 ms 24728 KB Output is correct
37 Correct 131 ms 24404 KB Output is correct
38 Correct 21 ms 15960 KB Output is correct
39 Correct 105 ms 22396 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 348 KB Output is correct