oj.uz

Submission #502265

# Submission time Handle Problem Language Result Execution time Memory
502265 2022-01-05T16:34:47 Z vrohak Xylophone (JOI18_xylophone) C++14
100 / 100
 98 ms 448 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
void solve(int N) {
	int A[N];
	A[0] = 0;
	int D[N - 1];
	int T[N - 2];
	for(int i = 1; i < N; i++) {
		D[i - 1] = query(i, i + 1);
	}
	for(int i = 2; i < N; i++) {
		T[i - 2] = query(i - 1, i + 1);
	}
	A[1] = D[0];
	bool up = true;
	for(int i = 2; i < N; i++) {
		if(D[i - 2] + D[i - 1] != T[i - 2]) {
			up = !up;
		}
		A[i] = A[i - 1] + D[i - 1] * ((int)up * 2 - 1);
	}
    int rj1[N+1], rj2[N+1];
	int mx = 0, mn = 0;
	int idx1 = 0, idx2 = 0;
	for(int i = 1; i < N; i++) {
		mn = min(mn, A[i]);
	}
  	mn = (-1)*mn+1;
  	for(int i=0;i<N;i++){
      rj1[i] = A[i]+mn;
      rj2[i] = -A[i];
    }
  	mn=0;
    for(int i = 1; i < N; i++) {
		mn = min(mn, rj2[i]);
	}
  	mn = (-1)*mn+1;
  	for(int i=0;i<N;i++) rj2[i]+=mn;
  	for(int i=0;i<N;i++){
      if(rj1[i] == 1) idx1 = i;
      if(rj1[i] == N) idx2 = i;
    }
	if(idx1 < idx2) {
		for(int i = 0; i < N; i++) {
			answer(i + 1, rj1[i]);
		}
	} else {
		for(int i = 0; i < N; i++) {
			answer(i + 1, rj2[i]);
		}
	}
	
	return;
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:24:6: warning: unused variable 'mx' [-Wunused-variable]
   24 |  int mx = 0, mn = 0;
      |      ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 3 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 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 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 200 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 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 3 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 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 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 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 9 ms 200 KB Output is correct
18 Correct 17 ms 280 KB Output is correct
19 Correct 14 ms 292 KB Output is correct
20 Correct 19 ms 200 KB Output is correct
21 Correct 19 ms 200 KB Output is correct
22 Correct 17 ms 292 KB Output is correct
23 Correct 17 ms 200 KB Output is correct
24 Correct 19 ms 280 KB Output is correct
25 Correct 12 ms 280 KB Output is correct
26 Correct 20 ms 280 KB Output is correct
27 Correct 20 ms 200 KB Output is correct
28 Correct 20 ms 200 KB Output is correct
29 Correct 12 ms 200 KB Output is correct
30 Correct 20 ms 276 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 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 3 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 2 ms 200 KB Output is correct
9 Correct 2 ms 200 KB Output is correct
10 Correct 2 ms 200 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 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 4 ms 200 KB Output is correct
17 Correct 9 ms 200 KB Output is correct
18 Correct 17 ms 280 KB Output is correct
19 Correct 14 ms 292 KB Output is correct
20 Correct 19 ms 200 KB Output is correct
21 Correct 19 ms 200 KB Output is correct
22 Correct 17 ms 292 KB Output is correct
23 Correct 17 ms 200 KB Output is correct
24 Correct 19 ms 280 KB Output is correct
25 Correct 12 ms 280 KB Output is correct
26 Correct 20 ms 280 KB Output is correct
27 Correct 20 ms 200 KB Output is correct
28 Correct 20 ms 200 KB Output is correct
29 Correct 12 ms 200 KB Output is correct
30 Correct 20 ms 276 KB Output is correct
31 Correct 32 ms 304 KB Output is correct
32 Correct 45 ms 320 KB Output is correct
33 Correct 78 ms 332 KB Output is correct
34 Correct 74 ms 336 KB Output is correct
35 Correct 82 ms 328 KB Output is correct
36 Correct 91 ms 332 KB Output is correct
37 Correct 83 ms 336 KB Output is correct
38 Correct 76 ms 328 KB Output is correct
39 Correct 89 ms 332 KB Output is correct
40 Correct 86 ms 328 KB Output is correct
41 Correct 98 ms 328 KB Output is correct
42 Correct 89 ms 448 KB Output is correct
43 Correct 73 ms 332 KB Output is correct
44 Correct 81 ms 340 KB Output is correct
45 Correct 79 ms 340 KB Output is correct
46 Correct 86 ms 344 KB Output is correct
47 Correct 78 ms 340 KB Output is correct
48 Correct 67 ms 328 KB Output is correct
49 Correct 83 ms 328 KB Output is correct
50 Correct 56 ms 340 KB Output is correct
51 Correct 93 ms 344 KB Output is correct
52 Correct 60 ms 328 KB Output is correct
53 Correct 79 ms 328 KB Output is correct
54 Correct 87 ms 336 KB Output is correct
55 Correct 95 ms 328 KB Output is correct
56 Correct 92 ms 328 KB Output is correct
57 Correct 89 ms 332 KB Output is correct
58 Correct 98 ms 336 KB Output is correct
59 Correct 72 ms 448 KB Output is correct
60 Correct 95 ms 340 KB Output is correct