| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1299133 | alexiah | 스핑크스 (IOI24_sphinx) | C++20 | 1 ms | 400 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) , ans(n , -1);
int ini = perform_experiment(e);
int v = 0;
ans[0] = v;
for(int i = 0; i < n-1; i++){
for(int j = 0; j < n; j++) e[j] = -1;
e[i] = 0; e[i+1] = 0;
int act = perform_experiment(e);
if(act > ini) {v++; ans[i+1] = v;}
else ans[i+1] = ans[i];
}
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... | ||||
