oj.uz

Submission #766160

# Submission time Handle Problem Language Result Execution time Memory
766160 2023-06-25T10:51:51 Z pandapythoner Monster Game (JOI21_monster) C++17
96 / 100
 91 ms 340 KB 
#include <bits/stdc++.h>

#include "monster.h"

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

mt19937 rnd(2342334);

int qcnt;

bool query(int a, int b) {
    qcnt += 1;
    return !Query(a, b);
}

vector<int> merge(vector<int> a, vector<int> b) {
    vector<int> c;
    int i = 0;
    int j = 0;
    while (i < (int)a.size() && j < (int)b.size()) {
        if (query(a[i], b[j])) {
            c.push_back(a[i]);
            i += 1;
        } else {
            c.push_back(b[j]);
            j += 1;
        }
    }
    while (i < (int)a.size()) {
        c.push_back(a[i]);
        i += 1;
    }
    while (j < (int)b.size()) {
        c.push_back(b[j]);
        j += 1;
    }
    return c;
}

vector<int> merge_sort(vector<int> a) {
    if (a.size() == 1) {
        return a;
    }
    int sz = (int)a.size();
    vector<int> x, y;
    for (int i = 0; i < sz; i += 1) {
        if (i < sz / 2) {
            x.push_back(a[i]);
        } else {
            y.push_back(a[i]);
        }
    }
    x = merge_sort(x);
    y = merge_sort(y);
    auto z = merge(x, y);
    return z;
}

vector<int> sort_aboba(vector<int> a) {
    vector<int> b = {a[0]};
    for (int i = 1; i < (int)a.size(); i += 1) {
        int l = -1;
        int r = (int)b.size();
        while (l + 1 < r) {
            int m = (l + r) / 2;
            if (query(b[m], a[i])) {
                l = m;
            } else {
                r = m;
            }
        }
        b.insert(b.begin() + r, a[i]);
    }
    return b;
}

vector<int> Solve(int n) {
    qcnt = 0;
    vector<int> t(n);
    for (int i = 0; i < n; i += 1) {
        t[i] = i;
    }
    shuffle(all(t), rnd);
    t = sort_aboba(t);
    if (query(t[0], t[n - 1])) {
        int x = -1;
        for (int i = n - 2; i >= 0; i -= 1) {
            if (!query(t[0], t[i])) {
                x = i;
                break;
            }
        }
        if (x == -1) {
            assert(0);
        }
        if (x == 1) {
            assert(0);
        }
        int fuck = -1;
        bool previous_was_1 = false;
        if (x == 2) {
            // assert(n <= 500);
            bool is_1_mx = false;
            int megaaboba = -1;
            for (int i = 3; i < n; i += 1) {
                if (!query(t[1], t[i])) {
                    megaaboba = i;
                    is_1_mx = true;
                    break;
                } else if (!query(t[2], t[i])) {
                    megaaboba = i;
                    break;
                }
            }
            if (is_1_mx) {
                swap(t[1], t[2]);
                reverse(t.begin() + 3, t.begin() + megaaboba + 1);
                fuck = megaaboba + 1;
            } else {
                swap(t[0], t[1]);
                reverse(t.begin() + 3, t.begin() + megaaboba + 1);
                fuck = megaaboba + 1;
            }
        } else {
            int m = x + 1;
            vector<int> q(m - 2);
            for (int i = 0; i < m - 2; i += 1) {
                q[i] = query(t[i], t[i + 2]);
            }
            int d = -1;
            for (int i = 0; i + 1 < m - 2; i += 1) {
                if (q[i] && q[i + 1]) {
                    d = i + 1;
                    break;
                }
            }
            if (d == -1) {
                if (q[0]) {
                    d = 0;
                } else if (q[m - 3]) {
                    d = m - 2;
                }
            }
            if (d == -1) {
                assert(0);
            } else {
                reverse(t.begin(), t.begin() + d + 1);
                reverse(t.begin() + d + 1, t.begin() + m);
            }
            fuck = m;
        }
        while (fuck < n) {
            int new_fuck = -1;
            for (int i = fuck + (int)previous_was_1; i < n; i += 1) {
                if (!query(t[fuck - 1], t[i])) {
                    new_fuck = i + 1;
                    break;
                }
            }
            if (new_fuck == -1) {
                assert(0);
            }
            reverse(t.begin() + fuck, t.begin() + new_fuck);
            previous_was_1 = ((new_fuck - fuck) == 1);
            fuck = new_fuck;
        }
    } else {
        vector<int> q(n - 2);
        for (int i = 0; i < n - 2; i += 1) {
            q[i] = query(t[i], t[i + 2]);
        }
        int d = -1;
        for (int i = 0; i + 1 < n - 2; i += 1) {
            if (q[i] && q[i + 1]) {
                d = i + 1;
                break;
            }
        }
        if (d == -1) {
            if (q[0]) {
                d = 0;
            } else if (q[n - 3]) {
                d = n - 2;
            }
        }
        if (d == -1) {
            reverse(all(t));
        } else {
            reverse(t.begin(), t.begin() + d + 1);
            reverse(t.begin() + d + 1, t.end());
        }
    }
    vector<int> p(n);
    for (int i = 0; i < n; i += 1) {
        p[t[i]] = i;
    }
    return p;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 11 ms 208 KB Output is correct
17 Correct 13 ms 208 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 10 ms 208 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 14 ms 304 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 11 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 0 ms 208 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 11 ms 208 KB Output is correct
17 Correct 13 ms 208 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 10 ms 208 KB Output is correct
20 Correct 17 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 0 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 14 ms 304 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 11 ms 208 KB Output is correct
33 Correct 89 ms 208 KB Output is correct
34 Correct 80 ms 296 KB Output is correct
35 Correct 89 ms 296 KB Output is correct
36 Correct 85 ms 208 KB Output is correct
37 Correct 55 ms 292 KB Output is correct
38 Correct 74 ms 296 KB Output is correct
39 Correct 79 ms 208 KB Output is correct
40 Correct 52 ms 208 KB Output is correct
41 Correct 46 ms 300 KB Output is correct
42 Correct 85 ms 208 KB Output is correct
43 Correct 62 ms 208 KB Output is correct
44 Correct 84 ms 300 KB Output is correct

Subtask #3
71.0 / 75.0

# Verdict Execution time Memory Grader output
1 Partially correct 63 ms 296 KB Partially correct
2 Partially correct 85 ms 208 KB Partially correct
3 Partially correct 59 ms 292 KB Partially correct
4 Partially correct 82 ms 208 KB Partially correct
5 Partially correct 61 ms 308 KB Partially correct
6 Partially correct 62 ms 208 KB Partially correct
7 Partially correct 87 ms 308 KB Partially correct
8 Partially correct 76 ms 308 KB Partially correct
9 Partially correct 89 ms 208 KB Partially correct
10 Partially correct 69 ms 312 KB Partially correct
11 Partially correct 63 ms 208 KB Partially correct
12 Partially correct 78 ms 296 KB Partially correct
13 Partially correct 46 ms 208 KB Partially correct
14 Partially correct 33 ms 340 KB Partially correct
15 Partially correct 74 ms 292 KB Partially correct
16 Partially correct 84 ms 316 KB Partially correct
17 Partially correct 91 ms 208 KB Partially correct
18 Partially correct 63 ms 208 KB Partially correct