# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1085308 | 4QT0R | Xylophone (JOI18_xylophone) | C++17 | 1 ms | 344 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;
void solve(int n){
vector<int> zap(n+1);
for (int i = 1; i<n; i++){
zap[i]=query(i,i+1);
}
vector<int> ciag(n+1);
ciag[1]=zap[1];
for (int i = 2; i<n; i++){
int q=query(i-1,i+1);
if (zap[i-1]==q || zap[i]==q)ciag[i]=ciag[i-1]+zap[i]*(ciag[i-2]<ciag[i-1]?-1:1);
else ciag[i]=ciag[i-1]+zap[i]*(ciag[i-2]<ciag[i-1]?1:-1);
}
int mn=1e9,mn_ind,mx=-1,mx_ind;
for (int i = 0; i<n; i++){
if (mn>ciag[i]){
mn=ciag[i];
mn_ind=i;
}
if (mx<ciag[i]){
mx=ciag[i];
mx_ind=i;
}
}
if (mn_ind>mx_ind){
for (int i = 0; i<n; i++)ciag[i]=-ciag[i];
mn=-mn;
}
for (int i = 0; i<n; i++)answer(i+1,ciag[i]+mn+1);
}
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... |