Submission #57916

# Submission time Handle Problem Language Result Execution time Memory
57916 2018-07-16T13:57:14 Z paulica Xylophone (JOI18_xylophone) C++14
100 / 100
119 ms 840 KB
#include "xylophone.h"

#include <bits/stdc++.h>
using namespace std;

void solve(int n) {
    int a[5010], d[5010];

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

    int sign = 1;
    a[0] = 0;
    a[1] = d[0];

    for (int i = 1; i < n - 1; i++) {
        if (query(i, i + 2) != (d[i - 1] + d[i]))
            sign = -sign;

        a[i + 1] = a[i] + sign * d[i];
    }

    int posMin = 0, posMax = 0;
    for (int i = 1; i < n; i++) {
        if (a[i] < a[posMin]) posMin = i;
        if (a[i] > a[posMax]) posMax = i;
    }

    if (posMin > posMax) {
        for (int i = 1; i < n; i++) a[i] = -a[i];
        swap(posMin, posMax);
    }

    for (int i = 0; i < n; i++)
        answer(i + 1, a[i] - a[posMin] + 1);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:14:15: warning: 'd[0]' may be used uninitialized in this function [-Wmaybe-uninitialized]
     a[1] = d[0];
            ~~~^
# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 2 ms 308 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 6 ms 624 KB Output is correct
10 Correct 5 ms 624 KB Output is correct
11 Correct 5 ms 624 KB Output is correct
12 Correct 5 ms 624 KB Output is correct
13 Correct 5 ms 624 KB Output is correct
14 Correct 5 ms 624 KB Output is correct
15 Correct 7 ms 624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 2 ms 308 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 6 ms 624 KB Output is correct
10 Correct 5 ms 624 KB Output is correct
11 Correct 5 ms 624 KB Output is correct
12 Correct 5 ms 624 KB Output is correct
13 Correct 5 ms 624 KB Output is correct
14 Correct 5 ms 624 KB Output is correct
15 Correct 7 ms 624 KB Output is correct
16 Correct 5 ms 624 KB Output is correct
17 Correct 14 ms 624 KB Output is correct
18 Correct 9 ms 624 KB Output is correct
19 Correct 24 ms 700 KB Output is correct
20 Correct 21 ms 700 KB Output is correct
21 Correct 15 ms 700 KB Output is correct
22 Correct 13 ms 700 KB Output is correct
23 Correct 22 ms 700 KB Output is correct
24 Correct 11 ms 700 KB Output is correct
25 Correct 17 ms 700 KB Output is correct
26 Correct 15 ms 700 KB Output is correct
27 Correct 18 ms 700 KB Output is correct
28 Correct 15 ms 700 KB Output is correct
29 Correct 13 ms 700 KB Output is correct
30 Correct 17 ms 700 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 2 ms 308 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 6 ms 624 KB Output is correct
10 Correct 5 ms 624 KB Output is correct
11 Correct 5 ms 624 KB Output is correct
12 Correct 5 ms 624 KB Output is correct
13 Correct 5 ms 624 KB Output is correct
14 Correct 5 ms 624 KB Output is correct
15 Correct 7 ms 624 KB Output is correct
16 Correct 5 ms 624 KB Output is correct
17 Correct 14 ms 624 KB Output is correct
18 Correct 9 ms 624 KB Output is correct
19 Correct 24 ms 700 KB Output is correct
20 Correct 21 ms 700 KB Output is correct
21 Correct 15 ms 700 KB Output is correct
22 Correct 13 ms 700 KB Output is correct
23 Correct 22 ms 700 KB Output is correct
24 Correct 11 ms 700 KB Output is correct
25 Correct 17 ms 700 KB Output is correct
26 Correct 15 ms 700 KB Output is correct
27 Correct 18 ms 700 KB Output is correct
28 Correct 15 ms 700 KB Output is correct
29 Correct 13 ms 700 KB Output is correct
30 Correct 17 ms 700 KB Output is correct
31 Correct 40 ms 700 KB Output is correct
32 Correct 57 ms 700 KB Output is correct
33 Correct 90 ms 700 KB Output is correct
34 Correct 87 ms 704 KB Output is correct
35 Correct 57 ms 828 KB Output is correct
36 Correct 110 ms 828 KB Output is correct
37 Correct 115 ms 828 KB Output is correct
38 Correct 106 ms 840 KB Output is correct
39 Correct 92 ms 840 KB Output is correct
40 Correct 86 ms 840 KB Output is correct
41 Correct 83 ms 840 KB Output is correct
42 Correct 96 ms 840 KB Output is correct
43 Correct 113 ms 840 KB Output is correct
44 Correct 87 ms 840 KB Output is correct
45 Correct 75 ms 840 KB Output is correct
46 Correct 105 ms 840 KB Output is correct
47 Correct 42 ms 840 KB Output is correct
48 Correct 60 ms 840 KB Output is correct
49 Correct 84 ms 840 KB Output is correct
50 Correct 108 ms 840 KB Output is correct
51 Correct 85 ms 840 KB Output is correct
52 Correct 109 ms 840 KB Output is correct
53 Correct 101 ms 840 KB Output is correct
54 Correct 92 ms 840 KB Output is correct
55 Correct 92 ms 840 KB Output is correct
56 Correct 48 ms 840 KB Output is correct
57 Correct 51 ms 840 KB Output is correct
58 Correct 94 ms 840 KB Output is correct
59 Correct 119 ms 840 KB Output is correct
60 Correct 119 ms 840 KB Output is correct