# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503938 | Abrar_Al_Samit | Xylophone (JOI18_xylophone) | C++17 | 0 ms | 0 KiB |
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 "grader.cpp"
using namespace std;
void solve(int N) {
int p = 2;
while(query(p, N)==N-1) {
++p;
}
--p;
int ans[N+1];
for(int i=1; i<=N; ++i) {
if(i==p) {
ans[i] = 1;
} else {
ans[i] = 1+query(1, p);
}
}
for(int i=1; i<=N; ++i) {
answer(i, ans[i]);
}
}