oj.uz

Submission #434172

# Submission time Handle Problem Language Result Execution time Memory
434172 2021-06-20T16:51:25 Z mosiashvililuka Handcrafted Gift (IOI20_gift) C++14
100 / 100
 280 ms 32544 KB 
#include "gift.h"
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,f[500009],NO,rg[500009],MX[500009];
string S;
pair <pair <int, int>, int> p[500009];
int construct(int Nn, int Rr, std::vector<int> Aa, std::vector<int> Bb, std::vector<int> Xx) {
	a=Nn;tes=Rr;
	for(t=1; t<=tes; t++){
		p[t].first.first=Aa[t-1]+1;p[t].first.second=Bb[t-1]+1;
		p[t].second=Xx[t-1];
	}
	for(i=1; i<=a; i++){
		f[i]=0;rg[i]=i;
	}
	sort(p+1,p+tes+1);
	zx=0;c=0;
	for(t=1; t<=tes; t++){
		if(p[t].second==2) continue;
		if(zx<p[t].first.first){
			c=p[t].first.first;zx=p[t].first.second;
		}else{
			zx=max(zx,p[t].first.second);
			rg[c]=zx;
		}
		rg[c]=zx;
	}
	i=1;j=0;
	while(i<=a){
		for(ii=i; ii<=rg[i]; ii++) f[ii]=j;
		j^=1;i=rg[i]+1;
	}
	for(i=2; i<=a; i++){
		if(f[i]!=f[i-1]){
			MX[i]=i-1;
		}else{
			MX[i]=MX[i-1];
		}
	}
	for(t=1; t<=tes; t++){
		if(p[t].second==1) continue;
		if(p[t].first.first==p[t].first.second){
			return 0;
		}
		if(MX[p[t].first.second]>=p[t].first.first){
			
		}else{
			return 0;
		}
	}
	for(i=1; i<=a; i++){
		if(f[i]==0){
			S+="R";
		}else{
			S+="B";
		}
	}
	craft(S);
	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 0 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 225 ms 24808 KB Output is correct
6 Correct 262 ms 30008 KB Output is correct
7 Correct 235 ms 29952 KB Output is correct
8 Correct 229 ms 29952 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 844 KB Output is correct
4 Correct 234 ms 32444 KB Output is correct
5 Correct 231 ms 32460 KB Output is correct
6 Correct 225 ms 31352 KB Output is correct
7 Correct 228 ms 31356 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 0 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 312 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 0 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 225 ms 24808 KB Output is correct
6 Correct 262 ms 30008 KB Output is correct
7 Correct 235 ms 29952 KB Output is correct
8 Correct 229 ms 29952 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 844 KB Output is correct
12 Correct 234 ms 32444 KB Output is correct
13 Correct 231 ms 32460 KB Output is correct
14 Correct 225 ms 31352 KB Output is correct
15 Correct 228 ms 31356 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 0 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 312 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 11 ms 7792 KB Output is correct
36 Correct 13 ms 7816 KB Output is correct
37 Correct 19 ms 8704 KB Output is correct
38 Correct 258 ms 32544 KB Output is correct
39 Correct 280 ms 31304 KB Output is correct
40 Correct 229 ms 32432 KB Output is correct
41 Correct 229 ms 32476 KB Output is correct
42 Correct 225 ms 32000 KB Output is correct