oj.uz

답안 #163730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
163730 2019-11-14T21:03:11 Z DS007 Xylophone (JOI18_xylophone) C++14
100 / 100
 79 ms 484 KB 
#include <bits/stdc++.h>
using namespace std;

int query(int u, int v);
void answer(int u, int v);
/*void solve(int n);
int main() {
    solve(69);
}*/

void solve(int n) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int d = query(1, n);
    int l = 1, h = n, ans1 = -1;
    while (l <= h) {
        int m = (l + h) / 2;
        if (query(1, m) == d)
            ans1 = m, h = m - 1;
        else
            l = m + 1;
    }

    int a[n];
    a[ans1 - 1] = n;

    /*int ans2 = -1;
    l = 1, h = ans1 - 1;
    while (l <= h) {
        int m = (l + h) / 2;
        if (query(m, ans1) == d)
            ans2 = m, l = m + 1;
        else
            h = m - 1;
    }
    a[ans2 - 1] = 1;*/

    bool check[n];
    fill(check, check + n, false);
    check[n - 1] = true;

    if (ans1 != n)
        a[ans1] = n - query(ans1, ans1 + 1), check[a[ans1] - 1] = true;
    a[ans1 - 2] = n - query(ans1 - 1, ans1);
    check[a[ans1 - 2] - 1] = true;

    for (int i = ans1 + 1; i < n; i++) {
        int d1 = query(i, i + 1);
        if (a[i - 1] + d1 >= n || check[a[i - 1] + d1 - 1]) {
            a[i] = a[i - 1] - d1, check[a[i] - 1] = true;
            continue;
        } else if (a[i - 1] - d1 <= 1 || check[a[i - 1] - d1 - 1]) {
            a[i] = a[i - 1] + d1, check[a[i] - 1] = true;
            continue;
        }
        int d2 = query(i - 1, i + 1);
        if (d2 == abs(a[i - 1] - a[i - 2])) {
            if (a[i - 1] > a[i - 2])
                a[i] = a[i - 1] - d1;
            else
                a[i] = a[i - 1] + d1;
        } else {
            int temp = a[i - 1] + d1;
            if (max(temp, max(a[i - 1], a[i - 2])) - min(temp, min(a[i - 1], a[i - 2])) == d2)
                a[i] = temp;
            else
                a[i] = temp - 2 * d1;
        }
        check[a[i] - 1] = true;
    }

    for (int i = ans1 - 3; i >= 0; i--) {
        int d1 = query(i + 1, i + 2);
        if (a[i + 1] + d1 >= n || check[a[i + 1] + d1 - 1]) {
            a[i] = a[i + 1] - d1, check[a[i] - 1] = true;
            continue;
        } else if (a[i + 1] - d1 < 1 || check[a[i + 1] - d1 - 1]) {
            a[i] = a[i + 1] + d1, check[a[i] - 1] = true;
            continue;
        }
        int d2 = query(i + 1, i + 3);
        if (d2 == abs(a[i + 1] - a[i + 2])) {
            if (a[i + 1] > a[i + 2])
                a[i] = a[i + 1] - d1;
            else
                a[i] = a[i + 1] + d1;
        } else {
            int temp = a[i + 1] + d1;
            if (max(temp, max(a[i + 1], a[i + 2])) - min(temp, min(a[i + 1], a[i + 2])) == d2)
                a[i] = temp;
            else
                a[i] = temp - 2 * d1;
        }
        check[a[i] - 1] = true;
    }

    for (int i = 1; i <= n; i++)
        answer(i, a[i - 1]);
}
/*
#include <cstdio>
#include <cstdlib>

static const int N_MAX = 5000;
static const int Q_MAX = 10000;
static int N;
static int A[N_MAX];
static bool used[N_MAX];
static int query_c;
static int answer_c;

int query(int s, int t) {
    if(query_c >= Q_MAX) {
        printf("Wrong Answer\n");
        exit(0);
    }
    query_c++;
    if(!(1 <= s && s <= t && t <= N)) {
        printf("Wrong Answer\n");
        exit(0);
    }
    int mx = 0, mn = N + 1;
    for(int i = s - 1; i < t; i++) {
        if(mx < A[i]) {
            mx = A[i];
        }
        if(mn > A[i]) {
            mn = A[i];
        }
    }
    return mx - mn;
}

void answer(int i, int a) {
    answer_c++;
    if(!(1 <= i && i <= N)) {
        printf("Wrong Answer\n");
        exit(0);
    }
    if(!(1 <= a && a <= N)) {
        printf("Wrong Answer\n");
        exit(0);
    }
    if(used[i - 1]) {
        printf("Wrong Answer\n");
        exit(0);
    }
    if(a != A[i - 1]) {
        printf("Wrong Answer\n");
        exit(0);
    }
    used[i - 1] = true;
}

int main() {
    query_c = 0;
    answer_c = 0;
    if(scanf("%d", &N) != 1) {
        fprintf(stderr, "Error while reading input\n");
        exit(1);
    }
    for(int i = 0; i < N; i++) {
        if(scanf("%d", A + i) != 1) {
            fprintf(stderr, "Error while reading input\n");
            exit(1);
        }
        used[i] = false;
    }
    solve(N);
    if(!(answer_c == N)) {
        printf("Wrong Answer\n");
        exit(0);
    }
    printf("Accepted : %d\n", query_c);
}
*/

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 2 ms 248 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 3 ms 248 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 3 ms 252 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 9 ms 248 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 3 ms 248 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 2 ms 248 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 3 ms 248 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 3 ms 252 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 9 ms 248 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 3 ms 248 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 11 ms 376 KB Output is correct
18 Correct 14 ms 248 KB Output is correct
19 Correct 17 ms 376 KB Output is correct
20 Correct 18 ms 248 KB Output is correct
21 Correct 14 ms 296 KB Output is correct
22 Correct 18 ms 248 KB Output is correct
23 Correct 13 ms 376 KB Output is correct
24 Correct 8 ms 336 KB Output is correct
25 Correct 13 ms 248 KB Output is correct
26 Correct 16 ms 376 KB Output is correct
27 Correct 19 ms 248 KB Output is correct
28 Correct 14 ms 248 KB Output is correct
29 Correct 15 ms 252 KB Output is correct
30 Correct 9 ms 340 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 2 ms 248 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 248 KB Output is correct
7 Correct 3 ms 248 KB Output is correct
8 Correct 4 ms 248 KB Output is correct
9 Correct 3 ms 252 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 9 ms 248 KB Output is correct
12 Correct 4 ms 248 KB Output is correct
13 Correct 3 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 3 ms 248 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 11 ms 376 KB Output is correct
18 Correct 14 ms 248 KB Output is correct
19 Correct 17 ms 376 KB Output is correct
20 Correct 18 ms 248 KB Output is correct
21 Correct 14 ms 296 KB Output is correct
22 Correct 18 ms 248 KB Output is correct
23 Correct 13 ms 376 KB Output is correct
24 Correct 8 ms 336 KB Output is correct
25 Correct 13 ms 248 KB Output is correct
26 Correct 16 ms 376 KB Output is correct
27 Correct 19 ms 248 KB Output is correct
28 Correct 14 ms 248 KB Output is correct
29 Correct 15 ms 252 KB Output is correct
30 Correct 9 ms 340 KB Output is correct
31 Correct 24 ms 376 KB Output is correct
32 Correct 50 ms 376 KB Output is correct
33 Correct 59 ms 376 KB Output is correct
34 Correct 56 ms 376 KB Output is correct
35 Correct 73 ms 376 KB Output is correct
36 Correct 53 ms 360 KB Output is correct
37 Correct 52 ms 248 KB Output is correct
38 Correct 57 ms 248 KB Output is correct
39 Correct 72 ms 380 KB Output is correct
40 Correct 69 ms 376 KB Output is correct
41 Correct 71 ms 360 KB Output is correct
42 Correct 66 ms 436 KB Output is correct
43 Correct 43 ms 376 KB Output is correct
44 Correct 54 ms 484 KB Output is correct
45 Correct 71 ms 248 KB Output is correct
46 Correct 71 ms 356 KB Output is correct
47 Correct 78 ms 248 KB Output is correct
48 Correct 75 ms 436 KB Output is correct
49 Correct 37 ms 468 KB Output is correct
50 Correct 76 ms 248 KB Output is correct
51 Correct 48 ms 376 KB Output is correct
52 Correct 73 ms 424 KB Output is correct
53 Correct 68 ms 360 KB Output is correct
54 Correct 67 ms 360 KB Output is correct
55 Correct 73 ms 356 KB Output is correct
56 Correct 72 ms 376 KB Output is correct
57 Correct 79 ms 424 KB Output is correct
58 Correct 75 ms 376 KB Output is correct
59 Correct 64 ms 364 KB Output is correct
60 Correct 73 ms 380 KB Output is correct