Submission #1033771

# Submission time Handle Problem Language Result Execution time Memory
1033771 2024-07-25T05:20:58 Z emptypringlescan Xylophone (JOI18_xylophone) C++17
100 / 100
40 ms 592 KB
#include <bits/stdc++.h>
using namespace std;
#include "xylophone.h"
void solve(int n){
	int lo=1,hi=n-1,mid;
	while(lo<hi){
		mid=(lo+hi+1)/2;
		int x=query(mid,n);
		if(x==n-1) lo=mid;
		else hi=mid-1;
	}
	int ans[n+1],got[n+1];
	memset(got,0,sizeof(got));
	memset(ans,-1,sizeof(ans));
	ans[lo]=1;
	got[1]=1;
	if(lo>1) ans[lo-1]=1+query(lo-1,lo);
	for(int i=lo-2; i>0; i--){
		int x=query(i,i+1);
		int a=ans[i+1]+x,b=ans[i+1]-x;
		if(a<=1||a>=n||got[a]) ans[i]=b;
		else if(b<=1||b>=n||got[b]) ans[i]=a;
		else{
			int y=query(i,i+2);
			if(y==abs(ans[i+1]-ans[i+2])){
				if(ans[i+1]<ans[i+2]) ans[i]=a;
				else ans[i]=b;
			}
			else if(b==max(ans[i+1],ans[i+2])-y) ans[i]=b;
			else ans[i]=a;
		}
		got[ans[i]]=1;
	}
	ans[lo+1]=1+query(lo,lo+1);
	for(int i=lo+2; i<=n; i++){
		int x=query(i-1,i);
		int a=ans[i-1]+x,b=ans[i-1]-x;
		if(a<=1||a>n||got[a]) ans[i]=b;
		else if(b<=1||b>n||got[b]) ans[i]=a;
		else{
			int y=query(i-2,i);
			if(y==abs(ans[i-1]-ans[i-2])){
				if(ans[i-1]<ans[i-2]) ans[i]=a;
				else ans[i]=b;
			}
			else if(b==max(ans[i-1],ans[i-2])-y) ans[i]=b;
			else ans[i]=a;
		}
		got[ans[i]]=1;
	}
	for(int i=1; i<=n; i++) answer(i,ans[i]);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 6 ms 444 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 11 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 6 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 7 ms 344 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 4 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 6 ms 444 KB Output is correct
27 Correct 6 ms 344 KB Output is correct
28 Correct 11 ms 344 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 6 ms 344 KB Output is correct
31 Correct 20 ms 592 KB Output is correct
32 Correct 20 ms 344 KB Output is correct
33 Correct 37 ms 444 KB Output is correct
34 Correct 26 ms 444 KB Output is correct
35 Correct 40 ms 592 KB Output is correct
36 Correct 23 ms 464 KB Output is correct
37 Correct 35 ms 444 KB Output is correct
38 Correct 24 ms 448 KB Output is correct
39 Correct 32 ms 344 KB Output is correct
40 Correct 30 ms 592 KB Output is correct
41 Correct 36 ms 448 KB Output is correct
42 Correct 29 ms 464 KB Output is correct
43 Correct 29 ms 592 KB Output is correct
44 Correct 30 ms 448 KB Output is correct
45 Correct 26 ms 448 KB Output is correct
46 Correct 35 ms 344 KB Output is correct
47 Correct 27 ms 452 KB Output is correct
48 Correct 33 ms 592 KB Output is correct
49 Correct 28 ms 344 KB Output is correct
50 Correct 35 ms 444 KB Output is correct
51 Correct 38 ms 444 KB Output is correct
52 Correct 19 ms 452 KB Output is correct
53 Correct 25 ms 344 KB Output is correct
54 Correct 39 ms 344 KB Output is correct
55 Correct 27 ms 452 KB Output is correct
56 Correct 38 ms 444 KB Output is correct
57 Correct 26 ms 476 KB Output is correct
58 Correct 32 ms 344 KB Output is correct
59 Correct 39 ms 444 KB Output is correct
60 Correct 22 ms 464 KB Output is correct