| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1235873 | repsak | 스핑크스 (IOI24_sphinx) | C++20 | 0 ms | 412 KiB |
#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
vector<int> G(N, 0);
if(N == 2){
for(int i = 0; i < N; i++){
vector<int> E = {-1, i};
int x = perform_experiment(E);
if(x == 1){
G[0] = i;
}
vector<int> F = {i, -1};
x = perform_experiment(F);
if(x == 1){
G[1] = i;
}
}
return G;
}
// if (x == 1)
// G[0] = 1;
return G;
}
// #include "grader.cpp"| # | 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... | ||||
