# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
861106 | 2023-10-15T10:14:29 Z | vjudge1 | Xylophone (JOI18_xylophone) | C++ | 1 ms | 344 KB |
#include "xylophone.h" #include <bits/stdc++.h> using namespace std; void solve(int n) { int A[n + 1]; A[2] = query(1, 2); for (int i = 2; i < n; i++) { int x = query(i, i + 1); int y = query(i - 1, i + 1); A[i + 1] = A[i] + x * (A[i] - A[i - 1] < 0 ? 1 : -1) * (y == x + abs(A[i] - A[i - 1]) ? -1 : 1); } int mn = *min_element(A + 1, A + n + 1); int u, v; for (int i = 1; i <= n; i++) { A[i] -= mn; if (!A[i]) u = i; if (A[i] == n - 1) v = i; } bool flag = u < v; for (int i = 1; i <= n; i++) answer(i, flag ? A[i] + 1 : n - A[i]); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Incorrect | 1 ms | 344 KB | Wrong Answer [4] |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Incorrect | 1 ms | 344 KB | Wrong Answer [4] |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Incorrect | 1 ms | 344 KB | Wrong Answer [4] |
5 | Halted | 0 ms | 0 KB | - |