# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
956431 | 2024-04-01T21:30:15 Z | nigus | Minerals (JOI19_minerals) | C++14 | 0 ms | 0 KB |
#include "maskroskaos.h" void Solve(int N) { int n = N; vector<int> done(2*n, 0); for(int c1 = 0; c1 < 2*n; c1++){ if(done[c1] == 0){ Query(c1+1); for(int c2 = c1+1; c2 < 2*n; c2++){ if(done[c2] == 0){ int temp = Query(c2+1); if(temp == 1){ Answer(c1+1,c2+1); done[c1] = 1; done[c2] = 1; } Query(c2+1); if(done[c1] == 1)break; } } Query(c1+1); } } }