#include<bits/stdc++.h>
using namespace std;
#include "xylophone.h"
int ans[100001] = {};
int used[100001] = {};
void solve(int N) {
// Find 1
int pos=0;
int value=N-1;
while(N-1==value){
pos++;
value = query(pos, N);
//cout<<pos<<" "<<value<<endl;
}
pos--;
ans[pos] = 1;
ans[pos+1] = 1+query(pos, pos+1);
if(pos>=2) ans[pos-1] = 1+query(pos-1, pos);
bool inc=false;
for(int i=pos+2;i<=N;i++){
int p=query(i-1, i);
if(ans[i-1]+p>N){
ans[i] = ans[i-1]-p;
inc = ans[i]<ans[i-1];
continue;
}
else if(ans[i-1]-p<=0){
ans[i] = ans[i-1]+p;
inc = ans[i]<ans[i-1];
continue;
}
int pp = query(i-2, i);
if(inc){
if(p>=pp || pp==abs(ans[i-1]-ans[i-2])) ans[i] = ans[i-1] + p;
else ans[i] = ans[i-1]-p;
}
else{
if(p>=pp || pp==abs(ans[i-1]-ans[i-2])) ans[i] = ans[i-1] - p;
else ans[i] = ans[i-1]+p;
}
inc = ans[i]<ans[i-1];
//cout<<i<<" "<<ans[i]<<endl;
}
inc = false;
for(int i=pos-2;i>0;i--){
int p=query(i, i+1);
if(ans[i+1]+p>N && !used[ans[i+1]+p]){
ans[i] = ans[i+1]-p;
inc = ans[i]<ans[i+1];
used[ans[i]] = true;
continue;
}
else if(ans[i+1]-p<=0 && !used[ans[i+1]-p]){
ans[i] = ans[i+1]+p;
inc = ans[i]<ans[i+1];
used[ans[i]] = true;
continue;
}
int pp = query(i, i+2);
if(inc){
if(p>=pp || pp==abs(ans[i+2]-ans[i+1])) ans[i] = ans[i+1] + p;
else ans[i] = ans[i+1]-p;
}
else{
if(p>=pp || pp==abs(ans[i+2]-ans[i+1])) ans[i] = ans[i+1] - p;
else ans[i] = ans[i+1]+p;
}
used[ans[i]] = true;
inc = ans[i]<ans[i+1];
//cout<<i<<" "<<ans[i]<<endl;
}
//cout<<endl;
for(int i = 1; i <= N; i++) {
//cout<<i<<" "<<ans[i]<<endl;
answer(i, ans[i]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
412 KB |
Output is correct |
5 |
Correct |
6 ms |
384 KB |
Output is correct |
6 |
Correct |
6 ms |
256 KB |
Output is correct |
7 |
Correct |
6 ms |
256 KB |
Output is correct |
8 |
Correct |
6 ms |
380 KB |
Output is correct |
9 |
Correct |
7 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
256 KB |
Output is correct |
13 |
Correct |
6 ms |
384 KB |
Output is correct |
14 |
Correct |
6 ms |
384 KB |
Output is correct |
15 |
Correct |
7 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
412 KB |
Output is correct |
5 |
Correct |
6 ms |
384 KB |
Output is correct |
6 |
Correct |
6 ms |
256 KB |
Output is correct |
7 |
Correct |
6 ms |
256 KB |
Output is correct |
8 |
Correct |
6 ms |
380 KB |
Output is correct |
9 |
Correct |
7 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
256 KB |
Output is correct |
13 |
Correct |
6 ms |
384 KB |
Output is correct |
14 |
Correct |
6 ms |
384 KB |
Output is correct |
15 |
Correct |
7 ms |
384 KB |
Output is correct |
16 |
Correct |
7 ms |
384 KB |
Output is correct |
17 |
Correct |
11 ms |
384 KB |
Output is correct |
18 |
Correct |
15 ms |
384 KB |
Output is correct |
19 |
Correct |
17 ms |
384 KB |
Output is correct |
20 |
Correct |
24 ms |
376 KB |
Output is correct |
21 |
Correct |
22 ms |
384 KB |
Output is correct |
22 |
Correct |
13 ms |
376 KB |
Output is correct |
23 |
Correct |
21 ms |
384 KB |
Output is correct |
24 |
Correct |
27 ms |
384 KB |
Output is correct |
25 |
Correct |
17 ms |
376 KB |
Output is correct |
26 |
Correct |
22 ms |
384 KB |
Output is correct |
27 |
Correct |
26 ms |
384 KB |
Output is correct |
28 |
Correct |
17 ms |
384 KB |
Output is correct |
29 |
Correct |
20 ms |
384 KB |
Output is correct |
30 |
Correct |
18 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
412 KB |
Output is correct |
5 |
Correct |
6 ms |
384 KB |
Output is correct |
6 |
Correct |
6 ms |
256 KB |
Output is correct |
7 |
Correct |
6 ms |
256 KB |
Output is correct |
8 |
Correct |
6 ms |
380 KB |
Output is correct |
9 |
Correct |
7 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
384 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
12 |
Correct |
7 ms |
256 KB |
Output is correct |
13 |
Correct |
6 ms |
384 KB |
Output is correct |
14 |
Correct |
6 ms |
384 KB |
Output is correct |
15 |
Correct |
7 ms |
384 KB |
Output is correct |
16 |
Correct |
7 ms |
384 KB |
Output is correct |
17 |
Correct |
11 ms |
384 KB |
Output is correct |
18 |
Correct |
15 ms |
384 KB |
Output is correct |
19 |
Correct |
17 ms |
384 KB |
Output is correct |
20 |
Correct |
24 ms |
376 KB |
Output is correct |
21 |
Correct |
22 ms |
384 KB |
Output is correct |
22 |
Correct |
13 ms |
376 KB |
Output is correct |
23 |
Correct |
21 ms |
384 KB |
Output is correct |
24 |
Correct |
27 ms |
384 KB |
Output is correct |
25 |
Correct |
17 ms |
376 KB |
Output is correct |
26 |
Correct |
22 ms |
384 KB |
Output is correct |
27 |
Correct |
26 ms |
384 KB |
Output is correct |
28 |
Correct |
17 ms |
384 KB |
Output is correct |
29 |
Correct |
20 ms |
384 KB |
Output is correct |
30 |
Correct |
18 ms |
384 KB |
Output is correct |
31 |
Correct |
41 ms |
384 KB |
Output is correct |
32 |
Correct |
59 ms |
376 KB |
Output is correct |
33 |
Correct |
77 ms |
500 KB |
Output is correct |
34 |
Incorrect |
67 ms |
376 KB |
Wrong Answer [2] |
35 |
Halted |
0 ms |
0 KB |
- |