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