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 "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXN 5010
int diff[MAXN], diffsign[MAXN];
void solve(int n) {
for (int i = 1; i < n; i++) {
diff[i] = query(i, i+1);
}
for (int i = 1; i < n-1; i++) {
int am = query(i, i+2);
if (am != diff[i]+diff[i+1]) diffsign[i+1] = 1;
}
for (int i = 2; i < n; i++) {
if (diffsign[i] && diff[i-1] > 0) diff[i]*=-1;
if (!diffsign[i] && diff[i-1] < 0) diff[i]*=-1;
}
int sum = accumulate(diff+1, diff+n, 0);
if (sum < 0) {
for (int i = 1; i < n; i++) diff[i]*=-1;
}
int mn = 0, val = 0;
for (int i = 1; i < n; i++) {
val += diff[i];
mn = min(mn, val);
}
val = -mn;
for (int i = 1; i <= n; i++) {
answer(i, val);
val += diff[i];
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |