Submission #410888

#TimeUsernameProblemLanguageResultExecution timeMemory
410888abdzagCombo (IOI18_combo)C++17
0 / 100
2 ms200 KiB
#include<bits/stdc++.h> #include<unordered_map> #include "combo.h" #define rep(i,a,b) for(int i=int(a);i<int(b);i++) #define rrep(i,a,b) for(int i=int(a);i>int(b);i--) #define all(v) v.begin(),v.end() #define trav(a,v) for(auto&a:v) #define sz(a) a.size() typedef long double ld; using namespace std; static const long long inf = 1e15; typedef long long ll; typedef unsigned long long ull; string guess_sequence(int N) { string p = ""; string cringe = ""; vector<string> v = { "A","X","Y","B" }; rep(i, 0, 3) { if (press(v[i])) { cringe += v[i]; v.erase(v.begin() + i); p += cringe; break; } } ll cur = 1; if (N == 1)return p; rep(i, 0, N - 2) { string nxt = p; nxt += v[0]; nxt += p + v[1] + v[0]; nxt += p + v[1] + v[1]; nxt += p + v[1] + v[2]; int val = press(nxt); if (val == cur + 1) { p += v[0]; } else if (val == cur + 2) { p += v[1]; } else p += v[2]; cur++; } rep(i, 0, 3) { string nxt = p + v[i]; if (press(nxt) == N) { p += v[i]; break; } } return p; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...