Submission #600454

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
600454	2022-07-20T21:45:22 Z	angelo_torres	Combo (IOI18_combo)	C++17	5 / 100	1 ms	336 KB

combo

#include <bits/stdc++.h>
// #include <string>
#include "combo.h"

using namespace std;

// int press(string mn){
// 	int tc;
// 	cout << mn << endl;
// 	cin >> tc;
// 	return tc;
// }

string add(string s,string t){
	string ans = s;
	for(auto it : t) 
		ans.push_back(it);
	return ans;
}

int n;
vector<string> v = {"A","B","X","Y"};


string guess_sequence(int N){
	n = N;
	// cin >> n;
	string s = "";
	if(press("AB")){
		if(press("A")){
			s = "A";
			v.erase(v.begin());
		}
		else{
			s = "B";
			v.erase(v.begin()+1);
		}
	}
	else{
		if(press("X")){
			s = "X";
			v.erase(v.begin()+2);
		}
		else{
			s = "Y";
			v.erase(v.begin()+3);
		}
	}
	// cout << s << endl;
	for(int i = 1; i <= n-2; ++i){
		int csi = i;
		string pos = "";
		pos = add(pos,add(s,v[0]));
		pos = add(pos,add(s,add(v[1],v[0])));
		pos = add(pos,add(s,add(v[1],v[1])));
		pos = add(pos,add(s,add(v[1],v[2])));
		int val = press(pos);
		if(val == csi){
			s = add(s,v[2]);
		}
		if(val == csi+1){
			s = add(s,v[0]);
		}
		if(val == csi+2){
			s = add(s,v[1]);
		}
	}
	if(press(add(add(s,v[0]),add(s,v[1]))) == n){
		if(press(add(s,v[0])) == n){
			s = add(s,v[0]);
		}
		else{
			s = add(s,v[1]);
		}
	}
	else{
		s = add(s,v[2]);
	} 
	return s;
}

// int main(){
// 	cout << guess_sequence(0) << endl;
// 	return 0;
// }

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 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	1 ms	336 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	1 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	1 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	0 ms	208 KB	Output is correct
25	Correct	0 ms	208 KB	Output is correct
26	Correct	0 ms	208 KB	Output is correct
27	Correct	1 ms	208 KB	Output is correct
28	Correct	1 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	1 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct

Subtask #2

0 / 95.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	208 KB	Wrong Answer: wrong guess.
2	Halted	0 ms	0 KB	-