제출 #156663

#제출 시각아이디문제언어결과실행 시간메모리
156663killB0x콤보 (IOI18_combo)C++14
0 / 100
2 ms200 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include "combo.h" using namespace std; using namespace __gnu_pbds; typedef long long int ll; typedef unsigned long long int ull; typedef pair<int,int> ii; typedef pair<ll,ll> dl; typedef vector<ii> vii; typedef vector<dl> vdll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<string> vs; #define pb push_back #define mp make_pair #define ft first #define sc second #define in insert #define bs binary_search #define rc(s) return cout << s,0 const ll mod=1e9+7; const int N=100005; #define INF LLONG_MAX #define sz(x) ((int)(x.size())) //#define int ll #define endl '\n' char ch[4]={'A','B','X','Y'}; string guess_sequence(int n){ char x; string tmp; for(int i=0;i<4;i++) { x=ch[i]; if(press(""+x)==1) { tmp+=x; break; } } for(int i=1;i<n;i++) { for(int j=0;j<4;j++) { if(ch[j]!=x) { if(press(tmp+ch[j])==i+1) { tmp+=ch[j]; break; } } } } return tmp; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...