Submission #654402

# Submission time Handle Problem Language Result Execution time Memory
654402 2022-10-31T08:45:07 Z uylulu Xylophone (JOI18_xylophone) C++14
100 / 100
86 ms 428 KB
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;

const int N = 5e3 + 5;

int res[N + 1];

bool check[N + 1];

void solve(int n) {
	int l = 1,r = n,tr;
	int pos;

	while(l < r) {
		int mid = (l + r)/2;
		if(query(mid,n) >= n - 1) {
			l = mid + 1;
			pos = mid;
		} else {
			r = mid;
		}
	} 

	res[pos] = 1;
	check[1] = true;
	for(int i = pos - 1;i >= 1;i--) {
		int w = query(i,i + 1);

		if(res[i + 1] + w > n) {
			res[i] = res[i + 1] - w;
			continue;
		}
		if(res[i + 1] <= w) {
			res[i] = res[i + 1] + w;
			continue;
		}
		if(check[res[i + 1] - w]) {
			res[i] = res[i + 1] + w;
			continue;
		} 
		if(check[res[i + 1] + w]) {
			res[i] = res[i + 1] - w;
			continue;
		}
		vector<int> st = {res[i + 1],res[i + 2]};
		sort(st.begin(),st.end());

		int asd = query(i,i + 2);
		if(asd == st[1] - st[0]) {
			if(res[i + 1] == st[0]) {
				res[i] = res[i + 1] + w;
			} else {
				res[i] = res[i + 1] - w;
			}
		} else {
			if(asd == w) {
				if(res[i + 1] == st[0]) {
					res[i] = res[i + 1] + w;
				} else {
					res[i] = res[i + 1] - w;
				}
			} else {
				if(res[i + 2] == st[0]) {
					res[i] = res[i + 2] + asd;
				} else {
					res[i] = res[i + 2] - asd;
				}
			}
		}
		check[res[i]] = true;
	}
	for(int i = pos + 1;i <= n;i++) {
		int w = query(i - 1,i);
		if(res[i - 1] <= w) {
			res[i] = res[i - 1] + w;
			continue;
		}
		if(res[i - 1] + w > n) {
			res[i] = res[i - 1] - w;
			continue;
		}
		if(check[res[i - 1] + w]) {
			res[i] = res[i - 1] - w;
			continue;
		}
		if(check[res[i - 1] - w]) {
			res[i] = res[i - 1] + w;
			continue;
		}
		vector<int> st = {res[i - 1],res[i - 2]};
		sort(st.begin(),st.end());

		int asd = query(i - 2,i);
		if(asd == st[1] - st[0]) {
			if(res[i - 1] == st[0]) {
				res[i] = res[i - 1] + w;
			} else {
				res[i] = res[i - 1] - w;
			}
		} else {
			if(asd == w) {
				if(res[i - 1] == st[0]) {
					res[i] = res[i - 1] + w;
				} else {
					res[i] = res[i - 1] - w;
				}
			} else {
				if(res[i - 2] == st[0]) {
					res[i] = res[i - 2] + asd;
				} else {
					res[i] = res[i - 2] - asd;
				}
			}
		}
		check[res[i]] = true;
	}
	for(int i = 1;i <= n;i++) {
		answer(i,res[i]);
	}
	return;
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:12:18: warning: unused variable 'tr' [-Wunused-variable]
   12 |  int l = 1,r = n,tr;
      |                  ^~
xylophone.cpp:13:6: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   13 |  int pos;
      |      ^~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 5 ms 308 KB Output is correct
18 Correct 12 ms 208 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 15 ms 308 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 14 ms 208 KB Output is correct
23 Correct 12 ms 304 KB Output is correct
24 Correct 17 ms 304 KB Output is correct
25 Correct 14 ms 308 KB Output is correct
26 Correct 18 ms 316 KB Output is correct
27 Correct 16 ms 308 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 11 ms 312 KB Output is correct
30 Correct 10 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 5 ms 308 KB Output is correct
18 Correct 12 ms 208 KB Output is correct
19 Correct 15 ms 208 KB Output is correct
20 Correct 15 ms 308 KB Output is correct
21 Correct 12 ms 208 KB Output is correct
22 Correct 14 ms 208 KB Output is correct
23 Correct 12 ms 304 KB Output is correct
24 Correct 17 ms 304 KB Output is correct
25 Correct 14 ms 308 KB Output is correct
26 Correct 18 ms 316 KB Output is correct
27 Correct 16 ms 308 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 11 ms 312 KB Output is correct
30 Correct 10 ms 208 KB Output is correct
31 Correct 25 ms 308 KB Output is correct
32 Correct 41 ms 300 KB Output is correct
33 Correct 54 ms 296 KB Output is correct
34 Correct 56 ms 300 KB Output is correct
35 Correct 64 ms 312 KB Output is correct
36 Correct 68 ms 308 KB Output is correct
37 Correct 50 ms 300 KB Output is correct
38 Correct 39 ms 296 KB Output is correct
39 Correct 71 ms 420 KB Output is correct
40 Correct 30 ms 308 KB Output is correct
41 Correct 57 ms 304 KB Output is correct
42 Correct 63 ms 304 KB Output is correct
43 Correct 24 ms 308 KB Output is correct
44 Correct 65 ms 328 KB Output is correct
45 Correct 86 ms 304 KB Output is correct
46 Correct 65 ms 428 KB Output is correct
47 Correct 78 ms 420 KB Output is correct
48 Correct 38 ms 300 KB Output is correct
49 Correct 65 ms 300 KB Output is correct
50 Correct 66 ms 300 KB Output is correct
51 Correct 29 ms 308 KB Output is correct
52 Correct 31 ms 312 KB Output is correct
53 Correct 59 ms 328 KB Output is correct
54 Correct 58 ms 424 KB Output is correct
55 Correct 65 ms 304 KB Output is correct
56 Correct 58 ms 304 KB Output is correct
57 Correct 52 ms 304 KB Output is correct
58 Correct 50 ms 300 KB Output is correct
59 Correct 60 ms 316 KB Output is correct
60 Correct 59 ms 312 KB Output is correct