oj.uz

Submission #497946

# Submission time Handle Problem Language Result Execution time Memory
497946 2021-12-24T05:42:24 Z penguin133 Xylophone (JOI18_xylophone) C++17
100 / 100
 120 ms 540 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int ans[5005], D[5005], E[5005];
 
int check(int N){
	for(int i=3;i<=N;i++){
		ans[i] = ans[i-1] + D[i];
		if(max({ans[i-2], ans[i-1], ans[i]}) - min({ans[i-2], ans[i-1], ans[i]}) != E[i])ans[i] = ans[i-1] - D[i];
	}
	int minpos = 1, maxpos = 1;
	for(int i=1;i<=N;i++){
		if(ans[minpos] > ans[i])minpos = i;
		if(ans[maxpos] < ans[i])maxpos = i;
	}
  int mini = ans[minpos];
	for(int i=1;i<=N;i++)ans[i] += (1 - mini);
	return (minpos < maxpos);
}
void solve(int N) {
	for(int i=2;i<=N;i++)D[i] = query(i-1, i);
	for(int i=3;i<=N;i++)E[i] = query(i-2, i);
	ans[1] = 0;
	ans[2] = 0 + D[2];
	if(!check(N)){
		ans[2] = 0 - D[2];
		ans[1] = 0;
		int x = check(N);
	}
	for(int i=1;i<=N;i++)answer(i, ans[i]);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:28:7: warning: unused variable 'x' [-Wunused-variable]
   28 |   int x = check(N);
      |       ^

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 2 ms 296 KB Output is correct
5 Correct 3 ms 200 KB Output is correct
6 Correct 4 ms 300 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 296 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 304 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 5 ms 300 KB Output is correct
17 Correct 11 ms 304 KB Output is correct
18 Correct 16 ms 200 KB Output is correct
19 Correct 17 ms 296 KB Output is correct
20 Correct 20 ms 300 KB Output is correct
21 Correct 22 ms 304 KB Output is correct
22 Correct 20 ms 300 KB Output is correct
23 Correct 19 ms 304 KB Output is correct
24 Correct 23 ms 284 KB Output is correct
25 Correct 20 ms 300 KB Output is correct
26 Correct 18 ms 304 KB Output is correct
27 Correct 19 ms 304 KB Output is correct
28 Correct 21 ms 300 KB Output is correct
29 Correct 27 ms 280 KB Output is correct
30 Correct 22 ms 304 KB Output is correct
31 Correct 35 ms 200 KB Output is correct
32 Correct 45 ms 540 KB Output is correct
33 Correct 52 ms 300 KB Output is correct
34 Correct 78 ms 276 KB Output is correct
35 Correct 92 ms 300 KB Output is correct
36 Correct 86 ms 328 KB Output is correct
37 Correct 96 ms 300 KB Output is correct
38 Correct 89 ms 300 KB Output is correct
39 Correct 103 ms 312 KB Output is correct
40 Correct 37 ms 304 KB Output is correct
41 Correct 100 ms 316 KB Output is correct
42 Correct 79 ms 436 KB Output is correct
43 Correct 92 ms 316 KB Output is correct
44 Correct 95 ms 316 KB Output is correct
45 Correct 113 ms 432 KB Output is correct
46 Correct 101 ms 296 KB Output is correct
47 Correct 63 ms 292 KB Output is correct
48 Correct 76 ms 436 KB Output is correct
49 Correct 120 ms 440 KB Output is correct
50 Correct 78 ms 300 KB Output is correct
51 Correct 98 ms 288 KB Output is correct
52 Correct 91 ms 296 KB Output is correct
53 Correct 104 ms 292 KB Output is correct
54 Correct 98 ms 292 KB Output is correct
55 Correct 75 ms 296 KB Output is correct
56 Correct 87 ms 296 KB Output is correct
57 Correct 99 ms 288 KB Output is correct
58 Correct 83 ms 420 KB Output is correct
59 Correct 83 ms 316 KB Output is correct
60 Correct 100 ms 288 KB Output is correct