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 "key.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
bool ans[1005][1005];
int num[1005];
void EnsureKeyInfo(int N) {
for(int i = 1; i <= N; i++) {
TakeKey(i);
num[i] = Explore();
}
for(int i = 1; i <= N; i++) {
ans[i][i] = 1;
for(int j = i + 1; j <= N; j++) {
TakeKey(i); TakeKey(j);
int tmp = Explore();
if(tmp == num[i]) ans[i][j] = true;
if(tmp == num[j]) ans[j][i] = true;
}
}
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++) {
if(ans[i][j]) Report(i, 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... |