oj.uz

Submission #876611

# Submission time Handle Problem Language Result Execution time Memory
876611 2023-11-22T05:31:54 Z dsyz Xylophone (JOI18_xylophone) C++17
100 / 100
 40 ms 692 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
using ll = long long;
#define MAXN (1000005)

void solve(int N) {
	ll low = 1;
	ll high = N + 1;
	while(high - low > 1){
		ll mid = (high + low) / 2;
		ll diff = query(mid,N);
		if(diff == N - 1){
			low = mid;
		}else{
			high = mid;
		}
	}
	ll posof1 = low;
	ll val[N + 1]; //pos of value i
	memset(val,-1,sizeof(val));
	val[1] = posof1;
	ll pos[N + 1]; //value of pos i
	memset(pos,-1,sizeof(pos));
	pos[posof1] = 1;
	for(ll i = posof1 + 1;i <= N;i++){ //all index are 1-indexed
		ll adjdiff = query(i - 1,i);
		if(pos[i - 1] - adjdiff < 1 || val[pos[i - 1] - adjdiff] != -1){
			pos[i] = pos[i - 1] + adjdiff;
			val[pos[i - 1] + adjdiff] = i;
		}else if(pos[i - 1] + adjdiff > N || val[pos[i - 1] + adjdiff] != -1){
			pos[i] = pos[i - 1] - adjdiff;
			val[pos[i - 1] - adjdiff] = i;
		}else{ //I can prove this is at least 2 spaces away from val 1
			ll diff = query(i - 2,i);
			ll I1 = pos[i - 1] - adjdiff;
			ll I2 = pos[i - 1] + adjdiff;
			if(diff == max({I1,pos[i - 1],pos[i - 2]}) - min({I1,pos[i - 1],pos[i - 2]})){
				pos[i] = I1;
				val[I1] = i;
			}else{
				pos[i] = I2;
				val[I2] = i;
			}
		}
	}
	
	for(ll i = posof1 - 1;i >= 1;i--){ //all index are 1-indexed
		ll adjdiff = query(i,i + 1);
		if(pos[i + 1] - adjdiff < 1 || val[pos[i + 1] - adjdiff] != -1){
			pos[i] = pos[i + 1] + adjdiff;
			val[pos[i + 1] + adjdiff] = i;
		}else if(pos[i + 1] + adjdiff > N || val[pos[i + 1] + adjdiff] != -1){
			pos[i] = pos[i + 1] - adjdiff;
			val[pos[i + 1] - adjdiff] = i;
		}else{ //I can prove this is at least 2 spaces away from val 1
			ll diff = query(i,i + 2);
			ll I1 = pos[i + 1] - adjdiff;
			ll I2 = pos[i + 1] + adjdiff;
			if(diff == max({I1,pos[i + 1],pos[i + 2]}) - min({I1,pos[i + 1],pos[i + 2]})){
				pos[i] = I1;
				val[I1] = i;
			}else{
				pos[i] = I2;
				val[I2] = i;
			}
		}
	}
	for(ll i = 1;i <= N;i++){
		answer(i,pos[i]);
	}
}

Subtask #1
11.0 / 11.0

# 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

Subtask #2
36.0 / 36.0

# 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 340 KB Output is correct
17 Correct 2 ms 688 KB Output is correct
18 Correct 4 ms 692 KB Output is correct
19 Correct 7 ms 436 KB Output is correct
20 Correct 5 ms 692 KB Output is correct
21 Correct 5 ms 436 KB Output is correct
22 Correct 5 ms 452 KB Output is correct
23 Correct 4 ms 688 KB Output is correct
24 Correct 5 ms 432 KB Output is correct
25 Correct 4 ms 432 KB Output is correct
26 Correct 6 ms 432 KB Output is correct
27 Correct 7 ms 432 KB Output is correct
28 Correct 6 ms 444 KB Output is correct
29 Correct 4 ms 692 KB Output is correct
30 Correct 6 ms 432 KB Output is correct

Subtask #3
53.0 / 53.0

# 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 340 KB Output is correct
17 Correct 2 ms 688 KB Output is correct
18 Correct 4 ms 692 KB Output is correct
19 Correct 7 ms 436 KB Output is correct
20 Correct 5 ms 692 KB Output is correct
21 Correct 5 ms 436 KB Output is correct
22 Correct 5 ms 452 KB Output is correct
23 Correct 4 ms 688 KB Output is correct
24 Correct 5 ms 432 KB Output is correct
25 Correct 4 ms 432 KB Output is correct
26 Correct 6 ms 432 KB Output is correct
27 Correct 7 ms 432 KB Output is correct
28 Correct 6 ms 444 KB Output is correct
29 Correct 4 ms 692 KB Output is correct
30 Correct 6 ms 432 KB Output is correct
31 Correct 15 ms 444 KB Output is correct
32 Correct 16 ms 436 KB Output is correct
33 Correct 25 ms 480 KB Output is correct
34 Correct 23 ms 680 KB Output is correct
35 Correct 24 ms 600 KB Output is correct
36 Correct 24 ms 492 KB Output is correct
37 Correct 31 ms 488 KB Output is correct
38 Correct 26 ms 680 KB Output is correct
39 Correct 30 ms 488 KB Output is correct
40 Correct 36 ms 688 KB Output is correct
41 Correct 28 ms 492 KB Output is correct
42 Correct 22 ms 496 KB Output is correct
43 Correct 21 ms 688 KB Output is correct
44 Correct 20 ms 488 KB Output is correct
45 Correct 27 ms 492 KB Output is correct
46 Correct 31 ms 488 KB Output is correct
47 Correct 32 ms 492 KB Output is correct
48 Correct 38 ms 684 KB Output is correct
49 Correct 29 ms 676 KB Output is correct
50 Correct 30 ms 504 KB Output is correct
51 Correct 30 ms 684 KB Output is correct
52 Correct 39 ms 488 KB Output is correct
53 Correct 30 ms 492 KB Output is correct
54 Correct 24 ms 680 KB Output is correct
55 Correct 26 ms 684 KB Output is correct
56 Correct 37 ms 688 KB Output is correct
57 Correct 40 ms 488 KB Output is correct
58 Correct 35 ms 488 KB Output is correct
59 Correct 29 ms 488 KB Output is correct
60 Correct 31 ms 488 KB Output is correct