| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1231572 | tamzid | Sphinx's Riddle (IOI24_sphinx) | C++20 | 0 ms | 412 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);
int x = perform_experiment(E);
vector<int> G(N);
if(x == 0)
{
E[0] = 0;
x = perform_experiment(E);
if(x == 1)
{
G[0] = 1;
G[1] = 0;
}
else
{
G[0] = 0;
G[1] = 1;
}
}
else
{
E[0] = 0;
x = perform_experiment(E);
if(x == 1)
{
G[0] = G[1] = 0;
}
else
{
G[0] = G[1] = 1;
}
}
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... | ||||
