oj.uz

Submission #763668

# Submission time Handle Problem Language Result Execution time Memory
763668 2023-06-22T15:16:04 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 99 ms 460 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
#define ll long long
const int maxn = 2e5 + 69;
int ans[maxn],p[maxn],trio[maxn];
int minn,maxx;
void solve(int n){
	for(int i = 1;i<n;i++){
		p[i] = query(i,i+1);
	}
	for(int i = 1;i<n-1;i++){
		trio[i] = query(i,i+2);
	}
	ans[1] = 0;
	ans[2] = p[1];
	for(int i = 3;i<=n;i++){
		if(p[i-1] + p[i-2] == trio[i-2]){
			if(ans[i-1] > ans[i-2]){
				ans[i] = ans[i-1] + p[i-1];
			}else{
				ans[i] = ans[i-1] - p[i-1];
			}
		}else{
			if(ans[i-1] < ans[i-2]){
				ans[i] = ans[i-1] + p[i-1];
			}else{
				ans[i] = ans[i-1] - p[i-1];
			}
		}
	}
	minn = 1,maxx = 1;
	for(int i = 1;i<=n;i++){
		if(ans[i] < ans[minn]){
			minn = i;
		}
		if(ans[i] > ans[maxx]){
			maxx = i;
		}
	}
	ll temp = ans[minn];
	for(int i = 1;i<=n;i++){
		ans[i] = ans[i] - temp + 1;
	}
	if(minn > maxx){
		for(int i = 1;i<=n;i++){
			ans[i] = n - ans[i] + 1;
		}
	}
	for(int i = 1;i<=n;i++) answer(i,ans[i]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 2 ms 316 KB Output is correct
9 Correct 2 ms 308 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 1 ms 308 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 316 KB Output is correct
15 Correct 2 ms 304 KB Output is correct

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 280 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 2 ms 316 KB Output is correct
9 Correct 2 ms 308 KB Output is correct
10 Correct 2 ms 312 KB Output is correct
11 Correct 1 ms 308 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 316 KB Output is correct
15 Correct 2 ms 304 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 8 ms 208 KB Output is correct
18 Correct 13 ms 316 KB Output is correct
19 Correct 17 ms 300 KB Output is correct
20 Correct 16 ms 312 KB Output is correct
21 Correct 19 ms 312 KB Output is correct
22 Correct 7 ms 312 KB Output is correct
23 Correct 18 ms 328 KB Output is correct
24 Correct 16 ms 312 KB Output is correct
25 Correct 20 ms 312 KB Output is correct
26 Correct 19 ms 328 KB Output is correct
27 Correct 19 ms 328 KB Output is correct
28 Correct 19 ms 328 KB Output is correct
29 Correct 17 ms 324 KB Output is correct
30 Correct 8 ms 316 KB Output is correct
31 Correct 22 ms 316 KB Output is correct
32 Correct 48 ms 320 KB Output is correct
33 Correct 45 ms 328 KB Output is correct
34 Correct 79 ms 380 KB Output is correct
35 Correct 86 ms 336 KB Output is correct
36 Correct 63 ms 328 KB Output is correct
37 Correct 37 ms 320 KB Output is correct
38 Correct 48 ms 320 KB Output is correct
39 Correct 76 ms 320 KB Output is correct
40 Correct 81 ms 320 KB Output is correct
41 Correct 55 ms 320 KB Output is correct
42 Correct 58 ms 328 KB Output is correct
43 Correct 82 ms 332 KB Output is correct
44 Correct 62 ms 320 KB Output is correct
45 Correct 89 ms 304 KB Output is correct
46 Correct 44 ms 328 KB Output is correct
47 Correct 78 ms 432 KB Output is correct
48 Correct 63 ms 320 KB Output is correct
49 Correct 64 ms 316 KB Output is correct
50 Correct 71 ms 348 KB Output is correct
51 Correct 58 ms 460 KB Output is correct
52 Correct 70 ms 384 KB Output is correct
53 Correct 54 ms 328 KB Output is correct
54 Correct 87 ms 328 KB Output is correct
55 Correct 99 ms 312 KB Output is correct
56 Correct 90 ms 312 KB Output is correct
57 Correct 84 ms 324 KB Output is correct
58 Correct 90 ms 328 KB Output is correct
59 Correct 79 ms 336 KB Output is correct
60 Correct 85 ms 316 KB Output is correct