Submission #522123

# Submission time Handle Problem Language Result Execution time Memory
522123 2022-02-03T21:31:20 Z new_acc Combo (IOI18_combo) C++14
100 / 100
35 ms 536 KB
#include<bits/stdc++.h>
#include "combo.h"
#define ll long long
#define fi first
#define se second
using namespace std;
const size_t N=2e3+10;
string s;
/*size_t press(string p){
	size_t res=0;
	for(size_t i=0;i<p.size();i++){
		size_t j=i;
		while(j-i<s.size()&&j<p.size()&&p[j]==s[j-i]) j++;
		res=max(res,j-i);
	}
	return res;
}*/
string guess_sequence(int n){
	string curr="";
	string k1,k2,k3;
	int xd=press("AB");
	if(xd>=1){
		xd=press("B");
		if(xd==1) curr+="B",k1="X",k2="Y",k3="A";
		else curr+="A",k1="X",k2="Y",k3="B";
	}else{
		xd=press("X");
		if(xd==1) curr+="X",k1="B",k2="Y",k3="A";
		else curr+="Y",k1="X",k2="B",k3="A";
	}
	size_t i;
	for(i=2;(int)i<=n-2;){
		size_t x=press(curr+k1+k2+k3+curr+k1+k1+k3+curr+k2+k1+k3);
		if(x==0+curr.size()){curr+=k3,i++;continue;}
		if(x==1+curr.size()){
			size_t x2=press(curr+k1+curr+k2+k2+k3+curr+k2+k3+k3+curr+k2+k2+k1);
			if(x2==curr.size()+1){curr+=k1+k3;i+=2;continue;}
			if(x2==curr.size()+2){
				size_t x3=press(curr+k2+k3+k1);
				if(x3==curr.size()+1) curr+=k2+k2+k2;
				else{
					if(x3==curr.size()+2) curr+=k2+k3+k2;
					else curr+=k2+k3+k1;
				}
				i+=3;
				continue;
			}
			size_t x3=press(curr+k2+k2+k3);
			if(x3==curr.size()+1) curr+=k2+k3+k3;
			else{
				if(x3==curr.size()+2) curr+=k2+k2+k1;
				else curr+=k2+k2+k3;
			}
			i+=3;
			continue;
		}
		if(x==2+curr.size()){
			size_t x2=press(curr+k2+k1+curr+k1+k2+k1+curr+k1+k2+k2);
			if(x2==curr.size()+1){
				size_t x3=press(curr+k1+k1+k1);
				if(x3==curr.size()+2) curr+=k1+k1+k2;
				else curr+=k1+k1+k1;
				i+=3;
				continue;
			}
			if(x2==curr.size()+2){
				size_t x3=press(curr+k2+k1+k1);
				if(x3==curr.size()+2) curr+=k2+k1+k2;
				else curr+=k2+k1+k1;
			}else{
				size_t x3=press(curr+k1+k2+k1);
				if(x3==curr.size()+2) curr+=k1+k2+k2;
				else curr+=k1+k2+k1;
			}
			i+=3;
			continue;
		}else{
			size_t x2=press(curr+k1+k2+k3);
			if(x2==curr.size()+3){curr+=k1+k2+k3;i+=3;continue;}
			x2=press(curr+k1+k1+k3);
			if(x2==curr.size()+3) curr+=k1+k1+k3;
			else curr+=k2+k1+k3;
			i+=3;
			continue;
		}
	}
	if((int)curr.size()==n-2){
		size_t x=press(curr+k1+k2+curr+k2+k2);
		if(x==curr.size()) curr+=k3;
		else{
			if(x==curr.size()+2){
				size_t x2=press(curr+k1+k2);
				if(x2==curr.size()+2) curr+=k1+k2;
				else curr+=k2+k2;
			}else{
				size_t x2=press(curr+k1+k1+curr+k2+k1);
				if(x2==curr.size()+2){
					size_t x3=press(curr+k1+k1);
					if(x3==curr.size()+2) curr+=k1+k1;
					else curr+=k2+k1;
				}else{
					size_t x3=press(curr+k1);
					if(x3==curr.size()+1) curr+=k1+k3;
					else curr+=k2+k3;
				}
			}
		}
	}
	if((int)curr.size()==n-1){
		size_t x=press(curr+k1);
		if(x==curr.size()+1) curr+=k1;
		else{
			x=press(curr+k2);
			if(x==curr.size()+1) curr+=k2;
			else curr+=k3;
		}
	}
	return curr;
}
/*int main(){
	cin>>s;
	cout<<guess_sequence(s.size())<<"\n";
	return 0;
}*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 0 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 0 ms 200 KB Output is correct
16 Correct 1 ms 200 KB Output is correct
17 Correct 0 ms 200 KB Output is correct
18 Correct 0 ms 200 KB Output is correct
19 Correct 0 ms 200 KB Output is correct
20 Correct 1 ms 200 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 0 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 0 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 0 ms 200 KB Output is correct
34 Correct 0 ms 200 KB Output is correct
35 Correct 0 ms 200 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 0 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 0 ms 200 KB Output is correct
16 Correct 0 ms 200 KB Output is correct
17 Correct 25 ms 336 KB Output is correct
18 Correct 22 ms 348 KB Output is correct
19 Correct 17 ms 336 KB Output is correct
20 Correct 23 ms 344 KB Output is correct
21 Correct 26 ms 336 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 2 ms 200 KB Output is correct
30 Correct 4 ms 200 KB Output is correct
31 Correct 4 ms 292 KB Output is correct
32 Correct 35 ms 340 KB Output is correct
33 Correct 16 ms 424 KB Output is correct
34 Correct 24 ms 336 KB Output is correct
35 Correct 24 ms 444 KB Output is correct
36 Correct 23 ms 436 KB Output is correct
37 Correct 27 ms 336 KB Output is correct
38 Correct 27 ms 344 KB Output is correct
39 Correct 27 ms 444 KB Output is correct
40 Correct 26 ms 344 KB Output is correct
41 Correct 18 ms 412 KB Output is correct
42 Correct 21 ms 340 KB Output is correct
43 Correct 22 ms 508 KB Output is correct
44 Correct 16 ms 348 KB Output is correct
45 Correct 23 ms 396 KB Output is correct
46 Correct 22 ms 340 KB Output is correct
47 Correct 24 ms 392 KB Output is correct
48 Correct 24 ms 336 KB Output is correct
49 Correct 21 ms 420 KB Output is correct
50 Correct 20 ms 440 KB Output is correct
51 Correct 25 ms 400 KB Output is correct
52 Correct 24 ms 356 KB Output is correct
53 Correct 25 ms 348 KB Output is correct
54 Correct 21 ms 384 KB Output is correct
55 Correct 24 ms 328 KB Output is correct
56 Correct 21 ms 432 KB Output is correct
57 Correct 22 ms 448 KB Output is correct
58 Correct 18 ms 324 KB Output is correct
59 Correct 24 ms 324 KB Output is correct
60 Correct 21 ms 324 KB Output is correct
61 Correct 25 ms 344 KB Output is correct
62 Correct 21 ms 416 KB Output is correct
63 Correct 24 ms 364 KB Output is correct
64 Correct 34 ms 448 KB Output is correct
65 Correct 23 ms 336 KB Output is correct
66 Correct 26 ms 432 KB Output is correct
67 Correct 25 ms 336 KB Output is correct
68 Correct 23 ms 536 KB Output is correct
69 Correct 24 ms 340 KB Output is correct
70 Correct 23 ms 404 KB Output is correct
71 Correct 12 ms 340 KB Output is correct
72 Correct 22 ms 368 KB Output is correct
73 Correct 25 ms 340 KB Output is correct
74 Correct 20 ms 396 KB Output is correct
75 Correct 23 ms 448 KB Output is correct
76 Correct 23 ms 344 KB Output is correct
77 Correct 16 ms 460 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 0 ms 200 KB Output is correct
80 Correct 1 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 1 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 200 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 0 ms 200 KB Output is correct
89 Correct 0 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct
92 Correct 1 ms 200 KB Output is correct
93 Correct 1 ms 200 KB Output is correct
94 Correct 1 ms 200 KB Output is correct
95 Correct 1 ms 200 KB Output is correct
96 Correct 1 ms 200 KB Output is correct
97 Correct 1 ms 200 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 1 ms 200 KB Output is correct
100 Correct 1 ms 200 KB Output is correct
101 Correct 1 ms 200 KB Output is correct
102 Correct 1 ms 200 KB Output is correct
103 Correct 1 ms 200 KB Output is correct
104 Correct 1 ms 200 KB Output is correct
105 Correct 2 ms 200 KB Output is correct
106 Correct 1 ms 200 KB Output is correct
107 Correct 1 ms 200 KB Output is correct
108 Correct 1 ms 200 KB Output is correct
109 Correct 1 ms 200 KB Output is correct
110 Correct 1 ms 200 KB Output is correct
111 Correct 1 ms 200 KB Output is correct
112 Correct 0 ms 200 KB Output is correct
113 Correct 0 ms 200 KB Output is correct
114 Correct 1 ms 200 KB Output is correct
115 Correct 0 ms 200 KB Output is correct
116 Correct 1 ms 200 KB Output is correct
117 Correct 1 ms 200 KB Output is correct
118 Correct 1 ms 200 KB Output is correct
119 Correct 1 ms 200 KB Output is correct
120 Correct 1 ms 200 KB Output is correct
121 Correct 1 ms 200 KB Output is correct
122 Correct 1 ms 200 KB Output is correct
123 Correct 1 ms 200 KB Output is correct