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>
using namespace std;
#include "chameleon.h"
void Solve(int N) {
vector<pair<int, int>> vec;
for (int x = 1; x <= 2*N; x++){
for (int y = x+1; y <= 2*N; y++){
if (Query({x, y}) == 1){
vec.push_back({x, y});
}
}
}
for (auto item : vec) Answer(item.first, item.second);
}
# | 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... |