oj.uz

Submission #679826

# Submission time Handle Problem Language Result Execution time Memory
679826 2023-01-09T11:37:44 Z bashkort Monster Game (JOI21_monster) C++17
95 / 100
 106 ms 328 KB 
#include "monster.h"
#include <bits/stdc++.h>

using namespace std;

mt19937 rnd(228);

vector<int> Solve(int n) {
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 0);

    shuffle(ord.begin(), ord.end(), rnd);
    
    stable_sort(ord.begin(), ord.end(), [&](int i, int j) {
        return !Query(i, j);
    });

    int k = min(n, 10);

    vector<int> win(k);

    for (int i = 0; i < k; ++i) {
        for (int j = i + 1; j < k; ++j) {
            if (Query(ord[i], ord[j])) {
                win[i] += 1;
            } else {
                win[j] += 1;
            }
        }
    }

    int fi = min_element(win.begin(), win.end()) - win.begin();
    assert(win.begin() + fi != win.end());
    int se = min_element(win.begin() + fi + 1, win.end()) - win.begin();

    int x = Query(ord[fi], ord[se]) ? fi : se;

    rotate(ord.begin(), ord.begin() + x, ord.begin() + x + 1);

    x = 0;

    for (int i = 1, j = 1; i < n; i = j) {
        while (Query(ord[j], ord[x])) {
            j += 1;
        }

        j += 1;
        reverse(ord.begin() + i, ord.begin() + j);

        x = j - 1;
    }

    vector<int> ans(n);
    for (int i = 0; i < n; ++i) {
        ans[ord[i]] = i;
    }

    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 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 1 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 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 220 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 12 ms 208 KB Output is correct
18 Correct 11 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 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 8 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 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 9 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 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 1 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 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 220 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 8 ms 208 KB Output is correct
17 Correct 12 ms 208 KB Output is correct
18 Correct 11 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 11 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 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 8 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 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 9 ms 208 KB Output is correct
33 Correct 74 ms 208 KB Output is correct
34 Correct 92 ms 296 KB Output is correct
35 Correct 99 ms 292 KB Output is correct
36 Correct 89 ms 292 KB Output is correct
37 Correct 84 ms 292 KB Output is correct
38 Correct 78 ms 292 KB Output is correct
39 Correct 63 ms 220 KB Output is correct
40 Correct 51 ms 292 KB Output is correct
41 Correct 88 ms 288 KB Output is correct
42 Correct 89 ms 292 KB Output is correct
43 Correct 93 ms 208 KB Output is correct
44 Correct 72 ms 292 KB Output is correct

Subtask #3
70.0 / 75.0

# Verdict Execution time Memory Grader output
1 Partially correct 94 ms 312 KB Partially correct
2 Partially correct 90 ms 288 KB Partially correct
3 Partially correct 91 ms 292 KB Partially correct
4 Partially correct 73 ms 328 KB Partially correct
5 Partially correct 66 ms 208 KB Partially correct
6 Correct 75 ms 328 KB Output is correct
7 Correct 69 ms 288 KB Output is correct
8 Partially correct 88 ms 292 KB Partially correct
9 Partially correct 88 ms 300 KB Partially correct
10 Partially correct 95 ms 296 KB Partially correct
11 Partially correct 96 ms 312 KB Partially correct
12 Partially correct 106 ms 292 KB Partially correct
13 Partially correct 80 ms 288 KB Partially correct
14 Partially correct 89 ms 292 KB Partially correct
15 Correct 57 ms 288 KB Output is correct
16 Correct 60 ms 208 KB Output is correct
17 Partially correct 78 ms 288 KB Partially correct
18 Correct 54 ms 288 KB Output is correct