| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298326 | alexiah | Sphinx's Riddle (IOI24_sphinx) | C++20 | 0 ms | 0 KiB |
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_colours(int n, vector<int> x, vector<int> y) {
vector<int> e(n , -1) , g(n);
int x = perform_experiment(e);
for(int i = 0; i < n; i++){
for(int j = 0; i < n; j++){
if(i == j) e[j] = -1;
e[j] = 1;
}
int aux = perform_experiment(e);
if(aux == 1) g[i] = 1;
else g[i] = 0;
}
return g;
}
