| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1233710 | lalig777 | Sphinx's Riddle (IOI24_sphinx) | C++20 | 31 ms | 656 KiB |
#include "sphinx.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
//#define int long long
using namespace std;
int perform_experiment(vector<int> E);
vector<int> find_colours(int N, vector<int> X, vector<int> Y){
vector<int>S(N, -1);
vector<int>ans(N, -1);
for (int i=0; i<N; i++){
int l=0, r=N-1;
while (l<r){
int j=0;
int m=(l+r)/2;
int cols=m-l+1;
for (int k=l; k<=m; k++){
if (j==i){
S[j]=-1;
j++;
}S[j]=k;
j++;
}
while (j<N){
if (j==i) S[j]=-1;
else S[j]=m;
j++;
}
int comp=perform_experiment(S);
if (comp==cols) r=m;
else l=m+1;
}ans[i]=l;
}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... | ||||
