| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1188288 | hcng | Sphinx's Riddle (IOI24_sphinx) | C++20 | 41 ms | 908 KiB |
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
#define Query(x) perform_experiment(x)
vector<int> find_colours(int n, vector<int> X, vector<int> Y) {
vector<int> G(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
vector<int> E(n, j);
E[i] = -1;
int x = Query(E);
if (x == 1) {
G[i] = j;
break;
}
}
}
return G;
}| # | 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... | ||||
