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