| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 622635 | PanTkd | Combo (IOI18_combo) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//
// main.cpp
//
// Created by Panagiotis Chadjicostas on
// Copyright © Panagiotis Hadjicostas. All rights reserved.
//
#include <"Combo.h">
#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#define fo(i,a,b) for(int i = a; i<=b; i++)
#define f(i,b) for(int i=0;i<b;i++)
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void checker(){
ll n=rand()%20+2;
vi a(n,ll());
for(ll i=0;i<n;i++){
a[i]=rand()%20+2;
}
for(ll b=0;b<(1<<n);b++){
vi on,off;
for(ll i=0;i<n;i++){
if(i&(1<<i)){
on.push_back(i);
}
else{
off.push_back(i);
}
}
}
}
///////////////////////////////////////////////////////////////////////
int press(string p);
string guess_sequence(int N){
char ch[4]={'A','B','X','Y'};
// gia na vro to arxiko
ll idx=3;
for(ll i=0;i<3;i++){
if(press(string(ch[i]))){
idx=i;
}
}
swap(ch[0],ch[idx]);
string s="";
s+=ch[0];
for(ll i=2;i<=n;i++){
string temp= s;
temp+=ch[1];
temp+=s;
temp+=ch[2];
temp+=ch[1];
temp+=s;
temp+=ch[2];
temp+=ch[2];
temp+=s;
temp+=ch[2];
temp+=ch[3];
ll ans=press(temp);
if(ans==s.size()){
s+=ch[3];
}
else if(ans==s.size()+2){
s+=ch[2];
}
else
s+=ch[1];
return s;
}
}