# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
978004 | 2024-05-08T16:01:19 Z | canadavid1 | 콤보 (IOI18_combo) | C++17 | 1 ms | 504 KB |
#include "combo.h" #include <random> #include <algorithm> #include <utility> #include <iostream> #include <vector> int press2(std::string s) { // std::cout << s << std::endl; return press(s); } std::string guess_sequence(int N) { std::mt19937 rng(12345); std::string S; if(press2("AB")) if(press2("A")) S = "A"; else S = "B"; else if(press2("X")) S = "X"; else S = "Y"; std::vector<char> o; for(char i : "ABXY") if (S[0]!=i) o.push_back(i); std::vector<char> o2 = o; if(false) for(;S.size()*6+14<=4*N;) { //std::shuffle(o.begin(),o.end(),rng); //std::shuffle(o2.begin(),o2.end(),rng); //std::cerr << o << " " << o2 << "\n"; std::string guess = S + o[0] + S + o[1] + o2[0] + S + o[1] + o2[1] + S + o[1] + o2[2] + o[0] + S + o[1] + o2[2] + o[1] + S + o[1] + o2[2] + o[2]; switch(press2(guess)-S.size()) { case 0:S.push_back(o[2]);break; case 1:S.push_back(o[0]);break; case 2:S.push_back(o[1]);break; case 3: S.push_back(o[1]); S.push_back(o2[2]); break; default: break; } } for(;S.size()<N-1;) { std::string guess = S + o[0] + S + o[1] + o2[0] + S + o[1] + o2[1] + S + o[1] + o2[2]; switch(press2(guess)-S.size()) { case 0:S.push_back(o[2]);break; case 1:S.push_back(o[0]);break; case 2:S.push_back(o[1]);break; default: break; } } if(press2(S+o[0])==N) S.push_back(o[0]); else if (press2(S+o[1])==N) S.push_back(o[1]); else S.push_back(o[2]); return S; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 0 ms | 344 KB | Output is correct |
10 | Correct | 0 ms | 344 KB | Output is correct |
11 | Correct | 0 ms | 344 KB | Output is correct |
12 | Correct | 0 ms | 344 KB | Output is correct |
13 | Correct | 1 ms | 344 KB | Output is correct |
14 | Correct | 0 ms | 344 KB | Output is correct |
15 | Correct | 0 ms | 344 KB | Output is correct |
16 | Correct | 0 ms | 344 KB | Output is correct |
17 | Correct | 1 ms | 344 KB | Output is correct |
18 | Correct | 0 ms | 344 KB | Output is correct |
19 | Correct | 0 ms | 344 KB | Output is correct |
20 | Correct | 0 ms | 344 KB | Output is correct |
21 | Correct | 0 ms | 344 KB | Output is correct |
22 | Correct | 0 ms | 344 KB | Output is correct |
23 | Correct | 0 ms | 344 KB | Output is correct |
24 | Correct | 0 ms | 344 KB | Output is correct |
25 | Correct | 0 ms | 504 KB | Output is correct |
26 | Correct | 0 ms | 344 KB | Output is correct |
27 | Correct | 0 ms | 344 KB | Output is correct |
28 | Correct | 0 ms | 344 KB | Output is correct |
29 | Correct | 0 ms | 344 KB | Output is correct |
30 | Correct | 1 ms | 344 KB | Output is correct |
31 | Correct | 0 ms | 344 KB | Output is correct |
32 | Correct | 1 ms | 344 KB | Output is correct |
33 | Correct | 0 ms | 344 KB | Output is correct |
34 | Correct | 0 ms | 344 KB | Output is correct |
35 | Correct | 0 ms | 344 KB | Output is correct |
36 | Correct | 1 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Wrong Answer: wrong guess. |
2 | Halted | 0 ms | 0 KB | - |