제출 #1085389

#제출 시각아이디문제언어결과실행 시간메모리
1085389mingga콤보 (IOI18_combo)C++17
0 / 100
1 ms388 KiB
#include "bits/stdc++.h" #include "combo.h" using namespace std; #define ln "\n" #define dbg(x) cout << #x << " = " << x << ln #define mp make_pair #define pb push_back #define fi first #define se second #define inf 2e18 #define fast_cin() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL) #define out(file) freopen(file, "w", stdout) #define in(file) freopen(file, "r", stdin) #define all(x) (x).begin(), (x).end() #define sz(x) ((int)(x).size()) // #define int long long int MOD = 1e9 + 7; char d[4] = {'A', 'B', 'X', 'Y'}; string guess_sequence(int n) { string ans = ""; if(press("AB") > 0) { if(press("A") == 1) ans = "A"; else ans = "B"; } else { if(press("X") == 1) ans = "X"; else ans = "Y"; } char fir = ans[0]; vector<char> vec; for(int i = 0; i < 4; i++) { if(d[i] == fir) continue; vec.pb(d[i]); } int st = 1; if((n-1) % 2 != 0) { st = 2; string tmp = ans + vec[0]; if(press(tmp) == 2) ans += vec[0]; else { tmp = ans + vec[1]; if(press(tmp) == 2) ans += vec[1]; else ans += vec[2]; } } for(int i = st; i < n; i+=2) { string tmp = ans + vec[0] + vec[1] + ans + vec[1] + vec[0] + ans + vec[1] + vec[1] + ans + vec[0] + vec[0]; // cout << tmp << ln; int cur = press(tmp); if(cur == sz(ans)) { tmp = ans + vec[2] + vec[0]; if(press(tmp) == sz(ans) + 2) ans += vec[2] + vec[0]; else ans += vec[2] + vec[1]; } else { string tmp = ans + vec[1] + vec[1]; int sus = press(tmp); if(sus == sz(ans)) { tmp = ans + vec[0] + vec[1]; if(press(tmp) == sz(ans) + 2) ans += vec[0] + vec[1]; else ans += vec[0] + vec[0]; } else if(sus == sz(ans) + 1) { ans += vec[1] + vec[0]; } else { ans += vec[1] + vec[1]; } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...