oj.uz

Submission #671006

# Submission time Handle Problem Language Result Execution time Memory
671006 2022-12-11T16:02:53 Z Arixcrest Combo (IOI18_combo) C++17
100 / 100
 71 ms 760 KB 
#include <bits/stdc++.h>
#include <combo.h>
using namespace std;
 
using ll =  long long;
#define pi pair<int,int> 
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
const ll INF = -1;
const int mx = 1e5+5;
const int modulo =1e9+7;
mt19937 mt;
// int press(string p){
// 	cout<<p<<'\n';
// 	string s = "YAA";
// 	int mx = 0;
// 	rep(x,0,p.length()-s.length()+1){
// 		int cnt = 0;
// 		rep(y,0,s.length()){
// 			if(p[x+y]==s[y]){
// 				cnt++;
// 			}else{
// 				break;
// 			}
// 		}
// 		mx = max(mx,cnt);
// 	}
// 	return mx;
// }
std::string fillseq(string s,int sz){
	string temp = "";
	while(temp.size()<sz){
		temp+=s;
	}
	while(temp.size()>sz) temp.pop_back();
	return temp;
}
std::string guess_sequence(int n){
	n = 4*n;
	int mx = 0;
	string ans = "";
	int v;
	vector<char> vals = {'A','B','X','Y'};
	int cnt =0;
	while(mx!=n/4){
		cnt++;
		if(mx==0){
			string temp1 = fillseq("A",n/2);
			temp1+=fillseq("B",n/2);
			v = press(temp1);
			if(v>mx){
				temp1 = fillseq("A",n);
				v = press(temp1);
				if(v>mx){
					ans+="A";
				}else{
					ans+="B";
				}
			}else{
				temp1 = fillseq("X",n);
				v = press(temp1);
				if(v>mx){
					ans+='X';
				}else{
					ans+="Y";
				}
			}
			mx = 1;
			for(auto it = vals.begin();it!=vals.end();it++){
				if(*it==ans.front()){
					vals.erase(it);
					break;
				}
			}
		}else{
			if(mx==n/4-1){
				string temp1 = ans+vals[0];
				while(temp1.size()<n) temp1+=(ans.front());
				v = press(temp1);
				if(v-mx==1){
					ans+=vals[0];
					break;
				}
				temp1 = ans+vals[1];
				while(temp1.size()<n) temp1+=(ans.front());
				v = press(temp1);
				if(v-mx==1){
					ans+=vals[1];
					break;
				}else{
					ans+=vals[2];
					break;
				}

			}
			else{
				string temp1 = ans+vals[0]+vals[0];
				temp1+=ans+vals[0]+vals[1];
				temp1+=ans+vals[0]+vals[2];
				temp1+=ans+vals[1];
				while(temp1.size()<n) temp1+=(ans.front());
				v = press(temp1);
				if(v-mx==2){
					ans+=vals[0];
				}else if(v-mx==1){
					ans+=vals[1];
				}else{
					ans+=(vals[2]);
				}
				mx++;
			}

		}
	}
	// cout<<cnt<<" "<<ans<<"\n";
	return ans;

}

Compilation message

