| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298736 | gesp3011v2 | Sphinx's Riddle (IOI24_sphinx) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#include "sphinx.h"
using namespace std;
vector<int>exp,ans;
std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y){
exp.resize(N);
ans.resize(N);
if(N<=50){
for(int u=0;u<N;u++){
for(int col=0;col<N;col++){
for(int i=0;i<N;i++)exp[i]=col;
exp[u]=-1;
if(perform_experiment(exp)==1)ans[u]=col;
}
}
return ans;
}
ans[0]=0;
int cnt=2;
exp[0]=-1;
for(int i=1;i<N;i++)exp[i]=N;
for(int i=1;i<N;i++){
exp[i]=-1;
int ncnt=perform_experiment(exp);
if(ncnt==cnt){
if(i<N-1)ans[i]=ans[i-1];
else ans[i]=1-ans[i-1];
}else{
if(i<N-1)ans[i]=1-ans[i-1];
else ans[i]=ans[i-1];
}
cnt=ncnt;
}
return ans;
}
