oj.uz

Submission #429095

# Submission time Handle Problem Language Result Execution time Memory
429095 2021-06-15T17:24:11 Z charterla Handcrafted Gift (IOI20_gift) C++14
100 / 100
 304 ms 27748 KB 
#include "gift.h"
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct Range{
	int ls,rs,self;
}one[500005],two[500005];
int cn[2]={0,0};

bool cmp(Range a,Range b){
	return a.ls==b.ls?a.rs<b.rs:a.ls<b.ls;
}

bool tag[2000005];
bool check(int ls,int rs,int ld,int rd,int now){
	//cout<<ls<<","<<rs<<":"<<ld<<","<<rd<<"-->"<<now<<endl; 
	if(ls<=ld && rd<=rs)return tag[now];
	
	int mid=(ld+rd)/2;
	if(mid>=ls && !check(ls,rs,ld,mid,now<<1))return false;
	if(mid+1<=rs && !check(ls,rs,mid+1,rd,now<<1|1))return false;
	
	return true;
}

int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
    for(int i=0;i<r;i++){
    	if(x[i]==1){
    		one[cn[0]].ls=a[i];
    		one[cn[0]].rs=b[i];
    		cn[0]++;
		}
		else{
			two[cn[1]].ls=a[i];
    		two[cn[1]].rs=b[i];
    		cn[1]++;
		}
	}
	
	sort(one,one+cn[0],cmp);
	for(int i=0;i<cn[0];i++)one[i].self=i;
	for(int i=1;i<cn[0];i++){
		int now=one[i].self,last=one[i-1].self;
		if(one[last].rs>=one[now].ls){
			one[last].ls=min(one[last].ls,one[now].ls);
			one[last].rs=max(one[last].rs,one[now].rs);
			one[now].self=last;
		}
	}
	//for(int i=0;i<cn[0];i++)cout<<one[i].self<<":"<<one[one[i].self].ls<<","<<one[one[i].self].rs<<" ";cout<<endl;
	
	int stn=1;
	while(stn<n)stn*=2;//cout<<stn<<endl;
	for(int i=0;i<stn+n;i++)tag[i]=false;
	for(int i=0;i<cn[0];i++){
		if(i==one[i].self){
			for(int j=one[i].ls+stn;j<=one[i].rs+stn;j++){
				tag[j]=true;
			}
		}
	}
	//for(int i=1;i<stn+n;i++)cout<<tag[i]<<" ";cout<<endl;
	for(int i=stn-1;i>=1;i--){
		if((i<<1)<stn+n){
			if((i<<1|1)<stn+n){
				tag[i]=tag[i<<1]&&tag[i<<1|1];
			}
			else{
				tag[i]=tag[i<<1];
			}
		}
	}
	//for(int i=1;i<stn+n;i++)cout<<tag[i]<<" ";cout<<endl;
	
	string ans="";char ch[2]={'R','B'};int temp=0;
	for(int i=stn;i<stn+n;i++){
		if(tag[i]==0 || (i>stn && tag[i]==1 && tag[i-1]==0))temp^=1;
		
		ans+=ch[temp];
	}//cout<<ans<<endl;
    
    for(int i=0;i<cn[1];i++){
    	if(two[i].rs-two[i].ls==0)return 0;
    	if(check(two[i].ls,two[i].rs,0,stn-1,1))return 0;
	}
    craft(ans);
    return 1;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 235 ms 19932 KB Output is correct
6 Correct 304 ms 20028 KB Output is correct
7 Correct 262 ms 19972 KB Output is correct
8 Correct 227 ms 19932 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 5 ms 588 KB Output is correct
4 Correct 235 ms 19956 KB Output is correct
5 Correct 275 ms 19932 KB Output is correct
6 Correct 193 ms 20032 KB Output is correct
7 Correct 185 ms 27572 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 235 ms 19932 KB Output is correct
6 Correct 304 ms 20028 KB Output is correct
7 Correct 262 ms 19972 KB Output is correct
8 Correct 227 ms 19932 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 5 ms 588 KB Output is correct
12 Correct 235 ms 19956 KB Output is correct
13 Correct 275 ms 19932 KB Output is correct
14 Correct 193 ms 20032 KB Output is correct
15 Correct 185 ms 27572 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 7 ms 2440 KB Output is correct
36 Correct 8 ms 2460 KB Output is correct
37 Correct 16 ms 3464 KB Output is correct
38 Correct 252 ms 27728 KB Output is correct
39 Correct 243 ms 27748 KB Output is correct
40 Correct 242 ms 27636 KB Output is correct
41 Correct 241 ms 27628 KB Output is correct
42 Correct 247 ms 27192 KB Output is correct