# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1122717 | aaaaaarroz | Sphinx's Riddle (IOI24_sphinx) | C++20 | 0 ms | 412 KiB |
#include <bits/stdc++.h>
using namespace std;
int perform_experiment(vector<int> e);
vector<int>alll(int n,vector<int> x,vector<int> y){
vector<int>color(n);
for(int i=0;i<n;i++){
vector<int>nodos;
for(int j=0;j<n;j++){
if(j!=i){
nodos.push_back(j);
}
}
int l=0,r=n-1;
while(l<r){
int mid=(l+r)/2;
vector<int>exp(n,l);
exp[i]=-1;
int node=0;
for(int j=l;j<=mid;j++){
exp[nodos[node]]=j;
node++;
}
int experimento=perform_experiment(exp);
if(experimento==(mid-l+1)){
r=mid;
}
else{
l=mid+1;
}
}
# | 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... |