oj.uz

답안 #714235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
714235 2023-03-24T06:50:48 Z four_specks Xylophone (JOI18_xylophone) C++17
100 / 100
 117 ms 592 KB 
#include "xylophone.h"

#include <bits/stdc++.h>

using namespace std;

static int A[5000];

void solve(int N)
{
    vector mem(N, vector<int>(3, -1));

    auto qry = [&](int k, int d)
    {
        if (mem[k][d] == -1)
            mem[k][d] = query(k + 1, k + d + 1);

        return mem[k][d];
    };

    vector<bool> dir(N - 1);
    vector<int> diff(N - 1);

    diff[0] = qry(0, 1);
    for (int i = 0; i < N - 2; i++)
    {
        int
            x = qry(i, 1),
            y = qry(i + 1, 1),
            z = qry(i, 2);

        dir[i + 1] = dir[i] ^ (x + y != z);
        diff[i + 1] = y;
    }

    vector<int> a(N);
    for (int i = 0; i < N - 1; i++)
        a[i + 1] = a[i] + (dir[i] ? diff[i] : -diff[i]);

    if (max_element(a.begin(), a.end()) < min_element(a.begin(), a.end()))
    {
        for (int i = 0; i < N; i++)
            a[i] = -a[i];
    }

    int sub = *min_element(a.begin(), a.end());

    for (int i = 0; i < N; i++)
        a[i] = a[i] - sub;

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

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 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 300 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 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 300 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 2 ms 312 KB Output is correct
17 Correct 9 ms 308 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 19 ms 336 KB Output is correct
20 Correct 21 ms 336 KB Output is correct
21 Correct 17 ms 336 KB Output is correct
22 Correct 20 ms 336 KB Output is correct
23 Correct 22 ms 340 KB Output is correct
24 Correct 16 ms 336 KB Output is correct
25 Correct 22 ms 344 KB Output is correct
26 Correct 22 ms 344 KB Output is correct
27 Correct 26 ms 336 KB Output is correct
28 Correct 8 ms 364 KB Output is correct
29 Correct 23 ms 336 KB Output is correct
30 Correct 17 ms 460 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 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 300 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 4 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 2 ms 312 KB Output is correct
17 Correct 9 ms 308 KB Output is correct
18 Correct 8 ms 344 KB Output is correct
19 Correct 19 ms 336 KB Output is correct
20 Correct 21 ms 336 KB Output is correct
21 Correct 17 ms 336 KB Output is correct
22 Correct 20 ms 336 KB Output is correct
23 Correct 22 ms 340 KB Output is correct
24 Correct 16 ms 336 KB Output is correct
25 Correct 22 ms 344 KB Output is correct
26 Correct 22 ms 344 KB Output is correct
27 Correct 26 ms 336 KB Output is correct
28 Correct 8 ms 364 KB Output is correct
29 Correct 23 ms 336 KB Output is correct
30 Correct 17 ms 460 KB Output is correct
31 Correct 34 ms 408 KB Output is correct
32 Correct 67 ms 464 KB Output is correct
33 Correct 43 ms 532 KB Output is correct
34 Correct 48 ms 584 KB Output is correct
35 Correct 80 ms 592 KB Output is correct
36 Correct 40 ms 592 KB Output is correct
37 Correct 87 ms 568 KB Output is correct
38 Correct 40 ms 568 KB Output is correct
39 Correct 102 ms 584 KB Output is correct
40 Correct 82 ms 572 KB Output is correct
41 Correct 43 ms 584 KB Output is correct
42 Correct 87 ms 572 KB Output is correct
43 Correct 117 ms 572 KB Output is correct
44 Correct 107 ms 592 KB Output is correct
45 Correct 94 ms 568 KB Output is correct
46 Correct 63 ms 568 KB Output is correct
47 Correct 96 ms 584 KB Output is correct
48 Correct 91 ms 592 KB Output is correct
49 Correct 45 ms 592 KB Output is correct
50 Correct 80 ms 592 KB Output is correct
51 Correct 95 ms 572 KB Output is correct
52 Correct 88 ms 568 KB Output is correct
53 Correct 84 ms 568 KB Output is correct
54 Correct 73 ms 588 KB Output is correct
55 Correct 105 ms 568 KB Output is correct
56 Correct 74 ms 572 KB Output is correct
57 Correct 91 ms 572 KB Output is correct
58 Correct 86 ms 584 KB Output is correct
59 Correct 86 ms 568 KB Output is correct
60 Correct 87 ms 572 KB Output is correct