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 "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=1e4+5;
int vs[nx];
void Solve(int N) {
for (int i=1; i<=2*N; i++)
{
if (vs[i]) continue;
for (int j=i+1; j<=2*N; j++) if (Query(vector<int> {i, j})==1) vs[i]=vs[j]=1, Answer(i, j);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |