Submission #282905

# Submission time Handle Problem Language Result Execution time Memory
282905 2020-08-25T07:06:20 Z mosiashvililuka Xylophone (JOI18_xylophone) C++14
100 / 100
122 ms 760 KB
#include<bits/stdc++.h>
#include "xylophone.h"
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,f[5009],mn,mx;
void solve(int n){
	c=query(1,2);
	f[1]=0;
	f[2]=c;
	mn=0;mx=c;zx=1;xc=2;
	for(i=3; i<=n; i++){
		c=query(i-1,i);
		d=query(i-2,i);
		if(f[i-2]<=f[i-1]){
			if(d==f[i-1]-f[i-2]+c){
				f[i]=f[i-1]+c;
			}else{
				f[i]=f[i-1]-c;
			}
		}else{
			if(d==f[i-2]-f[i-1]+c){
				f[i]=f[i-1]-c;
			}else{
				f[i]=f[i-1]+c;
			}
		}
		if(mn>f[i]){
			mn=f[i];
			zx=i;
		}
		if(mx<f[i]){
			mx=f[i];
			xc=i;
		}
	}
	if(zx>xc){
		for(i=1; i<=n; i++){
			f[i]=-f[i];
		}
	}
	mn=a+2;
	for(i=1; i<=n; i++){
		mn=min(mn,f[i]);
	}
	for(i=1; i<=n; i++) f[i]-=mn-1;
	for(i=1; i<=n; i++) answer(i,f[i]);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 8 ms 256 KB Output is correct
18 Correct 13 ms 256 KB Output is correct
19 Correct 17 ms 384 KB Output is correct
20 Correct 24 ms 376 KB Output is correct
21 Correct 21 ms 376 KB Output is correct
22 Correct 24 ms 256 KB Output is correct
23 Correct 16 ms 376 KB Output is correct
24 Correct 21 ms 256 KB Output is correct
25 Correct 18 ms 376 KB Output is correct
26 Correct 17 ms 376 KB Output is correct
27 Correct 20 ms 384 KB Output is correct
28 Correct 22 ms 376 KB Output is correct
29 Correct 14 ms 504 KB Output is correct
30 Correct 10 ms 380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 8 ms 256 KB Output is correct
18 Correct 13 ms 256 KB Output is correct
19 Correct 17 ms 384 KB Output is correct
20 Correct 24 ms 376 KB Output is correct
21 Correct 21 ms 376 KB Output is correct
22 Correct 24 ms 256 KB Output is correct
23 Correct 16 ms 376 KB Output is correct
24 Correct 21 ms 256 KB Output is correct
25 Correct 18 ms 376 KB Output is correct
26 Correct 17 ms 376 KB Output is correct
27 Correct 20 ms 384 KB Output is correct
28 Correct 22 ms 376 KB Output is correct
29 Correct 14 ms 504 KB Output is correct
30 Correct 10 ms 380 KB Output is correct
31 Correct 32 ms 376 KB Output is correct
32 Correct 54 ms 384 KB Output is correct
33 Correct 79 ms 632 KB Output is correct
34 Correct 93 ms 376 KB Output is correct
35 Correct 92 ms 376 KB Output is correct
36 Correct 100 ms 376 KB Output is correct
37 Correct 95 ms 508 KB Output is correct
38 Correct 92 ms 508 KB Output is correct
39 Correct 112 ms 384 KB Output is correct
40 Correct 97 ms 376 KB Output is correct
41 Correct 89 ms 380 KB Output is correct
42 Correct 83 ms 376 KB Output is correct
43 Correct 103 ms 376 KB Output is correct
44 Correct 87 ms 504 KB Output is correct
45 Correct 86 ms 376 KB Output is correct
46 Correct 67 ms 504 KB Output is correct
47 Correct 90 ms 760 KB Output is correct
48 Correct 103 ms 376 KB Output is correct
49 Correct 67 ms 508 KB Output is correct
50 Correct 89 ms 376 KB Output is correct
51 Correct 88 ms 376 KB Output is correct
52 Correct 80 ms 564 KB Output is correct
53 Correct 122 ms 508 KB Output is correct
54 Correct 90 ms 376 KB Output is correct
55 Correct 97 ms 632 KB Output is correct
56 Correct 96 ms 376 KB Output is correct
57 Correct 49 ms 380 KB Output is correct
58 Correct 106 ms 376 KB Output is correct
59 Correct 113 ms 504 KB Output is correct
60 Correct 71 ms 384 KB Output is correct