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 "minerals.h"
using namespace std;
void Solve(int N)
{
int n = N;
vector<int> done(2*n, 0);
for(int c1 = 0; c1 < 2*n; c1++){
if(done[c1] == 0){
Query(c1+1);
for(int c2 = c1+1; c2 < 2*n; c2++){
if(done[c2] == 0){
int temp = Query(c2+1);
if(temp == 1){
Answer(c1+1,c2+1);
done[c1] = 1;
done[c2] = 1;
}
Query(c2+1);
if(done[c1] == 1)break;
}
}
Query(c1+1);
}
}
}
# | 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... |