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 "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n) {
int l = 1;
while(query(l, n) == n - 1) {
l++;
}
l--;
for(int i = 1; i <= n; i++) {
if(i <= l) {
answer(i, query(i, l) + 1);
}
else {
answer(i, query(l, i) + 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... |