oj.uz

Submission #598504

# Submission time Handle Problem Language Result Execution time Memory
598504 2022-07-18T12:20:18 Z GioChkhaidze Xylophone (JOI18_xylophone) C++14
100 / 100
 96 ms 476 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
#define pb push_back

using namespace std;

bool f[5005];
int n, a[5005];

void slv(int x) {
	if (x == 1) return ;
	a[x - 1] = 1 + query(x - 1, x);
	for (int i = x - 2; i >= 1; --i) {
		int v2 = query(i, i + 1);
		int ps1 = a[i + 1] + v2;
		int ps2 = a[i + 1] - v2;
		int mx = max(a[i + 1], a[i + 2]);
		int mn = min(a[i + 1], a[i + 2]);
		if (ps1 > n || f[ps1]) a[i] = ps2, f[ps2] = true;
			else
		if (ps2 < 1 || f[ps2]) a[i] = ps1, f[ps1] = true;
			else {
			int v3 = query(i, i + 2);
			if (max(mx, ps1) - min(mn, ps1) == v3) a[i] = ps1;
				else
			if (max(mx, ps2) - min(mn, ps2) == v3) a[i] = ps2;
		}
	}
}

void srv(int x) {
	a[x + 1] = 1 + query(x, x + 1);
	for (int i = x + 2; i <= n; ++i) {
		int v2 = query(i - 1, i);
		int ps1 = a[i - 1] + v2;
		int ps2 = a[i - 1] - v2;
		int mx = max(a[i - 1], a[i - 2]);
		int mn = min(a[i - 1], a[i - 2]);
		if (ps1 > n || f[ps1]) a[i] = ps2, f[ps2] = true;
			else
		if (ps2 < 1 || f[ps2]) a[i] = ps1, f[ps1] = true;
			else {
			int v3 = query(i - 2, i);
			if (max(mx, ps1) - min(mn, ps1) == v3) a[i] = ps1;
				else
			if (max(mx, ps2) - min(mn, ps2) == v3) a[i] = ps2;
		}
	}
}

void solve(int N) {	
	n = N;
	int l = 1, r = n - 1, mid, res = -1;
	while (l <= r) {
		int mid = ((l + r) >> 1);
		if (query(mid, n) == n - 1) {
			l = mid + 1, res = mid;
		}
			else {
			r = mid - 1;		
		}
	}
	
	f[1] = a[res] = 1, slv(res), srv(res);
	for(int i = 1; i <= n; i++) {
		answer(i, a[i]);
	}
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:64:16: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   64 |  f[1] = a[res] = 1, slv(res), srv(res);
      |         ~~~~~~~^~~
xylophone.cpp:53:24: warning: unused variable 'mid' [-Wunused-variable]
   53 |  int l = 1, r = n - 1, mid, res = -1;
      |                        ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 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 4 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 11 ms 208 KB Output is correct
19 Correct 15 ms 308 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 9 ms 300 KB Output is correct
22 Correct 14 ms 308 KB Output is correct
23 Correct 9 ms 308 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 11 ms 208 KB Output is correct
26 Correct 13 ms 300 KB Output is correct
27 Correct 15 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 10 ms 296 KB Output is correct
30 Correct 11 ms 304 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 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 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 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 4 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 11 ms 208 KB Output is correct
19 Correct 15 ms 308 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 9 ms 300 KB Output is correct
22 Correct 14 ms 308 KB Output is correct
23 Correct 9 ms 308 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 11 ms 208 KB Output is correct
26 Correct 13 ms 300 KB Output is correct
27 Correct 15 ms 208 KB Output is correct
28 Correct 11 ms 208 KB Output is correct
29 Correct 10 ms 296 KB Output is correct
30 Correct 11 ms 304 KB Output is correct
31 Correct 27 ms 296 KB Output is correct
32 Correct 41 ms 296 KB Output is correct
33 Correct 47 ms 428 KB Output is correct
34 Correct 49 ms 316 KB Output is correct
35 Correct 55 ms 476 KB Output is correct
36 Correct 70 ms 304 KB Output is correct
37 Correct 57 ms 300 KB Output is correct
38 Correct 45 ms 292 KB Output is correct
39 Correct 58 ms 304 KB Output is correct
40 Correct 38 ms 332 KB Output is correct
41 Correct 65 ms 300 KB Output is correct
42 Correct 65 ms 308 KB Output is correct
43 Correct 39 ms 292 KB Output is correct
44 Correct 46 ms 304 KB Output is correct
45 Correct 73 ms 300 KB Output is correct
46 Correct 96 ms 304 KB Output is correct
47 Correct 66 ms 416 KB Output is correct
48 Correct 65 ms 328 KB Output is correct
49 Correct 48 ms 420 KB Output is correct
50 Correct 70 ms 304 KB Output is correct
51 Correct 52 ms 328 KB Output is correct
52 Correct 55 ms 308 KB Output is correct
53 Correct 75 ms 328 KB Output is correct
54 Correct 67 ms 308 KB Output is correct
55 Correct 55 ms 296 KB Output is correct
56 Correct 62 ms 304 KB Output is correct
57 Correct 70 ms 300 KB Output is correct
58 Correct 51 ms 312 KB Output is correct
59 Correct 60 ms 304 KB Output is correct
60 Correct 60 ms 424 KB Output is correct