oj.uz

Submission #525362

# Submission time Handle Problem Language Result Execution time Memory
525362 2022-02-11T13:31:28 Z safaricola Xylophone (JOI18_xylophone) C++17
100 / 100
 108 ms 424 KB 
#include "xylophone.h"

void solve(int N) {
	int ans[5010],diff1[5010],diff2[5010],mi,ma,miid,maid;
	bool greate[5010];
	for(int i=1; i<N; i++){
		diff1[i]=query(i,i+1);
		if(i!=N-1){
			diff2[i]=query(i,i+2);
		}
	}
	mi=1e9;
	ma=0;
	greate[1]=0;
	ans[1]=1;
	//greater=1, i<i+1;
	for(int i=1; i<N; i++){
		if(greate[i]){
			ans[i+1]=ans[i]+diff1[i];
			if(ans[i+1]>ma){
				ma=ans[i+1];
				maid=i+1;
			}
		}
		else{
			ans[i+1]=ans[i]-diff1[i];
			if(ans[i+1]<mi){
				mi=ans[i+1];
				miid=i+1;
			}
		}
		if(diff1[i+1]+diff1[i]==diff2[i]){
			greate[i+1]=greate[i];
		}else{
			greate[i+1]=!greate[i];
		}
	}
	if(mi<1){
		for(int i=1; i<=N; i++){
			ans[i]+=1-mi;
		}
	}
	if(miid>maid){
		for(int i=1; i<=N; i++){
			ans[i]=N+1-ans[i];
		}
	}
	//for(int i=1; i<=N; i++)cout<<ans[i]<<" ";
//		cout<<endl;
	for(int i = 1; i <= N; i++) {
		answer(i, ans[i]);
	}
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:43:2: warning: 'miid' may be used uninitialized in this function [-Wmaybe-uninitialized]
   43 |  if(miid>maid){
      |  ^~
xylophone.cpp:43:2: warning: 'maid' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 264 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 264 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 3 ms 328 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 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 268 KB Output is correct
13 Correct 2 ms 268 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 1 ms 328 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 264 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 264 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 3 ms 328 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 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 268 KB Output is correct
13 Correct 2 ms 268 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 4 ms 272 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 16 ms 200 KB Output is correct
19 Correct 19 ms 204 KB Output is correct
20 Correct 21 ms 328 KB Output is correct
21 Correct 17 ms 328 KB Output is correct
22 Correct 14 ms 328 KB Output is correct
23 Correct 20 ms 328 KB Output is correct
24 Correct 14 ms 328 KB Output is correct
25 Correct 19 ms 200 KB Output is correct
26 Correct 18 ms 200 KB Output is correct
27 Correct 10 ms 332 KB Output is correct
28 Correct 16 ms 312 KB Output is correct
29 Correct 19 ms 328 KB Output is correct
30 Correct 27 ms 328 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 264 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 264 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 3 ms 328 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 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 268 KB Output is correct
13 Correct 2 ms 268 KB Output is correct
14 Correct 2 ms 200 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 4 ms 272 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 16 ms 200 KB Output is correct
19 Correct 19 ms 204 KB Output is correct
20 Correct 21 ms 328 KB Output is correct
21 Correct 17 ms 328 KB Output is correct
22 Correct 14 ms 328 KB Output is correct
23 Correct 20 ms 328 KB Output is correct
24 Correct 14 ms 328 KB Output is correct
25 Correct 19 ms 200 KB Output is correct
26 Correct 18 ms 200 KB Output is correct
27 Correct 10 ms 332 KB Output is correct
28 Correct 16 ms 312 KB Output is correct
29 Correct 19 ms 328 KB Output is correct
30 Correct 27 ms 328 KB Output is correct
31 Correct 37 ms 328 KB Output is correct
32 Correct 43 ms 308 KB Output is correct
33 Correct 48 ms 328 KB Output is correct
34 Correct 63 ms 308 KB Output is correct
35 Correct 95 ms 328 KB Output is correct
36 Correct 94 ms 308 KB Output is correct
37 Correct 89 ms 328 KB Output is correct
38 Correct 88 ms 320 KB Output is correct
39 Correct 99 ms 328 KB Output is correct
40 Correct 108 ms 328 KB Output is correct
41 Correct 94 ms 328 KB Output is correct
42 Correct 84 ms 328 KB Output is correct
43 Correct 82 ms 308 KB Output is correct
44 Correct 95 ms 328 KB Output is correct
45 Correct 81 ms 308 KB Output is correct
46 Correct 61 ms 344 KB Output is correct
47 Correct 72 ms 328 KB Output is correct
48 Correct 100 ms 328 KB Output is correct
49 Correct 88 ms 328 KB Output is correct
50 Correct 81 ms 328 KB Output is correct
51 Correct 84 ms 320 KB Output is correct
52 Correct 91 ms 328 KB Output is correct
53 Correct 96 ms 424 KB Output is correct
54 Correct 98 ms 308 KB Output is correct
55 Correct 83 ms 308 KB Output is correct
56 Correct 82 ms 304 KB Output is correct
57 Correct 78 ms 324 KB Output is correct
58 Correct 83 ms 328 KB Output is correct
59 Correct 83 ms 320 KB Output is correct
60 Correct 54 ms 328 KB Output is correct