#include <bits/stdc++.h>
#include "xylophone.h"
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
#define int long long
using namespace std;
using ll = long long;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int dp[5001][5001];
int ask(int l, int r) {
if(dp[l][r] != -1) return dp[l][r];
return dp[l][r] = query(l, r);
}
void solve(int n) {
memset(dp, -1, sizeof(dp));
int l=1, r=n;
int p1 = 0;
while(l <= r) {
int mid = (l + r) / 2;
if(ask(mid, n) == n-1) {
p1 = mid;
l = mid + 1;
} else r = mid - 1;
}
vector<int> ans(n+1, 0);
ans[p1] = 1;
if(p1 < n) ans[p1+1] = ans[p1] + ask(p1, p1+1);
if(p1 > 1) ans[p1-1] = ans[p1] + ask(p1-1, p1);
auto checkPos = [&](int i) {
return (ask(i-2, i) == ask(i-2, i-1) || ask(i-2, i) == ask(i-1, i));
};
auto checkNeg = [&](int i) {
return (ask(i, i+2) == ask(i, i+1) || ask(i, i+2) == ask(i+1, i+2));
};
for(int i=p1-2; i>=1; i--) {
int diff = ask(i, i+1);
if(ans[i+1] + diff > n) {
ans[i] = ans[i+1] - diff;
} else if(ans[i+1] - diff < 1) {
ans[i] = ans[i+1] + diff;
} else if(ans[i+2] > ans[i+1]) {
if(checkNeg(i)) ans[i] = ans[i+1] + diff;
else ans[i] = ans[i+1] - diff;
} else {
if(checkNeg(i)) ans[i] = ans[i+1] - diff;
else ans[i] = ans[i+1] + diff;
}
}
for(int i=p1+2; i<=n; i++) {
int diff = ask(i-1, i);
if(ans[i-1] + diff > n) {
ans[i] = ans[i-1] - diff;
} else if(ans[i-1] - diff < 1) {
ans[i] = ans[i-1] + diff;
} else if(ans[i-2] > ans[i-1]) {
if(checkPos(i)) ans[i] = ans[i-1] + diff;
else ans[i] = ans[i-1] - diff;
} else {
if(checkPos(i)) ans[i] = ans[i-1] - diff;
else ans[i] = ans[i-1] + diff;
}
}
for(int i=1; i<=n; i++)
answer(i, ans[i]);
}
// int32_t main() {
// setIO();
// //code starts here
// return 0;
// }
Compilation message
/usr/bin/ld: /tmp/ccjtPQT1.o: in function `main':
grader.cpp:(.text.startup+0x30): undefined reference to `solve(int)'
collect2: error: ld returned 1 exit status
