oj.uz

답안 #734873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
734873 2023-05-03T07:50:19 Z sandry24 Xylophone (JOI18_xylophone) C++17
100 / 100
 144 ms 380 KB 
#include "xylophone.h"

void solve(int N){
    int diff1[N], diff2[N], A[N];
    for(int i = 0; i < N-1; i++)
        diff1[i] = query(i+1, i+2);
    for(int i = 0; i < N-2; i++)
        diff2[i] = query(i+1, i+3);
    A[0] = 0; A[1] = diff1[0];
    bool diffup = true;
    int maxpos = 1, minpos = 0;
    for(int i = 2; i < N; i++){
        if(diff1[i-2] + diff1[i-1] != diff2[i-2])
            diffup = !diffup;
        A[i] = A[i-1] + diff1[i-1] * (diffup ? 1 : -1);
        if(A[i] > A[maxpos])
            maxpos = i;
        if(A[i] < A[minpos])
            minpos = i;
    }
    if(maxpos < minpos){
        minpos = 1;
        A[1] = -diff1[0];
        bool diffup = false;
        for(int i = 2; i < N; i++){
            if(diff1[i-2] + diff1[i-1] != diff2[i-2])
                diffup = !diffup;
            A[i] = A[i-1] + diff1[i-1] * (diffup ? 1 : -1);
            if(A[i] < A[minpos])
                minpos = i;
        }
    }
    for(int i = 0; i < N; i++)
        answer(i+1, A[i] - A[minpos] + 1);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 276 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 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 3 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 13 ms 328 KB Output is correct
19 Correct 19 ms 268 KB Output is correct
20 Correct 23 ms 208 KB Output is correct
21 Correct 9 ms 288 KB Output is correct
22 Correct 17 ms 268 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 22 ms 272 KB Output is correct
25 Correct 17 ms 272 KB Output is correct
26 Correct 16 ms 208 KB Output is correct
27 Correct 20 ms 272 KB Output is correct
28 Correct 17 ms 208 KB Output is correct
29 Correct 18 ms 208 KB Output is correct
30 Correct 12 ms 208 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 276 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 2 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 3 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 13 ms 328 KB Output is correct
19 Correct 19 ms 268 KB Output is correct
20 Correct 23 ms 208 KB Output is correct
21 Correct 9 ms 288 KB Output is correct
22 Correct 17 ms 268 KB Output is correct
23 Correct 16 ms 208 KB Output is correct
24 Correct 22 ms 272 KB Output is correct
25 Correct 17 ms 272 KB Output is correct
26 Correct 16 ms 208 KB Output is correct
27 Correct 20 ms 272 KB Output is correct
28 Correct 17 ms 208 KB Output is correct
29 Correct 18 ms 208 KB Output is correct
30 Correct 12 ms 208 KB Output is correct
31 Correct 35 ms 208 KB Output is correct
32 Correct 40 ms 292 KB Output is correct
33 Correct 52 ms 316 KB Output is correct
34 Correct 104 ms 336 KB Output is correct
35 Correct 98 ms 320 KB Output is correct
36 Correct 89 ms 316 KB Output is correct
37 Correct 98 ms 336 KB Output is correct
38 Correct 78 ms 336 KB Output is correct
39 Correct 82 ms 336 KB Output is correct
40 Correct 70 ms 324 KB Output is correct
41 Correct 97 ms 328 KB Output is correct
42 Correct 89 ms 336 KB Output is correct
43 Correct 88 ms 336 KB Output is correct
44 Correct 89 ms 336 KB Output is correct
45 Correct 79 ms 336 KB Output is correct
46 Correct 92 ms 336 KB Output is correct
47 Correct 102 ms 336 KB Output is correct
48 Correct 75 ms 316 KB Output is correct
49 Correct 54 ms 316 KB Output is correct
50 Correct 91 ms 316 KB Output is correct
51 Correct 144 ms 336 KB Output is correct
52 Correct 80 ms 316 KB Output is correct
53 Correct 103 ms 316 KB Output is correct
54 Correct 83 ms 376 KB Output is correct
55 Correct 91 ms 336 KB Output is correct
56 Correct 76 ms 380 KB Output is correct
57 Correct 110 ms 336 KB Output is correct
58 Correct 88 ms 336 KB Output is correct
59 Correct 99 ms 336 KB Output is correct
60 Correct 84 ms 364 KB Output is correct