oj.uz

Submission #551802

# Submission time Handle Problem Language Result Execution time Memory
551802 2022-04-21T15:07:37 Z QwertyPi Xylophone (JOI18_xylophone) C++14
100 / 100
 98 ms 568 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
static int A[5000];
int d[5000], dd[5001], sg[5001];
void solve(int N) {
	for(int i = 1; i <= N - 1; i++){
		d[i] = query(i, i + 1);
	}
	sg[1] = 1;
	int cur_val = d[1];
	for(int i = 2; i <= N - 1; i++){
		int val = query(i - 1, i + 1);
		sg[i] = (abs(d[i - 1] + d[i]) == val ? 1 : -1) * sg[i - 1];
	}
	A[1] = 1;
	for(int i = 2; i <= N; i++){
		A[i] = A[i - 1] + d[i - 1] * sg[i - 1];
	}
	
	int mn = N + 1;
	for(int i = 1; i <= N; i++){
		mn = min(A[i], mn);
	}
	for(int i = 1; i <= N; i++){
		A[i] += 1 - mn;
	}
	
	int l = -1, r = -1;
	for(int i = 1; i <= N; i++){
		if(A[i] == 1) l = i;
		if(A[i] == N) r = i;
	}
	if(l > r){
		for(int i = 1; i <= N; i++){
			A[i] = N + 1 - A[i];
		}
	}

	for(int i = 1; i <= N; i++) {
		answer(i, A[i]);
	}

}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:11:6: warning: unused variable 'cur_val' [-Wunused-variable]
   11 |  int cur_val = d[1];
      |      ^~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 368 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 3 ms 312 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 16 ms 296 KB Output is correct
20 Correct 24 ms 312 KB Output is correct
21 Correct 16 ms 312 KB Output is correct
22 Correct 17 ms 312 KB Output is correct
23 Correct 14 ms 308 KB Output is correct
24 Correct 16 ms 208 KB Output is correct
25 Correct 12 ms 300 KB Output is correct
26 Correct 15 ms 304 KB Output is correct
27 Correct 16 ms 208 KB Output is correct
28 Correct 12 ms 312 KB Output is correct
29 Correct 16 ms 316 KB Output is correct
30 Correct 15 ms 308 KB Output is correct
31 Correct 33 ms 420 KB Output is correct
32 Correct 62 ms 300 KB Output is correct
33 Correct 66 ms 300 KB Output is correct
34 Correct 68 ms 336 KB Output is correct
35 Correct 77 ms 312 KB Output is correct
36 Correct 82 ms 328 KB Output is correct
37 Correct 80 ms 332 KB Output is correct
38 Correct 83 ms 432 KB Output is correct
39 Correct 74 ms 328 KB Output is correct
40 Correct 83 ms 332 KB Output is correct
41 Correct 98 ms 428 KB Output is correct
42 Correct 52 ms 308 KB Output is correct
43 Correct 75 ms 312 KB Output is correct
44 Correct 81 ms 316 KB Output is correct
45 Correct 76 ms 312 KB Output is correct
46 Correct 63 ms 320 KB Output is correct
47 Correct 56 ms 432 KB Output is correct
48 Correct 81 ms 324 KB Output is correct
49 Correct 59 ms 308 KB Output is correct
50 Correct 77 ms 432 KB Output is correct
51 Correct 75 ms 568 KB Output is correct
52 Correct 77 ms 316 KB Output is correct
53 Correct 82 ms 308 KB Output is correct
54 Correct 64 ms 316 KB Output is correct
55 Correct 68 ms 564 KB Output is correct
56 Correct 84 ms 328 KB Output is correct
57 Correct 81 ms 328 KB Output is correct
58 Correct 82 ms 328 KB Output is correct
59 Correct 75 ms 304 KB Output is correct
60 Correct 56 ms 312 KB Output is correct