Submission #1188290

#TimeUsernameProblemLanguageResultExecution timeMemory
1188290hcngSphinx's Riddle (IOI24_sphinx)C++20
0 / 100
0 ms412 KiB
#include "sphinx.h" #include <bits/stdc++.h> using namespace std; #define Query(x) perform_experiment(x) vector<int> find_colours(int n, vector<int> X, vector<int> Y) { vector<int> G(n); for (int i = 0; i < n; i++) G[i] = i; for (int i = 1; i < n; i++) { vector<int> E(n, n); E[i] = E[i - 1] = -1; int x = Query(E) + (x == 1); if (x == 3) G[i] = G[i - 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...