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){
int n = N;
int i = 1;
while(query(i, n) == n - 1){
i++;
}
i--;
int reference = i;
vector<int> a(n + 1);
int x = query(i, i + 1);
a[i] = 1;
a[i + 1] = x + 1;
i += 2;
int last = x;
for (; i <= n; i++){
int mn = min(a[i - 1], a[i - 2]);
int mx = max(a[i - 1], a[i - 2]);
int uno = query(i - 1, i);
int dos = query(i - 2, i);
if (dos > last){
if (dos == uno){
if (a[i - 1] == mn) a[i] = a[i - 1] + uno;
else a[i] = a[i - 1] - uno;
}else{
if (a[i - 2] == mn) a[i] = a[i - 2] + dos;
else a[i] = a[i - 2] - dos;
}
}else{
if (a[i - 1] == mn) a[i] = a[i - 1] + uno;
else a[i] = a[i - 1] - uno;
}
last = uno;
}
i = reference;
x = query(i - 1, i);
a[i - 1] = 1 + x;
last = x;
i -= 2;
for (; i >= 1; i--){
int mn = min(a[i + 1], a[i + 2]);
int mx = max(a[i + 1], a[i + 2]);
int uno = query(i, i + 1);
int dos = query(i, i + 2);
if (dos > last){
if (dos == uno){
if (a[i + 1] == mn) a[i] = a[i + 1] + uno;
else a[i] = a[i + 1] - uno;
}else{
if (a[i + 2] == mn) a[i] = a[i + 2] + dos;
else a[i] = a[i + 2] - dos;
}
}else{
if (a[i + 1] == mn) a[i] = a[i + 1] + uno;
else a[i] = a[i + 1] - uno;
}
last = uno;
}
for(int i = 1;i<=n;i++)answer(i, a[i]);
return;
}
Compilation message (stderr)
xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:26:13: warning: unused variable 'mx' [-Wunused-variable]
26 | int mx = max(a[i - 1], a[i - 2]);
| ^~
xylophone.cpp:52:13: warning: unused variable 'mx' [-Wunused-variable]
52 | int mx = max(a[i + 1], a[i + 2]);
| ^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |