Submission #111972

#TimeUsernameProblemLanguageResultExecution timeMemory
111972mechfrog88Memory 2 (JOI16_memory2)C++14
0 / 100
3 ms384 KiB
#include "Memory2_lib.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; void Solve(int T, int N){ vector <ll> num(N,0); vector <bool> visited(N*2,false); for (int z=N-1;z>-1;z--){ bool ok = true; for (int x=0;x<N*2 && ok;x++){ if (visited[x]) continue; for (int next=0;next<N*2 && ok;next++){ if (x == next) continue; if (visited[next]) continue; if (Flip(x,next) == z){ Answer(x,next,z); visited[x] = true; visited[next] = true; ok = false; } } } } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...