oj.uz

Submission #860931

# Submission time Handle Problem Language Result Execution time Memory
860931 2023-10-14T19:22:04 Z vjudge1 Xylophone (JOI18_xylophone) C++17
100 / 100
 67 ms 1188 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int a[5001];
void solve(int n) {
    int x, y, i, u, v, mn;
    a[2] = query(1, 2);
    for (i = 2; i < n; i++) {
        x = query(i, i + 1); y = query(i - 1, i + 1);
        a[i + 1] = a[i] + x * (a[i] - a[i - 1] < 0 ? 1 : -1) * (y == x + abs(a[i] - a[i - 1]) ? -1 : 1);
    }
    mn = *min_element(a + 1, a + n + 1);
    for (i = 1; i <= n; i++) {
        a[i] -= mn;
        if (!a[i]) u = i;
        if (a[i] == n - 1) v = i;
    }
    bool flag = u < v;
    for (int i = 1; i <= n; i++) answer(i, flag ? a[i] + 1 : n - a[i]);
}///1

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:19:40: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
   19 |     for (int i = 1; i <= n; i++) answer(i, flag ? a[i] + 1 : n - a[i]);
      |                                  ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
xylophone.cpp:19:40: warning: 'u' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 4 ms 440 KB Output is correct
18 Correct 8 ms 440 KB Output is correct
19 Correct 8 ms 436 KB Output is correct
20 Correct 8 ms 444 KB Output is correct
21 Correct 10 ms 696 KB Output is correct
22 Correct 7 ms 436 KB Output is correct
23 Correct 7 ms 444 KB Output is correct
24 Correct 9 ms 436 KB Output is correct
25 Correct 8 ms 696 KB Output is correct
26 Correct 8 ms 440 KB Output is correct
27 Correct 8 ms 440 KB Output is correct
28 Correct 7 ms 440 KB Output is correct
29 Correct 7 ms 436 KB Output is correct
30 Correct 7 ms 436 KB Output is correct
31 Correct 21 ms 440 KB Output is correct
32 Correct 25 ms 688 KB Output is correct
33 Correct 42 ms 688 KB Output is correct
34 Correct 51 ms 684 KB Output is correct
35 Correct 56 ms 444 KB Output is correct
36 Correct 44 ms 700 KB Output is correct
37 Correct 47 ms 684 KB Output is correct
38 Correct 55 ms 944 KB Output is correct
39 Correct 49 ms 684 KB Output is correct
40 Correct 49 ms 948 KB Output is correct
41 Correct 49 ms 696 KB Output is correct
42 Correct 39 ms 944 KB Output is correct
43 Correct 67 ms 1188 KB Output is correct
44 Correct 47 ms 692 KB Output is correct
45 Correct 43 ms 440 KB Output is correct
46 Correct 49 ms 692 KB Output is correct
47 Correct 65 ms 444 KB Output is correct
48 Correct 45 ms 440 KB Output is correct
49 Correct 45 ms 696 KB Output is correct
50 Correct 52 ms 684 KB Output is correct
51 Correct 47 ms 436 KB Output is correct
52 Correct 53 ms 932 KB Output is correct
53 Correct 52 ms 936 KB Output is correct
54 Correct 50 ms 692 KB Output is correct
55 Correct 41 ms 948 KB Output is correct
56 Correct 52 ms 700 KB Output is correct
57 Correct 47 ms 700 KB Output is correct
58 Correct 46 ms 692 KB Output is correct
59 Correct 53 ms 680 KB Output is correct
60 Correct 49 ms 944 KB Output is correct