oj.uz

답안 #156361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156361 2019-10-05T10:40:00 Z georgerapeanu Xylophone (JOI18_xylophone) C++11
100 / 100
 124 ms 504 KB 
#include "xylophone.h"
#pragma once
#include <algorithm>

using namespace std;

int ans[5005];

int a[5005];
int b[5005];

void solve(int n) {

    for(int i = 1;i < n;i++){
        a[i] = query(i,i + 1);
    }
    for(int i = 1;i < n - 1;i++){
        b[i] = query(i,i + 2);
    }

    int dir = 1;
    ans[1] = 0;
    ans[2] = a[1];

    for(int i = 3;i <= n;i++){
        if(a[i - 2] + a[i - 1] != b[i - 2]){
            dir *= -1;
        }
        ans[i] = ans[i - 1] + dir * a[i - 1];
    }

    pair<int,int> mi = {n + 5,n + 5},ma = {0,0};

    for(int i = 1;i <= n;i++){
        mi = min(mi,{ans[i],i});
        ma = max(ma,{ans[i],i});
    }

    for(int i = 1;i <= n;i++){
        ans[i] = ans[i] - mi.first + 1;
        if(mi.second > ma.second){
            ans[i] = n - ans[i] + 1;
        }
        answer(i,ans[i]);
    }
}

Compilation message

xylophone.cpp:2:9: warning: #pragma once in main file
 #pragma once
         ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 5 ms 252 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 13 ms 312 KB Output is correct
18 Correct 17 ms 248 KB Output is correct
19 Correct 26 ms 376 KB Output is correct
20 Correct 20 ms 312 KB Output is correct
21 Correct 28 ms 376 KB Output is correct
22 Correct 13 ms 296 KB Output is correct
23 Correct 21 ms 376 KB Output is correct
24 Correct 23 ms 248 KB Output is correct
25 Correct 28 ms 376 KB Output is correct
26 Correct 25 ms 376 KB Output is correct
27 Correct 14 ms 296 KB Output is correct
28 Correct 23 ms 376 KB Output is correct
29 Correct 13 ms 388 KB Output is correct
30 Correct 23 ms 392 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 248 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 5 ms 252 KB Output is correct
13 Correct 4 ms 248 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 13 ms 312 KB Output is correct
18 Correct 17 ms 248 KB Output is correct
19 Correct 26 ms 376 KB Output is correct
20 Correct 20 ms 312 KB Output is correct
21 Correct 28 ms 376 KB Output is correct
22 Correct 13 ms 296 KB Output is correct
23 Correct 21 ms 376 KB Output is correct
24 Correct 23 ms 248 KB Output is correct
25 Correct 28 ms 376 KB Output is correct
26 Correct 25 ms 376 KB Output is correct
27 Correct 14 ms 296 KB Output is correct
28 Correct 23 ms 376 KB Output is correct
29 Correct 13 ms 388 KB Output is correct
30 Correct 23 ms 392 KB Output is correct
31 Correct 50 ms 324 KB Output is correct
32 Correct 69 ms 320 KB Output is correct
33 Correct 93 ms 504 KB Output is correct
34 Correct 110 ms 440 KB Output is correct
35 Correct 112 ms 376 KB Output is correct
36 Correct 97 ms 384 KB Output is correct
37 Correct 56 ms 300 KB Output is correct
38 Correct 114 ms 248 KB Output is correct
39 Correct 114 ms 248 KB Output is correct
40 Correct 54 ms 388 KB Output is correct
41 Correct 113 ms 316 KB Output is correct
42 Correct 116 ms 380 KB Output is correct
43 Correct 113 ms 376 KB Output is correct
44 Correct 112 ms 376 KB Output is correct
45 Correct 105 ms 452 KB Output is correct
46 Correct 93 ms 448 KB Output is correct
47 Correct 124 ms 376 KB Output is correct
48 Correct 95 ms 380 KB Output is correct
49 Correct 118 ms 376 KB Output is correct
50 Correct 70 ms 388 KB Output is correct
51 Correct 106 ms 392 KB Output is correct
52 Correct 54 ms 376 KB Output is correct
53 Correct 119 ms 424 KB Output is correct
54 Correct 114 ms 384 KB Output is correct
55 Correct 69 ms 384 KB Output is correct
56 Correct 69 ms 320 KB Output is correct
57 Correct 91 ms 248 KB Output is correct
58 Correct 121 ms 448 KB Output is correct
59 Correct 64 ms 380 KB Output is correct
60 Correct 98 ms 376 KB Output is correct