| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1299144 | alexiah | 스핑크스 (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> x, vector<int> y) {
vector<int> col(n , 0) , ans(n , 0);
for(int i = 0; i < n-1; i++){
vector<int> e = col;
e[i] = 1;
int act = perform_experiment(e);
if(act == i+1) ans[i] = 1;
if(act == i) ans[i-1] = 1;
e[i] = 0; e[i+1] = 0;
}
return ans;
}
| # | 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... | ||||
