| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1298385 | scalifrastico_098 | Sphinx's Riddle (IOI24_sphinx) | C++20 | 1 ms | 332 KiB |
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_colours(int n, vector<int> x1, vector<int> y) {
vector<vector<int>> a(n+1, vector<int> ());
vector<int> e(n, -1); int x = perform_experiment(e);
vector<int> g(n, 0);
for(int i=0; i<n; i++)
{
e.assign(n, n);
for(int j=0; j<n; j++)
{
e[j]=-1;
int u1=perform_experiment(e);
if(u1==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... | ||||
