| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1312327 | eri16 | Sphinx's Riddle (IOI24_sphinx) | C++20 | 8 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,0);
for (int i=0; i<n; i++){
int l = 0;
int r = n-1;
while (l<r){
vector <int> tm (n,n);
int mid = (l+r)/2;
for (int j=0; j<n; j++){
if (j==i){tm[j]=-1;}
else if(l+j<=mid){
tm[j]=l+j;
}
}
int found = perform_experiment(tm);
if (found == mid-l+1){
l=mid;
}
else{
mid=r;
}
}
ans[i]=l;
}
}
Compilation message (stderr)
| # | 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... | ||||
