| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1312087 | eri16 | Sphinx's Riddle (IOI24_sphinx) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "sphinx.h"
using namespace std;
vector<int> find_colours(int N, vector<int> X, vector<int> Y){
vector <int> ans(n,0);
int cur = 1;
ans[0]=cur;
for (int i=1; i<n; i++){
int target=4;
if (i==1 || i==n){target=3;}
vector <int> tm (n,n);
tm[i]=-1;
tm[i-1]=-1;
ll found = perform_experiment(tm);
if (found==target){
cur=1-cur;
}
ans[i]=cur;
}
return ans;
}
