# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702791 | 2023-02-25T07:30:53 Z | salmon | Xylophone (JOI18_xylophone) | C++14 | 1 ms | 208 KB |
#include <bits/stdc++.h> #include "xylophone.h" using namespace std; int lst[5100]; int q[5100]; void solve(int N){ vector<int> v; int s, e, s1,e1; int en = 1; for(int i = N - 1; i >= 1; i--){ if(query(1,i) != N - 1){ en = i + 1; } } lst[en] = N; q[en] = 0; for(int i = en - 1; i > 0; i--){ int v = query(i,i + 1); q[i] = query(i,en); if(q[i + 1] == q[i]){ lst[i] = lst[i + 1] - v; } else{ lst[i] = lst[i + 1] + v; } } for(int i = en + 1; i <= N; i++){ int v = query(i - 1,i); q[i] = query(en,i); if(q[i - 1] == q[i]){ lst[i] = lst[i - 1] - v; } else{ lst[i] = lst[i - 1] + v; } } for(int i = 1; i <= N; i++){ answer(i,lst[i]); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Wrong Answer [4] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Wrong Answer [4] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | Wrong Answer [4] |
2 | Halted | 0 ms | 0 KB | - |