oj.uz

답안 #113351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113351 2019-05-25T06:52:25 Z popovicirobert Xylophone (JOI18_xylophone) C++14
100 / 100
 114 ms 512 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

using namespace std;

//static int A[5000];


inline int get(int a, int b, int pa, int pb, int pc) {

    int bc = query(min(pb, pc), max(pb, pc)), ac = query(min(pa, pc), max(pa, pc));

    if(a < b) {
        if(bc == ac) {
            return b - bc;
        }
        if(ac == abs(a - b)) {
            return b - bc;
        }
        return b + bc;
    }
    else {
        if(bc == ac) {
            return b + bc;
        }
        if(ac == abs(a - b)) {
            return b + bc;
        }
        return b - bc;
    }
}

void solve(int n) {

    if(n == 1) {
        answer(1, 1);
        return ;
    }

    int i;

    vector <int> sol(n + 1);

    sol[1] = 0;
    sol[2] = query(1, 2);

    for(i = 3; i <= n; i++) {
        sol[i] = get(sol[i - 2], sol[i - 1], i - 2, i - 1, i);
    }

    int mn = 2 * n + 1;

    for(i = 1; i <= n; i++) {
        mn = min(mn, sol[i]);
    }

    for(i = 1; i <= n; i++) {
        sol[i] -= mn - 1;
    }

    int a = 0, b = 0;

    for(i = 1; i <= n; i++) {
        if(sol[i] == 1) {
            a = i;
        }
        if(sol[i] == n) {
            b = i;
        }
    }

    if(a > b) {
        for(i = 1; i <= n; i++) {
            sol[i] = n - sol[i] + 1;
        }
    }

    for(i = 1; i <= n; i++) {
        answer(i, sol[i]);
    }

}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 264 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 264 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 6 ms 256 KB Output is correct
17 Correct 8 ms 384 KB Output is correct
18 Correct 17 ms 384 KB Output is correct
19 Correct 8 ms 324 KB Output is correct
20 Correct 15 ms 256 KB Output is correct
21 Correct 20 ms 384 KB Output is correct
22 Correct 13 ms 256 KB Output is correct
23 Correct 21 ms 256 KB Output is correct
24 Correct 10 ms 256 KB Output is correct
25 Correct 15 ms 384 KB Output is correct
26 Correct 16 ms 384 KB Output is correct
27 Correct 9 ms 332 KB Output is correct
28 Correct 9 ms 332 KB Output is correct
29 Correct 15 ms 384 KB Output is correct
30 Correct 9 ms 416 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 264 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 6 ms 256 KB Output is correct
17 Correct 8 ms 384 KB Output is correct
18 Correct 17 ms 384 KB Output is correct
19 Correct 8 ms 324 KB Output is correct
20 Correct 15 ms 256 KB Output is correct
21 Correct 20 ms 384 KB Output is correct
22 Correct 13 ms 256 KB Output is correct
23 Correct 21 ms 256 KB Output is correct
24 Correct 10 ms 256 KB Output is correct
25 Correct 15 ms 384 KB Output is correct
26 Correct 16 ms 384 KB Output is correct
27 Correct 9 ms 332 KB Output is correct
28 Correct 9 ms 332 KB Output is correct
29 Correct 15 ms 384 KB Output is correct
30 Correct 9 ms 416 KB Output is correct
31 Correct 27 ms 408 KB Output is correct
32 Correct 46 ms 328 KB Output is correct
33 Correct 38 ms 376 KB Output is correct
34 Correct 72 ms 384 KB Output is correct
35 Correct 55 ms 256 KB Output is correct
36 Correct 101 ms 256 KB Output is correct
37 Correct 53 ms 332 KB Output is correct
38 Correct 51 ms 344 KB Output is correct
39 Correct 91 ms 424 KB Output is correct
40 Correct 58 ms 384 KB Output is correct
41 Correct 39 ms 340 KB Output is correct
42 Correct 73 ms 512 KB Output is correct
43 Correct 74 ms 384 KB Output is correct
44 Correct 63 ms 384 KB Output is correct
45 Correct 36 ms 376 KB Output is correct
46 Correct 85 ms 332 KB Output is correct
47 Correct 69 ms 384 KB Output is correct
48 Correct 59 ms 256 KB Output is correct
49 Correct 35 ms 332 KB Output is correct
50 Correct 114 ms 256 KB Output is correct
51 Correct 93 ms 256 KB Output is correct
52 Correct 67 ms 384 KB Output is correct
53 Correct 71 ms 388 KB Output is correct
54 Correct 59 ms 256 KB Output is correct
55 Correct 94 ms 376 KB Output is correct
56 Correct 90 ms 384 KB Output is correct
57 Correct 57 ms 384 KB Output is correct
58 Correct 63 ms 384 KB Output is correct
59 Correct 65 ms 336 KB Output is correct
60 Correct 85 ms 340 KB Output is correct