| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1206602 | HappyCapybara | 스핑크스 (IOI24_sphinx) | C++20 | 31 ms | 656 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> C(N, -1);
for (int i=0; i<N; i++){
int l = 0, r = N;
while (l < r-1){
int m = (l+r)/2;
int cur = 0;
vector<int> v(N, -1);
for (int j=0; j<N; j++){
if (i == j) continue;
v[j] = cur;
if (cur < m-1) cur++;
}
if (perform_experiment(v) == m) r = m;
else l = m;
}
C[i] = l;
}
return C;
}
| # | 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... | ||||
