This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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--){
for (int x=0;x<N*2;x++){
if (visited[x]) continue;
for (int next=0;next<N*2;next++){
if (x == next) continue;
if (visited[next]) continue;
if (Flip(x,next) == z){
Answer(x,next,z);
visited[x] = true;
visited[next] = true;
}
}
}
}
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |