#include <bits/stdc++.h>
using namespace std;
#include "xylophone.h"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"
static int A[5000];
void solve(int 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 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 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
xylophone.cpp:9:12: warning: 'A' defined but not used [-Wunused-variable]
9 | static int A[5000];
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |