oj.uz

Submission #141061

# Submission time Handle Problem Language Result Execution time Memory
141061 2019-08-06T12:47:11 Z meatrow Xylophone (JOI18_xylophone) C++17
100 / 100
 87 ms 680 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

using ll = long long;
using ld = long double;

const int N = 5001;

map<int, int> used;
int a[N];

void solve(int n) {
    int l = 1, r = n;
    while (l + 1 < r) {
        int mid = (l + r) / 2;
        int t = query(1, mid);
        if (t == n - 1) {
            r = mid;
        } else {
            l = mid;
        }
    }
    a[r] = n;
    for (int i = r + 1; i <= n; i++) {
        used[a[i - 1]] = 1;
        int t = query(i - 1, i);
        if (a[i - 1] + t > n || used.count(a[i - 1] + t)) {
            a[i] = a[i - 1] - t;
            continue;
        }
        if (a[i - 1] - t < 1 || used.count(a[i - 1] - t)) {
            a[i] = a[i - 1] + t;
            continue;
        }
        int u = query(i - 2, i);
        if (u == abs(a[i - 2] - a[i - 1])) {
            if (a[i - 2] < a[i - 1]) {
                a[i] = a[i - 1] - t;
            } else {
                a[i] = a[i - 1] + t;
            }
            continue;
        }
        if (u != t) {
            int cand = a[i - 2] + u;
            if (cand == a[i - 1] - t || cand == a[i - 1] + t) {
                a[i] = cand;
            } else {
                a[i] = cand - 2 * u;
            }
            continue;
        }
        if (a[i - 2] < a[i - 1]) {
            a[i] = a[i - 1] - t;
        } else {
            a[i] = a[i - 1] + t;
        }
    }
    for (int i = r - 1; i >= 1; i--) {
        used[a[i + 1]] = 1;
        int t = query(i, i + 1);
        if (a[i + 1] + t > n || used.count(a[i + 1] + t)) {
            a[i] = a[i + 1] - t;
            continue;
        }
        if (a[i + 1] - t < 1 || used.count(a[i + 1] - t)) {
            a[i] = a[i + 1] + t;
            continue;
        }
        int u = query(i, i + 2);
        if (u == abs(a[i + 2] - a[i + 1])) {
            if (a[i + 2] < a[i + 1]) {
                a[i] = a[i + 1] - t;
            } else {
                a[i] = a[i + 1] + t;
            }
            continue;
        }
        if (u != t) {
            int cand = a[i + 2] + u;
            if (cand == a[i + 1] - t || cand == a[i + 1] + t) {
                a[i] = cand;
            } else {
                a[i] = cand - 2 * u;
            }
            continue;
        }
        if (a[i + 2] < a[i + 1]) {
            a[i] = a[i + 1] - t;
        } else {
            a[i] = a[i + 1] + t;
        }
    }
    for (int i = 1; i <= n; i++) {
        answer(i, a[i]);
    }
}

/*int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    return 0;
}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 3 ms 408 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 376 KB Output is correct
8 Correct 4 ms 380 KB Output is correct
9 Correct 2 ms 324 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 3 ms 316 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 248 KB Output is correct
15 Correct 3 ms 376 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory 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 3 ms 408 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 376 KB Output is correct
8 Correct 4 ms 380 KB Output is correct
9 Correct 2 ms 324 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 3 ms 316 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 248 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 9 ms 248 KB Output is correct
18 Correct 14 ms 440 KB Output is correct
19 Correct 18 ms 376 KB Output is correct
20 Correct 17 ms 376 KB Output is correct
21 Correct 15 ms 248 KB Output is correct
22 Correct 17 ms 376 KB Output is correct
23 Correct 15 ms 376 KB Output is correct
24 Correct 13 ms 248 KB Output is correct
25 Correct 13 ms 376 KB Output is correct
26 Correct 10 ms 320 KB Output is correct
27 Correct 19 ms 248 KB Output is correct
28 Correct 15 ms 380 KB Output is correct
29 Correct 16 ms 428 KB Output is correct
30 Correct 16 ms 376 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory 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 3 ms 408 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 376 KB Output is correct
8 Correct 4 ms 380 KB Output is correct
9 Correct 2 ms 324 KB Output is correct
10 Correct 3 ms 248 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 3 ms 316 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 248 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 9 ms 248 KB Output is correct
18 Correct 14 ms 440 KB Output is correct
19 Correct 18 ms 376 KB Output is correct
20 Correct 17 ms 376 KB Output is correct
21 Correct 15 ms 248 KB Output is correct
22 Correct 17 ms 376 KB Output is correct
23 Correct 15 ms 376 KB Output is correct
24 Correct 13 ms 248 KB Output is correct
25 Correct 13 ms 376 KB Output is correct
26 Correct 10 ms 320 KB Output is correct
27 Correct 19 ms 248 KB Output is correct
28 Correct 15 ms 380 KB Output is correct
29 Correct 16 ms 428 KB Output is correct
30 Correct 16 ms 376 KB Output is correct
31 Correct 33 ms 424 KB Output is correct
32 Correct 50 ms 504 KB Output is correct
33 Correct 65 ms 504 KB Output is correct
34 Correct 54 ms 636 KB Output is correct
35 Correct 68 ms 504 KB Output is correct
36 Correct 45 ms 604 KB Output is correct
37 Correct 63 ms 660 KB Output is correct
38 Correct 52 ms 608 KB Output is correct
39 Correct 73 ms 632 KB Output is correct
40 Correct 87 ms 632 KB Output is correct
41 Correct 58 ms 504 KB Output is correct
42 Correct 54 ms 504 KB Output is correct
43 Correct 33 ms 656 KB Output is correct
44 Correct 61 ms 504 KB Output is correct
45 Correct 78 ms 572 KB Output is correct
46 Correct 87 ms 524 KB Output is correct
47 Correct 74 ms 504 KB Output is correct
48 Correct 86 ms 524 KB Output is correct
49 Correct 80 ms 584 KB Output is correct
50 Correct 86 ms 552 KB Output is correct
51 Correct 40 ms 620 KB Output is correct
52 Correct 76 ms 632 KB Output is correct
53 Correct 79 ms 524 KB Output is correct
54 Correct 40 ms 580 KB Output is correct
55 Correct 41 ms 656 KB Output is correct
56 Correct 79 ms 508 KB Output is correct
57 Correct 77 ms 504 KB Output is correct
58 Correct 74 ms 680 KB Output is correct
59 Correct 78 ms 472 KB Output is correct
60 Correct 74 ms 600 KB Output is correct