oj.uz

Submission #311134

# Submission time Handle Problem Language Result Execution time Memory
311134 2020-10-09T13:14:13 Z LucaDantas Xylophone (JOI18_xylophone) C++17
100 / 100
 97 ms 504 KB 
#include "xylophone.h"
// #include<bits/stdc++.h>
#include<algorithm>
static int a[5001];

inline int abs(int x) {return x<0?-x:x;}

void solve(int n) {
	a[2] = query(1, 2);
	for(int i = 2; i < n; i++) {
		// eu tenho o indice do anterior e do agr e posso olhar no vetor o valor deles
		int eu_e_seg = query(i, i+1);
		int eu_ant_seg = query(i-1, i+1);
		int ja_tenho = a[i] - a[i-1];

		int sign = ja_tenho<0?1:-1;
		
		// significa que o cara seguinte tem Delta com sinal igual ao do anterior
		if(eu_ant_seg == eu_e_seg + abs(ja_tenho))
			sign *= -1;
		
		a[i+1] = a[i] + sign*eu_e_seg;
	}
	int menor = *std::min_element(a+1, a+1+n);
	int pos1, posn;
	for(int i = 1; i <= n; i++) {
		a[i] -= menor;
		if(a[i] == 0) pos1 = i;
		if(a[i] == n-1) posn = i;
	}
	bool inv = 0;
	if(pos1>posn) inv = 1;
	for(int i = 1; i <= n; i++)
		answer(i, inv?n-a[i]:a[i]+1);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:34:9: warning: 'posn' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |   answer(i, inv?n-a[i]:a[i]+1);
      |   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp:34:9: warning: 'pos1' 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 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 9 ms 256 KB Output is correct
18 Correct 13 ms 256 KB Output is correct
19 Correct 15 ms 256 KB Output is correct
20 Correct 15 ms 256 KB Output is correct
21 Correct 20 ms 256 KB Output is correct
22 Correct 18 ms 256 KB Output is correct
23 Correct 17 ms 256 KB Output is correct
24 Correct 18 ms 256 KB Output is correct
25 Correct 19 ms 256 KB Output is correct
26 Correct 18 ms 256 KB Output is correct
27 Correct 19 ms 256 KB Output is correct
28 Correct 17 ms 256 KB Output is correct
29 Correct 19 ms 256 KB Output is correct
30 Correct 10 ms 368 KB Output is correct
31 Correct 47 ms 376 KB Output is correct
32 Correct 57 ms 376 KB Output is correct
33 Correct 54 ms 484 KB Output is correct
34 Correct 92 ms 376 KB Output is correct
35 Correct 91 ms 380 KB Output is correct
36 Correct 91 ms 376 KB Output is correct
37 Correct 86 ms 376 KB Output is correct
38 Correct 88 ms 376 KB Output is correct
39 Correct 94 ms 376 KB Output is correct
40 Correct 87 ms 368 KB Output is correct
41 Correct 87 ms 376 KB Output is correct
42 Correct 93 ms 376 KB Output is correct
43 Correct 78 ms 376 KB Output is correct
44 Correct 84 ms 376 KB Output is correct
45 Correct 89 ms 376 KB Output is correct
46 Correct 91 ms 376 KB Output is correct
47 Correct 92 ms 484 KB Output is correct
48 Correct 95 ms 376 KB Output is correct
49 Correct 94 ms 380 KB Output is correct
50 Correct 86 ms 376 KB Output is correct
51 Correct 84 ms 376 KB Output is correct
52 Correct 52 ms 376 KB Output is correct
53 Correct 89 ms 376 KB Output is correct
54 Correct 97 ms 376 KB Output is correct
55 Correct 87 ms 504 KB Output is correct
56 Correct 97 ms 384 KB Output is correct
57 Correct 66 ms 376 KB Output is correct
58 Correct 74 ms 376 KB Output is correct
59 Correct 96 ms 384 KB Output is correct
60 Correct 78 ms 376 KB Output is correct