oj.uz

답안 #156358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156358 2019-10-05T10:27:47 Z georgerapeanu Xylophone (JOI18_xylophone) C++11
100 / 100
 87 ms 504 KB 
#include "xylophone.h"
#include <cstdio>

using namespace std;

static int a[5005];
bool taken[5005];

void solve(int n) {

    int l = 1,r = n;

    while(r - l > 1){
        int mid = (l + r) / 2;
        if(query(1,mid) == n - 1){
            r = mid;
        }
        else{
            l = mid;
        }
    }

    int pos_n = r;
    a[pos_n] = n;
    taken[n] = true;

    for(int i = pos_n + 1;i <= n;i++){
        int delta = query(i - 1,i);
        if(a[i - 1] + delta > n || taken[a[i - 1] + delta]){
            a[i] = a[i - 1] - delta;
        }
        else if(a[i - 1] - delta < 1 || taken[a[i - 1] - delta]){
            a[i] = a[i - 1] + delta;
        }
        else{
            int delta2 = query(i - 2,i);
            if(delta2 == delta){
                a[i] = (a[i - 1] <= a[i - 2] ? delta:-delta) + a[i - 1];
            }
            else{
                if(a[i - 1] + delta == a[i - 2] + delta2 || a[i - 1] + delta == a[i - 2] - delta2){
                    a[i] = a[i - 1] + delta;
                }
                else if(a[i - 1] - delta == a[i - 2] + delta2 || a[i - 1] - delta == a[i - 2] -delta2){
                    a[i] = a[i - 1] - delta;
                }
                else{
                    a[i] = a[i - 1] + (a[i - 1] < a[i - 2] ? delta:-delta);
                }
            }
        }
        taken[a[i]] = true;
    }
    
    for(int i = pos_n - 1;i;i--){
        int delta = query(i,i + 1);
        if(a[i + 1] + delta > n || taken[a[i + 1] + delta]){
            a[i] = a[i + 1] - delta;
        }
        else if(a[i + 1] - delta < 1 || taken[a[i + 1] - delta]){
            a[i] = a[i + 1] + delta;
        }
        else{
            int delta2 = query(i,i + 2);
            if(delta2 == delta){
                a[i] = (a[i + 1] <= a[i + 2] ? delta:-delta) + a[i + 1];
            }
            else{
                if(a[i + 1] + delta == a[i + 2] + delta2 || a[i + 1] + delta == a[i + 2] - delta2){
                    a[i] = a[i + 1] + delta;
                }
                else if(a[i + 1] - delta == a[i + 2] + delta2 || a[i + 1] - delta == a[i + 2] -delta2){
                    a[i] = a[i + 1] - delta;
                }
                else{
                    a[i] = a[i + 1] + (a[i + 1] < a[i + 2] ? delta:-delta);
                }
            }
        }
        taken[a[i]] = true;
    }

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

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 3 ms 300 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 248 KB Output is correct
7 Correct 3 ms 304 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 3 ms 248 KB Output is correct
10 Correct 3 ms 308 KB Output is correct
11 Correct 2 ms 300 KB Output is correct
12 Correct 4 ms 388 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 4 ms 248 KB Output is correct
16 Correct 3 ms 388 KB Output is correct
17 Correct 10 ms 376 KB Output is correct
18 Correct 8 ms 304 KB Output is correct
19 Correct 15 ms 248 KB Output is correct
20 Correct 17 ms 248 KB Output is correct
21 Correct 18 ms 384 KB Output is correct
22 Correct 9 ms 304 KB Output is correct
23 Correct 8 ms 304 KB Output is correct
24 Correct 8 ms 300 KB Output is correct
25 Correct 8 ms 304 KB Output is correct
26 Correct 18 ms 248 KB Output is correct
27 Correct 19 ms 296 KB Output is correct
28 Correct 9 ms 304 KB Output is correct
29 Correct 9 ms 304 KB Output is correct
30 Correct 23 ms 380 KB Output is correct
31 Correct 32 ms 316 KB Output is correct
32 Correct 49 ms 376 KB Output is correct
33 Correct 33 ms 388 KB Output is correct
34 Correct 52 ms 376 KB Output is correct
35 Correct 70 ms 376 KB Output is correct
36 Correct 60 ms 388 KB Output is correct
37 Correct 50 ms 376 KB Output is correct
38 Correct 58 ms 248 KB Output is correct
39 Correct 53 ms 376 KB Output is correct
40 Correct 75 ms 440 KB Output is correct
41 Correct 72 ms 380 KB Output is correct
42 Correct 66 ms 252 KB Output is correct
43 Correct 59 ms 400 KB Output is correct
44 Correct 66 ms 380 KB Output is correct
45 Correct 51 ms 300 KB Output is correct
46 Correct 75 ms 376 KB Output is correct
47 Correct 72 ms 324 KB Output is correct
48 Correct 41 ms 380 KB Output is correct
49 Correct 86 ms 376 KB Output is correct
50 Correct 81 ms 396 KB Output is correct
51 Correct 87 ms 376 KB Output is correct
52 Correct 39 ms 384 KB Output is correct
53 Correct 62 ms 504 KB Output is correct
54 Correct 43 ms 376 KB Output is correct
55 Correct 81 ms 376 KB Output is correct
56 Correct 77 ms 248 KB Output is correct
57 Correct 75 ms 312 KB Output is correct
58 Correct 66 ms 428 KB Output is correct
59 Correct 75 ms 328 KB Output is correct
60 Correct 82 ms 312 KB Output is correct