| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 125087 |
2019-07-04T15:05:52 Z |
arthurconmy |
Combo (IOI18_combo) |
C++14 |
|
56 ms |
460 KB |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>
#include "combo.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef pair<int,int> pii;
#define REP(i, a, b) for (int i = int(a); i <= int(b); i++)
#define REPb(j, d, c) for (int j = int(d); j >= int(c); j--)
#define ff first
#define ss second
#define pb push_back
#define len(x) int((x).size())
string guess_sequence(int N)
{
int n=N;
string ans;
int ret1 = press("AB");
if(ret1>0)
{
int ret2=press("A");
if(ret2>0) ans+='A';
else ans+='B';
}
else
{
int ret2=press("X");
if(ret2>0) ans+='X';
else ans+='Y';
}
if(N==1) return ans;
vector<char> ALL = {'A','B','X','Y'};
vector<char> V;
REP(i,0,3)
{
if(ALL[i] != ans[0]) V.pb(ALL[i]);
}
REP(i,2,n-1)
{
string cur_press = ans+V[0]+ans+V[1]+V[0]+ans+V[1]+V[1]+ans+V[1]+V[2];
int ret3=press(cur_press);
if(ret3==i-1) ans+=V[2];
if(ret3==i) ans+=V[0];
if(ret3==i+1) ans+=V[1];
}
int ret4=press(ans+V[0]);
if(ret4==N) return ans+V[0];
int ret5=press(ans+V[1]);
if(ret5==N) return ans+V[1];
return ans+V[2];
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
200 KB |
Output is correct |
| 2 |
Correct |
2 ms |
200 KB |
Output is correct |
| 3 |
Correct |
2 ms |
200 KB |
Output is correct |
| 4 |
Correct |
1 ms |
220 KB |
Output is correct |
| 5 |
Correct |
1 ms |
200 KB |
Output is correct |
| 6 |
Correct |
2 ms |
200 KB |
Output is correct |
| 7 |
Correct |
2 ms |
200 KB |
Output is correct |
| 8 |
Correct |
2 ms |
200 KB |
Output is correct |
| 9 |
Correct |
1 ms |
256 KB |
Output is correct |
| 10 |
Correct |
2 ms |
200 KB |
Output is correct |
| 11 |
Correct |
2 ms |
200 KB |
Output is correct |
| 12 |
Correct |
1 ms |
200 KB |
Output is correct |
| 13 |
Correct |
2 ms |
200 KB |
Output is correct |
| 14 |
Correct |
1 ms |
200 KB |
Output is correct |
| 15 |
Correct |
2 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
200 KB |
Output is correct |
| 17 |
Correct |
2 ms |
200 KB |
Output is correct |
| 18 |
Correct |
1 ms |
200 KB |
Output is correct |
| 19 |
Correct |
2 ms |
200 KB |
Output is correct |
| 20 |
Correct |
1 ms |
200 KB |
Output is correct |
| 21 |
Correct |
1 ms |
200 KB |
Output is correct |
| 22 |
Correct |
1 ms |
200 KB |
Output is correct |
| 23 |
Correct |
2 ms |
200 KB |
Output is correct |
| 24 |
Correct |
2 ms |
200 KB |
Output is correct |
| 25 |
Correct |
1 ms |
200 KB |
Output is correct |
| 26 |
Correct |
1 ms |
200 KB |
Output is correct |
| 27 |
Correct |
1 ms |
200 KB |
Output is correct |
| 28 |
Correct |
1 ms |
200 KB |
Output is correct |
| 29 |
Correct |
1 ms |
200 KB |
Output is correct |
| 30 |
Correct |
1 ms |
200 KB |
Output is correct |
| 31 |
Correct |
1 ms |
200 KB |
Output is correct |
| 32 |
Correct |
1 ms |
200 KB |
Output is correct |
| 33 |
Correct |
1 ms |
200 KB |
Output is correct |
| 34 |
Correct |
2 ms |
200 KB |
Output is correct |
| 35 |
Correct |
1 ms |
200 KB |
Output is correct |
| 36 |
Correct |
2 ms |
200 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
200 KB |
Output is correct |
| 2 |
Correct |
2 ms |
200 KB |
Output is correct |
| 3 |
Correct |
1 ms |
200 KB |
Output is correct |
| 4 |
Correct |
1 ms |
200 KB |
Output is correct |
| 5 |
Correct |
1 ms |
200 KB |
Output is correct |
| 6 |
Correct |
1 ms |
200 KB |
Output is correct |
| 7 |
Correct |
2 ms |
200 KB |
Output is correct |
| 8 |
Correct |
1 ms |
200 KB |
Output is correct |
| 9 |
Correct |
1 ms |
200 KB |
Output is correct |
| 10 |
Correct |
1 ms |
200 KB |
Output is correct |
| 11 |
Correct |
2 ms |
200 KB |
Output is correct |
| 12 |
Correct |
2 ms |
200 KB |
Output is correct |
| 13 |
Correct |
2 ms |
200 KB |
Output is correct |
| 14 |
Correct |
1 ms |
200 KB |
Output is correct |
| 15 |
Correct |
2 ms |
200 KB |
Output is correct |
| 16 |
Correct |
1 ms |
200 KB |
Output is correct |
| 17 |
Correct |
43 ms |
404 KB |
Output is correct |
| 18 |
Correct |
56 ms |
340 KB |
Output is correct |
| 19 |
Correct |
41 ms |
460 KB |
Output is correct |
| 20 |
Correct |
42 ms |
428 KB |
Output is correct |
| 21 |
Correct |
29 ms |
432 KB |
Output is correct |
| 22 |
Correct |
2 ms |
200 KB |
Output is correct |
| 23 |
Correct |
2 ms |
296 KB |
Output is correct |
| 24 |
Correct |
2 ms |
200 KB |
Output is correct |
| 25 |
Correct |
3 ms |
200 KB |
Output is correct |
| 26 |
Correct |
3 ms |
300 KB |
Output is correct |
| 27 |
Correct |
3 ms |
288 KB |
Output is correct |
| 28 |
Correct |
4 ms |
316 KB |
Output is correct |
| 29 |
Correct |
2 ms |
320 KB |
Output is correct |
| 30 |
Correct |
4 ms |
324 KB |
Output is correct |
| 31 |
Correct |
5 ms |
328 KB |
Output is correct |
| 32 |
Execution timed out |
33 ms |
348 KB |
Time limit exceeded (wall clock) |
| 33 |
Halted |
0 ms |
0 KB |
- |
