oj.uz

Submission #510241

# Submission time Handle Problem Language Result Execution time Memory
510241 2022-01-14T20:41:13 Z nichke Xylophone (JOI18_xylophone) C++14
100 / 100
 117 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
int query(int l,int r);
void answer(int a,int b);
void solve(int n){
	int diff[n+1][3];
	for(int i=2;i<=n;i++)diff[i-1][0]=query(i-1,i);
	for(int i=3;i<=n;i++)diff[i-2][1]=query(i-2,i);
	diff[1][2]=1;
	for(int i=1;i+2<=n;i++){
		if(diff[i][1]==diff[i][0]+diff[i+1][0])diff[i+1][2]=diff[i][2];
		else diff[i+1][2]=diff[i][2]^1;
	}
	int res[n+1];
	res[1]=0;
	for(int i=1;i+1<=n;i++)res[i+1]=res[i]+(-1+2*diff[i][2])*diff[i][0];
	int mn=1,mx=1;
	for(int i=2;i<=n;i++){
		if(res[i]<res[mn])mn=i;
		if(res[i]>res[mx])mx=i;
	}
	if(mn>mx)for(int i=1;i+1<=n;i++)diff[i][2]^=1;
	res[1]=0;
	for(int i=1;i+1<=n;i++)res[i+1]=res[i]+(-1+2*diff[i][2])*diff[i][0];
	mn=1;
	for(int i=1;i<=n;i++)mn=min(mn,res[i]);
	for(int i=1;i<=n;i++)res[i]+=1-mn,answer(i,res[i]);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 9 ms 200 KB Output is correct
18 Correct 16 ms 284 KB Output is correct
19 Correct 26 ms 284 KB Output is correct
20 Correct 21 ms 284 KB Output is correct
21 Correct 13 ms 200 KB Output is correct
22 Correct 16 ms 200 KB Output is correct
23 Correct 14 ms 200 KB Output is correct
24 Correct 13 ms 200 KB Output is correct
25 Correct 19 ms 200 KB Output is correct
26 Correct 18 ms 200 KB Output is correct
27 Correct 15 ms 280 KB Output is correct
28 Correct 19 ms 200 KB Output is correct
29 Correct 12 ms 200 KB Output is correct
30 Correct 18 ms 292 KB Output is correct
31 Correct 38 ms 292 KB Output is correct
32 Correct 60 ms 304 KB Output is correct
33 Correct 31 ms 332 KB Output is correct
34 Correct 92 ms 332 KB Output is correct
35 Correct 90 ms 340 KB Output is correct
36 Correct 91 ms 328 KB Output is correct
37 Correct 93 ms 328 KB Output is correct
38 Correct 91 ms 348 KB Output is correct
39 Correct 102 ms 344 KB Output is correct
40 Correct 89 ms 336 KB Output is correct
41 Correct 88 ms 340 KB Output is correct
42 Correct 117 ms 348 KB Output is correct
43 Correct 89 ms 328 KB Output is correct
44 Correct 66 ms 328 KB Output is correct
45 Correct 91 ms 328 KB Output is correct
46 Correct 72 ms 328 KB Output is correct
47 Correct 61 ms 332 KB Output is correct
48 Correct 48 ms 328 KB Output is correct
49 Correct 93 ms 328 KB Output is correct
50 Correct 95 ms 328 KB Output is correct
51 Correct 72 ms 328 KB Output is correct
52 Correct 112 ms 332 KB Output is correct
53 Correct 67 ms 332 KB Output is correct
54 Correct 82 ms 328 KB Output is correct
55 Correct 73 ms 328 KB Output is correct
56 Correct 82 ms 328 KB Output is correct
57 Correct 95 ms 328 KB Output is correct
58 Correct 82 ms 348 KB Output is correct
59 Correct 82 ms 328 KB Output is correct
60 Correct 116 ms 328 KB Output is correct