oj.uz

답안 #865559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
865559 2023-10-24T10:10:58 Z 12345678 Xylophone (JOI18_xylophone) C++17
100 / 100
 58 ms 1452 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=5e3+5;
int d1[nx], d2[nx], v1[nx], v2[nx];
bool ad[nx], ad2[nx];

void solve(int N) {
    for (int i=1; i<N; i++) d1[i]=query(i, i+1);
    for (int i=1; i<N-1; i++) d2[i]=query(i, i+2);
    v1[2]=d1[1]; ad[1]=1;
    pair<int, int> mn={0, 1}, mx={d1[1], 2};
    for (int i=3; i<=N; i++)
    {
        if (d2[i-2]==d1[i-2]+d1[i-1])
        {
            if (ad[i-2]) v1[i]=v1[i-1]+d1[i-1], ad[i-1]=1;
            else v1[i]=v1[i-1]-d1[i-1], ad[i-1]=0;
        }
        else
        {
            if (ad[i-2]) v1[i]=v1[i-1]-d1[i-1], ad[i-1]=0;
            else v1[i]=v1[i-1]+d1[i-1], ad[i-1]=1;
        }
        mn=min(mn, {v1[i], i});
        mx=max(mx, {v1[i], i});
    }
    v2[2]=-d1[1]; ad2[1]=0;
    for (int i=3; i<=N; i++)
    {
        if (d2[i-2]==d1[i-2]+d1[i-1])
        {
            if (ad2[i-2]) v2[i]=v2[i-1]+d1[i-1], ad2[i-1]=1;
            else v2[i]=v2[i-1]-d1[i-1], ad2[i-1]=0;
        }
        else
        {
            if (ad2[i-2]) v2[i]=v2[i-1]-d1[i-1], ad2[i-1]=0;
            else v2[i]=v2[i-1]+d1[i-1], ad2[i-1]=1;
        }
    }
    if (mn.second<mx.second) for (int i=1; i<=N; i++) answer(i, v1[i]-mn.first+1);
    else for (int i=1; i<=N; i++) answer(i, v2[i]+mx.first+1);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 1 ms 864 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 444 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 700 KB Output is correct
13 Correct 1 ms 440 KB Output is correct
14 Correct 1 ms 452 KB Output is correct
15 Correct 1 ms 692 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 1 ms 864 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 444 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 700 KB Output is correct
13 Correct 1 ms 440 KB Output is correct
14 Correct 1 ms 452 KB Output is correct
15 Correct 1 ms 692 KB Output is correct
16 Correct 2 ms 704 KB Output is correct
17 Correct 4 ms 448 KB Output is correct
18 Correct 6 ms 696 KB Output is correct
19 Correct 9 ms 700 KB Output is correct
20 Correct 8 ms 952 KB Output is correct
21 Correct 7 ms 700 KB Output is correct
22 Correct 11 ms 700 KB Output is correct
23 Correct 7 ms 1196 KB Output is correct
24 Correct 8 ms 872 KB Output is correct
25 Correct 8 ms 1204 KB Output is correct
26 Correct 10 ms 692 KB Output is correct
27 Correct 8 ms 696 KB Output is correct
28 Correct 10 ms 700 KB Output is correct
29 Correct 8 ms 948 KB Output is correct
30 Correct 10 ms 708 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 1 ms 864 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 444 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 700 KB Output is correct
13 Correct 1 ms 440 KB Output is correct
14 Correct 1 ms 452 KB Output is correct
15 Correct 1 ms 692 KB Output is correct
16 Correct 2 ms 704 KB Output is correct
17 Correct 4 ms 448 KB Output is correct
18 Correct 6 ms 696 KB Output is correct
19 Correct 9 ms 700 KB Output is correct
20 Correct 8 ms 952 KB Output is correct
21 Correct 7 ms 700 KB Output is correct
22 Correct 11 ms 700 KB Output is correct
23 Correct 7 ms 1196 KB Output is correct
24 Correct 8 ms 872 KB Output is correct
25 Correct 8 ms 1204 KB Output is correct
26 Correct 10 ms 692 KB Output is correct
27 Correct 8 ms 696 KB Output is correct
28 Correct 10 ms 700 KB Output is correct
29 Correct 8 ms 948 KB Output is correct
30 Correct 10 ms 708 KB Output is correct
31 Correct 20 ms 696 KB Output is correct
32 Correct 27 ms 1208 KB Output is correct
33 Correct 39 ms 952 KB Output is correct
34 Correct 52 ms 956 KB Output is correct
35 Correct 49 ms 948 KB Output is correct
36 Correct 39 ms 1400 KB Output is correct
37 Correct 48 ms 960 KB Output is correct
38 Correct 47 ms 960 KB Output is correct
39 Correct 44 ms 708 KB Output is correct
40 Correct 55 ms 1452 KB Output is correct
41 Correct 39 ms 760 KB Output is correct
42 Correct 58 ms 692 KB Output is correct
43 Correct 43 ms 1200 KB Output is correct
44 Correct 36 ms 1208 KB Output is correct
45 Correct 53 ms 692 KB Output is correct
46 Correct 52 ms 944 KB Output is correct
47 Correct 42 ms 1204 KB Output is correct
48 Correct 45 ms 532 KB Output is correct
49 Correct 50 ms 1208 KB Output is correct
50 Correct 42 ms 1212 KB Output is correct
51 Correct 42 ms 952 KB Output is correct
52 Correct 50 ms 1220 KB Output is correct
53 Correct 43 ms 956 KB Output is correct
54 Correct 37 ms 956 KB Output is correct
55 Correct 39 ms 952 KB Output is correct
56 Correct 54 ms 692 KB Output is correct
57 Correct 49 ms 932 KB Output is correct
58 Correct 42 ms 952 KB Output is correct
59 Correct 56 ms 708 KB Output is correct
60 Correct 37 ms 452 KB Output is correct