#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
typedef long long ll;
const int maxn=1e6+7;
const int inf=INT_MAX;
const ll inff=1e18;
const ll mod=1e9+7;
#define pii pair<int,int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
//#define int ll
#ifdef HNO2
#define IOS
#else
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#endif // HNO2
int ans[5007];
void solve(int n)
{
int L=1,R=n;
while (R-L>1)
{
int M=(L+R)>>1;
if (query(M,n)!=n-1) R=M;
else L=M;
}
int _1_at=L;
ans[_1_at]=1;
if (_1_at!=n)
ans[_1_at+1]=query(_1_at,_1_at+1)+1;
if (_1_at!=1)
ans[_1_at-1]=query(_1_at-1,_1_at)+1;
for (int i=_1_at+1;i<=n-1;i++)
{
int tmp1=query(i,i+1),tmp2=query(i-1,i+1);
if (tmp2==tmp1+abs(ans[i]-ans[i-1]))
{
if (ans[i]>ans[i-1]) ans[i+1]=ans[i-1]+tmp2;
else ans[i+1]=ans[i-1]-tmp2;
}
else
{
if (ans[i]>ans[i-1]) ans[i+1]=ans[i]-tmp1;
else ans[i+1]=ans[i]+tmp1;
}
}
for (int i=_1_at-1;i>=2;i--)
{
int tmp1=query(i-1,i),tmp2=query(i-1,i+1);
if (tmp2==tmp1+abs(ans[i]-ans[i+1]))
{
if (ans[i]>ans[i+1]) ans[i-1]=ans[i+1]+tmp2;
else ans[i-1]=ans[i+1]-tmp2;
}
else
{
if (ans[i]>ans[i+1]) ans[i-1]=ans[i]-tmp1;
else ans[i-1]=ans[i]+tmp1;
}
}
for (int i=1;i<=n;i++) answer(i,ans[i]);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
6 ms |
248 KB |
Output is correct |
5 |
Correct |
7 ms |
376 KB |
Output is correct |
6 |
Correct |
7 ms |
376 KB |
Output is correct |
7 |
Correct |
6 ms |
248 KB |
Output is correct |
8 |
Correct |
6 ms |
248 KB |
Output is correct |
9 |
Correct |
6 ms |
248 KB |
Output is correct |
10 |
Correct |
6 ms |
252 KB |
Output is correct |
11 |
Correct |
8 ms |
380 KB |
Output is correct |
12 |
Correct |
7 ms |
376 KB |
Output is correct |
13 |
Correct |
7 ms |
248 KB |
Output is correct |
14 |
Correct |
6 ms |
376 KB |
Output is correct |
15 |
Correct |
7 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
6 ms |
248 KB |
Output is correct |
5 |
Correct |
7 ms |
376 KB |
Output is correct |
6 |
Correct |
7 ms |
376 KB |
Output is correct |
7 |
Correct |
6 ms |
248 KB |
Output is correct |
8 |
Correct |
6 ms |
248 KB |
Output is correct |
9 |
Correct |
6 ms |
248 KB |
Output is correct |
10 |
Correct |
6 ms |
252 KB |
Output is correct |
11 |
Correct |
8 ms |
380 KB |
Output is correct |
12 |
Correct |
7 ms |
376 KB |
Output is correct |
13 |
Correct |
7 ms |
248 KB |
Output is correct |
14 |
Correct |
6 ms |
376 KB |
Output is correct |
15 |
Correct |
7 ms |
376 KB |
Output is correct |
16 |
Correct |
8 ms |
376 KB |
Output is correct |
17 |
Correct |
16 ms |
280 KB |
Output is correct |
18 |
Correct |
18 ms |
248 KB |
Output is correct |
19 |
Correct |
22 ms |
248 KB |
Output is correct |
20 |
Correct |
19 ms |
248 KB |
Output is correct |
21 |
Correct |
26 ms |
248 KB |
Output is correct |
22 |
Correct |
23 ms |
248 KB |
Output is correct |
23 |
Correct |
24 ms |
248 KB |
Output is correct |
24 |
Correct |
21 ms |
376 KB |
Output is correct |
25 |
Correct |
18 ms |
248 KB |
Output is correct |
26 |
Correct |
22 ms |
376 KB |
Output is correct |
27 |
Correct |
20 ms |
248 KB |
Output is correct |
28 |
Correct |
22 ms |
376 KB |
Output is correct |
29 |
Correct |
21 ms |
324 KB |
Output is correct |
30 |
Correct |
21 ms |
248 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
6 ms |
248 KB |
Output is correct |
5 |
Correct |
7 ms |
376 KB |
Output is correct |
6 |
Correct |
7 ms |
376 KB |
Output is correct |
7 |
Correct |
6 ms |
248 KB |
Output is correct |
8 |
Correct |
6 ms |
248 KB |
Output is correct |
9 |
Correct |
6 ms |
248 KB |
Output is correct |
10 |
Correct |
6 ms |
252 KB |
Output is correct |
11 |
Correct |
8 ms |
380 KB |
Output is correct |
12 |
Correct |
7 ms |
376 KB |
Output is correct |
13 |
Correct |
7 ms |
248 KB |
Output is correct |
14 |
Correct |
6 ms |
376 KB |
Output is correct |
15 |
Correct |
7 ms |
376 KB |
Output is correct |
16 |
Correct |
8 ms |
376 KB |
Output is correct |
17 |
Correct |
16 ms |
280 KB |
Output is correct |
18 |
Correct |
18 ms |
248 KB |
Output is correct |
19 |
Correct |
22 ms |
248 KB |
Output is correct |
20 |
Correct |
19 ms |
248 KB |
Output is correct |
21 |
Correct |
26 ms |
248 KB |
Output is correct |
22 |
Correct |
23 ms |
248 KB |
Output is correct |
23 |
Correct |
24 ms |
248 KB |
Output is correct |
24 |
Correct |
21 ms |
376 KB |
Output is correct |
25 |
Correct |
18 ms |
248 KB |
Output is correct |
26 |
Correct |
22 ms |
376 KB |
Output is correct |
27 |
Correct |
20 ms |
248 KB |
Output is correct |
28 |
Correct |
22 ms |
376 KB |
Output is correct |
29 |
Correct |
21 ms |
324 KB |
Output is correct |
30 |
Correct |
21 ms |
248 KB |
Output is correct |
31 |
Correct |
45 ms |
248 KB |
Output is correct |
32 |
Correct |
65 ms |
248 KB |
Output is correct |
33 |
Correct |
71 ms |
248 KB |
Output is correct |
34 |
Incorrect |
53 ms |
328 KB |
Wrong Answer [2] |
35 |
Halted |
0 ms |
0 KB |
- |