oj.uz

답안 #239596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239596 2020-06-16T14:54:29 Z cfalas Xylophone (JOI18_xylophone) C++14
100 / 100
 65 ms 536 KB 
#include<bits/stdc++.h>
using namespace std;
#include "xylophone.h"

int ans[100001] = {};
int used[100001] = {};
#define MID ((l+r)/2)

void solve(int N) {

	// Find 1
	int pos=0;
	int l=1, r=N-1;
	int mm=-1;
	while(l<=r){
		//cout<<MID<<" "<<N<<endl;
		int q = query(MID, N);
		if(q==N-1) mm=MID, l = MID+1;
		else r = MID-1;
	}

	pos=mm;
	//cout<<pos<<endl;
	ans[pos] = 1;
	used[1] = true;
	ans[pos+1] = 1+query(pos, pos+1);
	used[ans[pos+1]] = true;
	if(pos>=2) ans[pos-1] = 1+query(pos-1, pos), used[ans[pos-1]]=true;
	bool inc=false;
	for(int i=pos+2;i<=N;i++){
		int p=query(i-1, i);
		if(ans[i-1]+p>N || used[ans[i-1]+p]){
			ans[i] = ans[i-1]-p;
			used[ans[i]] = true;
			inc = ans[i]<ans[i-1];
			continue;
		}
		else if(ans[i-1]-p<=0 || used[ans[i-1]-p]){
			ans[i] = ans[i-1]+p;
			used[ans[i]] = true;
			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];
		used[ans[i]] = true;
		//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]);
	}


}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 9 ms 256 KB Output is correct
18 Correct 10 ms 380 KB Output is correct
19 Correct 19 ms 384 KB Output is correct
20 Correct 16 ms 384 KB Output is correct
21 Correct 17 ms 384 KB Output is correct
22 Correct 17 ms 384 KB Output is correct
23 Correct 14 ms 384 KB Output is correct
24 Correct 14 ms 384 KB Output is correct
25 Correct 14 ms 512 KB Output is correct
26 Correct 17 ms 384 KB Output is correct
27 Correct 19 ms 384 KB Output is correct
28 Correct 16 ms 384 KB Output is correct
29 Correct 16 ms 384 KB Output is correct
30 Correct 16 ms 384 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Correct 6 ms 256 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 6 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 9 ms 256 KB Output is correct
18 Correct 10 ms 380 KB Output is correct
19 Correct 19 ms 384 KB Output is correct
20 Correct 16 ms 384 KB Output is correct
21 Correct 17 ms 384 KB Output is correct
22 Correct 17 ms 384 KB Output is correct
23 Correct 14 ms 384 KB Output is correct
24 Correct 14 ms 384 KB Output is correct
25 Correct 14 ms 512 KB Output is correct
26 Correct 17 ms 384 KB Output is correct
27 Correct 19 ms 384 KB Output is correct
28 Correct 16 ms 384 KB Output is correct
29 Correct 16 ms 384 KB Output is correct
30 Correct 16 ms 384 KB Output is correct
31 Correct 31 ms 384 KB Output is correct
32 Correct 39 ms 384 KB Output is correct
33 Correct 51 ms 512 KB Output is correct
34 Correct 56 ms 508 KB Output is correct
35 Correct 58 ms 384 KB Output is correct
36 Correct 51 ms 384 KB Output is correct
37 Correct 44 ms 416 KB Output is correct
38 Correct 42 ms 504 KB Output is correct
39 Correct 59 ms 504 KB Output is correct
40 Correct 59 ms 520 KB Output is correct
41 Correct 54 ms 384 KB Output is correct
42 Correct 53 ms 384 KB Output is correct
43 Correct 47 ms 384 KB Output is correct
44 Correct 48 ms 384 KB Output is correct
45 Correct 56 ms 404 KB Output is correct
46 Correct 55 ms 384 KB Output is correct
47 Correct 62 ms 536 KB Output is correct
48 Correct 61 ms 384 KB Output is correct
49 Correct 63 ms 384 KB Output is correct
50 Correct 60 ms 384 KB Output is correct
51 Correct 60 ms 384 KB Output is correct
52 Correct 63 ms 384 KB Output is correct
53 Correct 58 ms 400 KB Output is correct
54 Correct 60 ms 404 KB Output is correct
55 Correct 56 ms 512 KB Output is correct
56 Correct 65 ms 384 KB Output is correct
57 Correct 57 ms 384 KB Output is correct
58 Correct 64 ms 412 KB Output is correct
59 Correct 62 ms 384 KB Output is correct
60 Correct 59 ms 384 KB Output is correct