oj.uz

Submission #996078

# Submission time Handle Problem Language Result Execution time Memory
996078 2024-06-10T07:45:44 Z coldbr3w Xylophone (JOI18_xylophone) C++17
100 / 100
 126 ms 3008 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(a[i-1] > a[i-2]){
			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-1] + d2[i] == d3[i]) a[i] = a[i-1] - d2[i];
			else a[i] = a[i-1] + d2[i];
		}
	}
	for(int i = 1; i <= n;i++) pos[i] = 0;
	for(int i = 1; i <= n;i++) {
		if(a[i] < 0 || a[i] > n) 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 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2496 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 2 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2496 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 2 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 3 ms 2392 KB Output is correct
17 Correct 6 ms 2496 KB Output is correct
18 Correct 6 ms 2392 KB Output is correct
19 Correct 10 ms 2392 KB Output is correct
20 Correct 13 ms 2500 KB Output is correct
21 Correct 13 ms 2652 KB Output is correct
22 Correct 11 ms 2392 KB Output is correct
23 Correct 9 ms 2508 KB Output is correct
24 Correct 11 ms 2392 KB Output is correct
25 Correct 9 ms 2392 KB Output is correct
26 Correct 8 ms 2392 KB Output is correct
27 Correct 10 ms 2392 KB Output is correct
28 Correct 11 ms 2392 KB Output is correct
29 Correct 16 ms 2512 KB Output is correct
30 Correct 6 ms 2392 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2496 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 2 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 3 ms 2392 KB Output is correct
17 Correct 6 ms 2496 KB Output is correct
18 Correct 6 ms 2392 KB Output is correct
19 Correct 10 ms 2392 KB Output is correct
20 Correct 13 ms 2500 KB Output is correct
21 Correct 13 ms 2652 KB Output is correct
22 Correct 11 ms 2392 KB Output is correct
23 Correct 9 ms 2508 KB Output is correct
24 Correct 11 ms 2392 KB Output is correct
25 Correct 9 ms 2392 KB Output is correct
26 Correct 8 ms 2392 KB Output is correct
27 Correct 10 ms 2392 KB Output is correct
28 Correct 11 ms 2392 KB Output is correct
29 Correct 16 ms 2512 KB Output is correct
30 Correct 6 ms 2392 KB Output is correct
31 Correct 25 ms 2392 KB Output is correct
32 Correct 57 ms 2384 KB Output is correct
33 Correct 58 ms 2640 KB Output is correct
34 Correct 86 ms 2532 KB Output is correct
35 Correct 81 ms 2764 KB Output is correct
36 Correct 71 ms 2384 KB Output is correct
37 Correct 100 ms 2732 KB Output is correct
38 Correct 53 ms 2644 KB Output is correct
39 Correct 68 ms 2516 KB Output is correct
40 Correct 78 ms 2516 KB Output is correct
41 Correct 95 ms 2896 KB Output is correct
42 Correct 42 ms 2640 KB Output is correct
43 Correct 93 ms 2384 KB Output is correct
44 Correct 72 ms 2504 KB Output is correct
45 Correct 79 ms 2508 KB Output is correct
46 Correct 122 ms 2508 KB Output is correct
47 Correct 121 ms 2384 KB Output is correct
48 Correct 60 ms 2640 KB Output is correct
49 Correct 121 ms 2640 KB Output is correct
50 Correct 107 ms 2636 KB Output is correct
51 Correct 67 ms 2516 KB Output is correct
52 Correct 66 ms 2640 KB Output is correct
53 Correct 112 ms 2640 KB Output is correct
54 Correct 98 ms 2640 KB Output is correct
55 Correct 107 ms 2656 KB Output is correct
56 Correct 126 ms 2636 KB Output is correct
57 Correct 101 ms 3008 KB Output is correct
58 Correct 112 ms 2508 KB Output is correct
59 Correct 93 ms 2512 KB Output is correct
60 Correct 85 ms 2500 KB Output is correct