Submission #1298887

#TimeUsernameProblemLanguageResultExecution timeMemory
1298887scalifrastico_098Sphinx's Riddle (IOI24_sphinx)C++20
24 / 100
30 ms904 KiB
#include "sphinx.h" #include <bits/stdc++.h> using namespace std; vector<int> find_colours(int n, vector<int> x1, vector<int> y) { vector<int> e(n, n); int ox=n, l=1; vector<int> g(n); int i=0; g[0]=0; e[0]=-1; vector<vector<int>> a(n, vector<int> ()); for(int i=0; i<n; i++) { int l=0, r=n; while(l<r) { e.assign(n, n); int m=(l+r)/2; int yu=0; for(int k=0; k<n&&yu<m; k++) { if(i==k)continue; e[k]=yu; yu++; } e[i]=-1; int jk=perform_experiment(e); int hf=m; if(n-1-m>0)hf++; if(jk==hf) r=m; else l=m+1; } g[i]=l-1; } return g; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...