# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1129627 | c0det1ger | Sphinx's Riddle (IOI24_sphinx) | C++20 | 53 ms | 656 KiB |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define double long double
int perform_experiment(vector<int> E);
vector<int> find_colours(int N, vector<int> X, vector<int> Y){
if (N <= 50){
vector<int> c(N);
for (int i = 0; i < N; i++){
for (int j = 0; j < N; j++){
vector<int> e(N);
for (int k = 0; k < N; k++){
if (k == i){
e[k] = -1;
}
else{
e[k] = j;
}
}
int ans = perform_experiment(e);
if (ans == 1){
c[i] = j;
break;
}
}
}
return c;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |