| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1228602 | tamzid | Sphinx's Riddle (IOI24_sphinx) | C++20 | 0 ms | 400 KiB |
#include "sphinx.h"
#include <vector>
std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
std::vector<int> E(N, -1);
int components = perform_experiment(E);
std::vector<int> G(N);
if (components == 1) {
G[0] = 0;
G[1] = 0;
} else {
G[0] = 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... | ||||
