| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1312098 | eri16 | 스핑크스 (IOI24_sphinx) | C++20 | 1 ms | 332 KiB |
#include <bits/stdc++.h>
#include "sphinx.h"
using namespace std;
vector<int> find_colours(int N, vector<int> X, vector<int> Y){
int n = N;
vector <int> ans(n);
int cur = 1;
ans[0]=cur;
for (int i=1; i<n; i++){
int target=4;
if (i==1 || i==n-1){target=3;}
vector <int> tm (n,n);
tm[i]=-1;
tm[i-1]=-1;
int found = perform_experiment(tm);
if (found==target){
cur=1-cur;
}
ans[i]=cur;
}
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... | ||||
