oj.uz

Submission #1098622

# Submission time Handle Problem Language Result Execution time Memory
1098622 2024-10-09T16:12:44 Z flyingkite Xylophone (JOI18_xylophone) C++17
100 / 100
 168 ms 996 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
#define ll long long
 
ll d2[(ll)1e5 + 100], d3[(ll)1e5 + 100], a[(ll)1e5 + 100], pos[(ll)1e5 + 100];
bool check(ll x, ll n){
	a[2] = x;
	for(int i = 3; i <= n;i++){
		if(d3[i] == d2[i-1]){
			if(a[i-1] < a[i-2]){
				a[i] = a[i-1] + d2[i];
			}
			else a[i] = a[i-1] - d2[i];
		}
		else{
			if(a[i-2] < a[i-1]){
				if(d2[i-1] + d2[i] == d3[i]){
					a[i] = a[i-1] + d2[i];
				}
				else{
					a[i] = a[i-1] - d2[i];
				}
			}	
			else{
				if(d2[i] == d3[i]){
					a[i] = a[i-1] + d2[i];
				}
				else a[i] = a[i-2] - d3[i];
			}
		}
	}
	for(int i = 1; i <= n;i++) pos[i] = 0;
	for(int i = 1; i <= n;i++) {
		if(a[i] < 0) return 0;
		pos[a[i]] = i;
	}
	ll ok = (pos[1] < pos[n]);
	for(int i = 1; i <= n;i++) ok &= (pos[i] > 0);
	if(ok){
		for(int i = 1; i <= n;i++) answer(i, a[i]);
		return 1;
	}
	else return 0;
}
void solve(int n){
	for(int i = 2; i <= n;i++) d2[i] = query(i - 1, i);
	for(int i = 3; i <= n;i++) d3[i] = query(i - 2, i);
	for(int val = 1; val <= n;val++){
		for(int i = 1; i <= n;i++) pos[i] = 0;
		a[1] = val;
		if(check(a[1] + d2[2], n)) return;
		if(check(a[1] - d2[2], n)) return;
	}
}

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 2 ms 344 KB Output is correct
7 Correct 1 ms 600 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 2 ms 344 KB Output is correct
14 Correct 2 ms 464 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 2 ms 344 KB Output is correct
7 Correct 1 ms 600 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 2 ms 344 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 6 ms 600 KB Output is correct
18 Correct 12 ms 452 KB Output is correct
19 Correct 12 ms 344 KB Output is correct
20 Correct 17 ms 344 KB Output is correct
21 Correct 13 ms 596 KB Output is correct
22 Correct 15 ms 456 KB Output is correct
23 Correct 12 ms 460 KB Output is correct
24 Correct 11 ms 720 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 14 ms 344 KB Output is correct
28 Correct 9 ms 468 KB Output is correct
29 Correct 11 ms 344 KB Output is correct
30 Correct 15 ms 452 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 2 ms 344 KB Output is correct
7 Correct 1 ms 600 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 2 ms 344 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 6 ms 600 KB Output is correct
18 Correct 12 ms 452 KB Output is correct
19 Correct 12 ms 344 KB Output is correct
20 Correct 17 ms 344 KB Output is correct
21 Correct 13 ms 596 KB Output is correct
22 Correct 15 ms 456 KB Output is correct
23 Correct 12 ms 460 KB Output is correct
24 Correct 11 ms 720 KB Output is correct
25 Correct 9 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 14 ms 344 KB Output is correct
28 Correct 9 ms 468 KB Output is correct
29 Correct 11 ms 344 KB Output is correct
30 Correct 15 ms 452 KB Output is correct
31 Correct 31 ms 708 KB Output is correct
32 Correct 66 ms 344 KB Output is correct
33 Correct 62 ms 592 KB Output is correct
34 Correct 112 ms 716 KB Output is correct
35 Correct 99 ms 744 KB Output is correct
36 Correct 48 ms 700 KB Output is correct
37 Correct 97 ms 848 KB Output is correct
38 Correct 57 ms 736 KB Output is correct
39 Correct 51 ms 704 KB Output is correct
40 Correct 89 ms 940 KB Output is correct
41 Correct 119 ms 996 KB Output is correct
42 Correct 63 ms 472 KB Output is correct
43 Correct 110 ms 708 KB Output is correct
44 Correct 43 ms 500 KB Output is correct
45 Correct 75 ms 476 KB Output is correct
46 Correct 142 ms 592 KB Output is correct
47 Correct 152 ms 700 KB Output is correct
48 Correct 60 ms 600 KB Output is correct
49 Correct 168 ms 708 KB Output is correct
50 Correct 149 ms 592 KB Output is correct
51 Correct 74 ms 592 KB Output is correct
52 Correct 60 ms 720 KB Output is correct
53 Correct 123 ms 980 KB Output is correct
54 Correct 109 ms 848 KB Output is correct
55 Correct 139 ms 976 KB Output is correct
56 Correct 149 ms 600 KB Output is correct
57 Correct 120 ms 716 KB Output is correct
58 Correct 158 ms 968 KB Output is correct
59 Correct 103 ms 720 KB Output is correct
60 Correct 89 ms 744 KB Output is correct