combo.cpp: In function 'std::string fillseq(std::string, int)':
combo.cpp:32:19: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   32 |  while(temp.size()<sz){
      |        ~~~~~~~~~~~^~~
combo.cpp:35:19: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |  while(temp.size()>sz) temp.pop_back();
      |        ~~~~~~~~~~~^~~
combo.cpp: In function 'std::string guess_sequence(int)':
combo.cpp:78:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |     while(temp1.size()<n) temp1+=(ans.front());
      |           ~~~~~~~~~~~~^~
combo.cpp:85:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |     while(temp1.size()<n) temp1+=(ans.front());
      |           ~~~~~~~~~~~~^~
combo.cpp:101:23: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |     while(temp1.size()<n) temp1+=(ans.front());
      |           ~~~~~~~~~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 0 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 0 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 208 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 64 ms 480 KB Output is correct
18 Correct 68 ms 476 KB Output is correct
19 Correct 66 ms 552 KB Output is correct
20 Correct 62 ms 496 KB Output is correct
21 Correct 53 ms 404 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 2 ms 208 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 3 ms 336 KB Output is correct
31 Correct 3 ms 336 KB Output is correct
32 Correct 54 ms 520 KB Output is correct
33 Correct 54 ms 484 KB Output is correct
34 Correct 55 ms 532 KB Output is correct
35 Correct 54 ms 448 KB Output is correct
36 Correct 61 ms 532 KB Output is correct
37 Correct 58 ms 504 KB Output is correct
38 Correct 61 ms 540 KB Output is correct
39 Correct 70 ms 592 KB Output is correct
40 Correct 64 ms 396 KB Output is correct
41 Correct 70 ms 716 KB Output is correct
42 Correct 68 ms 392 KB Output is correct
43 Correct 71 ms 400 KB Output is correct
44 Correct 54 ms 388 KB Output is correct
45 Correct 58 ms 536 KB Output is correct
46 Correct 54 ms 488 KB Output is correct
47 Correct 62 ms 628 KB Output is correct
48 Correct 69 ms 392 KB Output is correct
49 Correct 67 ms 544 KB Output is correct
50 Correct 62 ms 604 KB Output is correct
51 Correct 60 ms 552 KB Output is correct
52 Correct 55 ms 556 KB Output is correct
53 Correct 54 ms 428 KB Output is correct
54 Correct 70 ms 644 KB Output is correct
55 Correct 55 ms 396 KB Output is correct
56 Correct 53 ms 392 KB Output is correct
57 Correct 66 ms 572 KB Output is correct
58 Correct 66 ms 496 KB Output is correct
59 Correct 65 ms 496 KB Output is correct
60 Correct 64 ms 500 KB Output is correct
61 Correct 64 ms 680 KB Output is correct
62 Correct 68 ms 760 KB Output is correct
63 Correct 59 ms 540 KB Output is correct
64 Correct 58 ms 472 KB Output is correct
65 Correct 58 ms 604 KB Output is correct
66 Correct 71 ms 724 KB Output is correct
67 Correct 59 ms 476 KB Output is correct
68 Correct 58 ms 548 KB Output is correct
69 Correct 66 ms 700 KB Output is correct
70 Correct 67 ms 448 KB Output is correct
71 Correct 57 ms 436 KB Output is correct
72 Correct 61 ms 560 KB Output is correct
73 Correct 65 ms 468 KB Output is correct
74 Correct 54 ms 564 KB Output is correct
75 Correct 65 ms 476 KB Output is correct
76 Correct 66 ms 580 KB Output is correct
77 Correct 63 ms 492 KB Output is correct
78 Correct 2 ms 208 KB Output is correct
79 Correct 1 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 1 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 2 ms 304 KB Output is correct
85 Correct 1 ms 308 KB Output is correct
86 Correct 1 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 0 ms 208 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 1 ms 208 KB Output is correct
101 Correct 1 ms 208 KB Output is correct
102 Correct 1 ms 208 KB Output is correct
103 Correct 1 ms 208 KB Output is correct
104 Correct 1 ms 208 KB Output is correct
105 Correct 1 ms 208 KB Output is correct
106 Correct 1 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 1 ms 208 KB Output is correct
109 Correct 0 ms 208 KB Output is correct
110 Correct 0 ms 208 KB Output is correct
111 Correct 1 ms 208 KB Output is correct
112 Correct 0 ms 208 KB Output is correct
113 Correct 0 ms 208 KB Output is correct
114 Correct 1 ms 208 KB Output is correct
115 Correct 1 ms 208 KB Output is correct
116 Correct 0 ms 208 KB Output is correct
117 Correct 0 ms 304 KB Output is correct
118 Correct 1 ms 208 KB Output is correct
119 Correct 1 ms 308 KB Output is correct
120 Correct 1 ms 208 KB Output is correct
121 Correct 2 ms 208 KB Output is correct
122 Correct 1 ms 208 KB Output is correct
123 Correct 1 ms 208 KB Output is correct