# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702790 | salmon | Xylophone (JOI18_xylophone) | C++14 | 0 ms | 208 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 <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 = 1 + 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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |