oj.uz

답안 #492417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492417 2021-12-07T08:00:22 Z alextodoran Xylophone (JOI18_xylophone) C++17
100 / 100
 105 ms 580 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

typedef long long ll;

const int N_MAX = 5000;

int query (int s, int t);
void answer (int i, int a);

int A[N_MAX + 2];
int D[N_MAX + 2];
int E[N_MAX + 2];

bool build (int N) {
    for (int i = 3; i <= N; i++) {
        A[i] = A[i - 1] - D[i];
        if (max({A[i - 2], A[i - 1], A[i]}) - min({A[i - 2], A[i - 1], A[i]}) != E[i]) {
            A[i] = A[i - 1] + D[i];
        }
    }
    int mnPos = 1;
    int mxPos = 1;
    for (int i = 1; i <= N; i++) {
        if (A[i] < A[mnPos]) {
            mnPos = i;
        }
        if (A[i] > A[mxPos]) {
            mxPos = i;
        }
    }
    int mn = A[mnPos];
    for (int i = 1; i <= N; i++) {
        A[i] += 1 - mn;
    }
    return (mnPos < mxPos);
}

void solve (int N) {
    for (int i = 2; i <= N; i++) {
        D[i] = query(i - 1, i);
    }
    for (int i = 3; i <= N; i++) {
        E[i] = query(i - 2, i);
    }
    A[1] = 0;
    A[2] = 0 + D[2];
    if (build(N) == false) {
        A[1] = 0;
        A[2] = 0 - D[2];
        build(N);
    }

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 3 ms 296 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 3 ms 296 KB Output is correct
12 Correct 5 ms 200 KB Output is correct
13 Correct 2 ms 272 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 3 ms 296 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 3 ms 296 KB Output is correct
12 Correct 5 ms 200 KB Output is correct
13 Correct 2 ms 272 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 7 ms 296 KB Output is correct
18 Correct 17 ms 296 KB Output is correct
19 Correct 15 ms 292 KB Output is correct
20 Correct 16 ms 284 KB Output is correct
21 Correct 15 ms 304 KB Output is correct
22 Correct 21 ms 296 KB Output is correct
23 Correct 19 ms 288 KB Output is correct
24 Correct 16 ms 304 KB Output is correct
25 Correct 14 ms 308 KB Output is correct
26 Correct 20 ms 328 KB Output is correct
27 Correct 21 ms 416 KB Output is correct
28 Correct 19 ms 300 KB Output is correct
29 Correct 16 ms 300 KB Output is correct
30 Correct 11 ms 284 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 3 ms 296 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 3 ms 296 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 3 ms 296 KB Output is correct
12 Correct 5 ms 200 KB Output is correct
13 Correct 2 ms 272 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 7 ms 296 KB Output is correct
18 Correct 17 ms 296 KB Output is correct
19 Correct 15 ms 292 KB Output is correct
20 Correct 16 ms 284 KB Output is correct
21 Correct 15 ms 304 KB Output is correct
22 Correct 21 ms 296 KB Output is correct
23 Correct 19 ms 288 KB Output is correct
24 Correct 16 ms 304 KB Output is correct
25 Correct 14 ms 308 KB Output is correct
26 Correct 20 ms 328 KB Output is correct
27 Correct 21 ms 416 KB Output is correct
28 Correct 19 ms 300 KB Output is correct
29 Correct 16 ms 300 KB Output is correct
30 Correct 11 ms 284 KB Output is correct
31 Correct 33 ms 320 KB Output is correct
32 Correct 23 ms 300 KB Output is correct
33 Correct 79 ms 292 KB Output is correct
34 Correct 77 ms 308 KB Output is correct
35 Correct 101 ms 300 KB Output is correct
36 Correct 83 ms 552 KB Output is correct
37 Correct 93 ms 292 KB Output is correct
38 Correct 38 ms 304 KB Output is correct
39 Correct 79 ms 296 KB Output is correct
40 Correct 91 ms 424 KB Output is correct
41 Correct 88 ms 296 KB Output is correct
42 Correct 74 ms 320 KB Output is correct
43 Correct 85 ms 424 KB Output is correct
44 Correct 72 ms 328 KB Output is correct
45 Correct 99 ms 296 KB Output is correct
46 Correct 90 ms 324 KB Output is correct
47 Correct 90 ms 580 KB Output is correct
48 Correct 70 ms 336 KB Output is correct
49 Correct 75 ms 292 KB Output is correct
50 Correct 72 ms 320 KB Output is correct
51 Correct 69 ms 300 KB Output is correct
52 Correct 84 ms 300 KB Output is correct
53 Correct 82 ms 300 KB Output is correct
54 Correct 80 ms 408 KB Output is correct
55 Correct 79 ms 304 KB Output is correct
56 Correct 75 ms 320 KB Output is correct
57 Correct 94 ms 292 KB Output is correct
58 Correct 96 ms 320 KB Output is correct
59 Correct 105 ms 296 KB Output is correct
60 Correct 82 ms 320 KB Output is correct