oj.uz

Submission #444158

# Submission time Handle Problem Language Result Execution time Memory
444158 2021-07-13T07:40:29 Z Supersonic Xylophone (JOI18_xylophone) C++14
100 / 100
 139 ms 320 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

int a[5001];

void solve(int n) {
	int d[5001];
	d[1]=0;int y=-1;
	d[2]=-query(1,2);int p=-d[2];
	for(int i=3;i<=n;i++){
		int q=query(i-1,i);
		int r=query(i-2,i);
		//cerr<<p<<' '<<q<<' '<<r<<endl;
		if(p+q!=r)y*=-1;
		p=q;d[i]=y*q;
	}
	for(int i=2;i<=n;i++)d[i]+=d[i-1];
	
	int m=1e9;
	for(int i=1;i<=n;i++)m=min(m,d[i]);
	for(int i=1;i<=n;i++)d[i]+=1-m;
	//for(int i=1;i<=n;i++)cerr<<d[i]<<' ';cerr<<endl;
	int l1,ln;
	for(int i=1;i<=n;i++){if(d[i]==1)l1=i;if(d[i]==n)ln=i;}
	if(l1>ln)for(int i=1;i<=n;i++)answer(i,n-d[i]+1);
	else for(int i=1;i<=n;i++)answer(i,d[i]);
	//cerr<<a-1<<endl;
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:26:2: warning: 'ln' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |  if(l1>ln)for(int i=1;i<=n;i++)answer(i,n-d[i]+1);
      |  ^~
xylophone.cpp:26:2: warning: 'l1' 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 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 3 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 3 ms 200 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 3 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 3 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 3 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 3 ms 200 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 3 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 3 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 7 ms 200 KB Output is correct
18 Correct 17 ms 200 KB Output is correct
19 Correct 22 ms 292 KB Output is correct
20 Correct 23 ms 200 KB Output is correct
21 Correct 28 ms 288 KB Output is correct
22 Correct 17 ms 288 KB Output is correct
23 Correct 16 ms 200 KB Output is correct
24 Correct 22 ms 200 KB Output is correct
25 Correct 18 ms 200 KB Output is correct
26 Correct 24 ms 320 KB Output is correct
27 Correct 15 ms 200 KB Output is correct
28 Correct 24 ms 200 KB Output is correct
29 Correct 24 ms 292 KB Output is correct
30 Correct 24 ms 200 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 3 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 3 ms 200 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 3 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 3 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 7 ms 200 KB Output is correct
18 Correct 17 ms 200 KB Output is correct
19 Correct 22 ms 292 KB Output is correct
20 Correct 23 ms 200 KB Output is correct
21 Correct 28 ms 288 KB Output is correct
22 Correct 17 ms 288 KB Output is correct
23 Correct 16 ms 200 KB Output is correct
24 Correct 22 ms 200 KB Output is correct
25 Correct 18 ms 200 KB Output is correct
26 Correct 24 ms 320 KB Output is correct
27 Correct 15 ms 200 KB Output is correct
28 Correct 24 ms 200 KB Output is correct
29 Correct 24 ms 292 KB Output is correct
30 Correct 24 ms 200 KB Output is correct
31 Correct 45 ms 200 KB Output is correct
32 Correct 29 ms 304 KB Output is correct
33 Correct 81 ms 296 KB Output is correct
34 Correct 93 ms 292 KB Output is correct
35 Correct 117 ms 292 KB Output is correct
36 Correct 44 ms 304 KB Output is correct
37 Correct 110 ms 292 KB Output is correct
38 Correct 48 ms 296 KB Output is correct
39 Correct 116 ms 320 KB Output is correct
40 Correct 108 ms 296 KB Output is correct
41 Correct 112 ms 292 KB Output is correct
42 Correct 106 ms 292 KB Output is correct
43 Correct 117 ms 320 KB Output is correct
44 Correct 109 ms 320 KB Output is correct
45 Correct 118 ms 296 KB Output is correct
46 Correct 122 ms 296 KB Output is correct
47 Correct 99 ms 200 KB Output is correct
48 Correct 115 ms 292 KB Output is correct
49 Correct 95 ms 288 KB Output is correct
50 Correct 46 ms 308 KB Output is correct
51 Correct 103 ms 292 KB Output is correct
52 Correct 94 ms 320 KB Output is correct
53 Correct 116 ms 304 KB Output is correct
54 Correct 117 ms 200 KB Output is correct
55 Correct 80 ms 292 KB Output is correct
56 Correct 127 ms 320 KB Output is correct
57 Correct 100 ms 292 KB Output is correct
58 Correct 98 ms 292 KB Output is correct
59 Correct 108 ms 304 KB Output is correct
60 Correct 139 ms 304 KB Output is correct