# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011679 | 2024-07-01T05:05:31 Z | ezzzay | Xylophone (JOI18_xylophone) | C++17 | 0 ms | 344 KB |
#include "xylophone.h" #include<bits/stdc++.h> using namespace std; static int A[5000]; void solve(int N) { int n=N; int x; for(int i=2;i<N;i++){ if(query(1,N)!=N-1){ x=i-1; break; // i ni 1 esul 5 } } for(int i=1;i<=n;i++){ answer(i,i); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer [7] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer [7] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer [7] |
3 | Halted | 0 ms | 0 KB | - |