oj.uz

Submission #789450

# Submission time Handle Problem Language Result Execution time Memory
789450 2023-07-21T12:03:08 Z anton Xylophone (JOI18_xylophone) C++17
100 / 100
 88 ms 336 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>

static int A[5000];
int d[5000];
int V[5000];

void solve(int N) {

	for(int i = 0; i<N-1; i++){
		d[i] = query(i+1, i+2);
	}

	
	int dir =1;
	for(int i = 0; i<N-2; i++){
		int s = query(i+1, i+3);
		if(s<abs(d[i]+d[i+1]*dir)){
			dir*=-1;
		}
		d[i+1] = d[i+1]*dir;
	}


	V[0] = 0;

	pii MIN = pii(0, 0);
	pii MAX = pii(0, 0);

	for(int i = 1; i<N; i++){
		V[i] = V[i-1] + d[i-1];
		if(MAX.first<V[i]){
			MAX.first = V[i];
			MAX.second = i;
		}
		else if(MIN.first>V[i]){
			MIN.first = V[i];
			MIN.second = i;
		}
	}


	if(MAX.second<MIN.second){
		for(int i = 0; i<N; i++){
			V[i] = -V[i];
		}
		MIN.first = -MAX.first;
	}

	for(int i = 0; i<N; i++){
		V[i]-=MIN.first;
	}

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

Compilation message

xylophone.cpp:6:12: warning: 'A' defined but not used [-Wunused-variable]
    6 | static int A[5000];
      |            ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 284 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 308 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 308 KB Output is correct
15 Correct 1 ms 308 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 1 ms 308 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 284 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 308 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 308 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 308 KB Output is correct
19 Correct 15 ms 308 KB Output is correct
20 Correct 13 ms 304 KB Output is correct
21 Correct 17 ms 308 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 15 ms 308 KB Output is correct
25 Correct 10 ms 312 KB Output is correct
26 Correct 7 ms 336 KB Output is correct
27 Correct 7 ms 336 KB Output is correct
28 Correct 16 ms 304 KB Output is correct
29 Correct 18 ms 308 KB Output is correct
30 Correct 10 ms 316 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 1 ms 308 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 2 ms 284 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 308 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 308 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 13 ms 308 KB Output is correct
19 Correct 15 ms 308 KB Output is correct
20 Correct 13 ms 304 KB Output is correct
21 Correct 17 ms 308 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 15 ms 308 KB Output is correct
25 Correct 10 ms 312 KB Output is correct
26 Correct 7 ms 336 KB Output is correct
27 Correct 7 ms 336 KB Output is correct
28 Correct 16 ms 304 KB Output is correct
29 Correct 18 ms 308 KB Output is correct
30 Correct 10 ms 316 KB Output is correct
31 Correct 21 ms 292 KB Output is correct
32 Correct 39 ms 304 KB Output is correct
33 Correct 72 ms 288 KB Output is correct
34 Correct 58 ms 308 KB Output is correct
35 Correct 88 ms 304 KB Output is correct
36 Correct 41 ms 308 KB Output is correct
37 Correct 83 ms 304 KB Output is correct
38 Correct 68 ms 312 KB Output is correct
39 Correct 85 ms 308 KB Output is correct
40 Correct 69 ms 328 KB Output is correct
41 Correct 68 ms 304 KB Output is correct
42 Correct 55 ms 300 KB Output is correct
43 Correct 87 ms 308 KB Output is correct
44 Correct 85 ms 304 KB Output is correct
45 Correct 67 ms 300 KB Output is correct
46 Correct 83 ms 304 KB Output is correct
47 Correct 62 ms 308 KB Output is correct
48 Correct 58 ms 304 KB Output is correct
49 Correct 47 ms 304 KB Output is correct
50 Correct 62 ms 308 KB Output is correct
51 Correct 80 ms 328 KB Output is correct
52 Correct 61 ms 308 KB Output is correct
53 Correct 58 ms 312 KB Output is correct
54 Correct 84 ms 304 KB Output is correct
55 Correct 34 ms 312 KB Output is correct
56 Correct 58 ms 308 KB Output is correct
57 Correct 61 ms 312 KB Output is correct
58 Correct 79 ms 304 KB Output is correct
59 Correct 62 ms 304 KB Output is correct
60 Correct 32 ms 300 KB Output is correct