Submission #1298484

#TimeUsernameProblemLanguageResultExecution timeMemory
1298484scalifrastico_098Sphinx's Riddle (IOI24_sphinx)C++20
0 / 100
1 ms332 KiB
#include "sphinx.h" #include <bits/stdc++.h> using namespace std; vector<int> find_colours(int n, vector<int> x1, vector<int> y) { vector<vector<int>> a(n+1, vector<int> ()); vector<int> e(n, -1); int ox=0; vector<int> g(n, -1); int i=0; while(i<n-1) { e.assign(n, n); e[i]=-1; e[i+1]=-1; int u1=perform_experiment(e); if(u1==2){if(g[i]==-1)g[i]=ox; g[i+1]=ox;} else {if(g[i]==-1)g[i]=ox; ox++; g[i+1]=ox;} ox++; i++; } 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...