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 <bits/stdc++.h>
#include "chameleon.h"
using namespace std;
void Solve(int N)
{
vector<bool> answered(N * 2 + 1);
for(int i = 1; i <= N * 2; i++)
{
if(answered[i]) continue;
for(int j = i + 1; j <= N * 2; j++)
{
if(answered[j]) continue;
if(Query({i, j}) == 1)
{
Answer(i, j);
answered[i] = true;
answered[j] = true;
}
}
}
}
# | 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... |