oj.uz

답안 #679830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679830 2023-01-09T11:43:02 Z bashkort Monster Game (JOI21_monster) C++17
100 / 100
 128 ms 312 KB 
#include "monster.h"
#include <bits/stdc++.h>

using namespace std;

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

//    mt19937 rnd(228);
//    shuffle(ord.begin(), ord.end(), rnd);

    auto merge_sort = [&](auto self, vector<int> a) -> vector<int> {
        if (a.size() == 1) {
            return a;
        }
        int mid = a.size() / 2;
        auto L = self(self, vector(a.begin(), a.begin() + mid));
        auto R = self(self, vector(a.begin() + mid, a.end()));
        a.clear();
        int i = 0, j = 0;
        while (i < L.size() || j < R.size()) {
            if (i < L.size() && (j == R.size() || !Query(L[i], R[j]))) {
                a.push_back(L[i++]);
            } else {
                a.push_back(R[j++]);
            }
        }
        return a;
    };

    ord = merge_sort(merge_sort, ord);

    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();
    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;
        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;
}

Compilation message

monster.cpp: In instantiation of 'Solve(int)::<lambda(auto:23, std::vector<int>)> [with auto:23 = Solve(int)::<lambda(auto:23, std::vector<int>)>]':
monster.cpp:32:37:   required from here
monster.cpp:22:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         while (i < L.size() || j < R.size()) {
      |                ~~^~~~~~~~~~
monster.cpp:22:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         while (i < L.size() || j < R.size()) {
      |                                ~~^~~~~~~~~~
monster.cpp:23:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             if (i < L.size() && (j == R.size() || !Query(L[i], R[j]))) {
      |                 ~~^~~~~~~~~~
monster.cpp:23:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             if (i < L.size() && (j == R.size() || !Query(L[i], R[j]))) {
      |                                  ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 1 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 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 14 ms 208 KB Output is correct
17 Correct 14 ms 208 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 13 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 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 10 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 1 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 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 14 ms 208 KB Output is correct
17 Correct 14 ms 208 KB Output is correct
18 Correct 14 ms 208 KB Output is correct
19 Correct 11 ms 208 KB Output is correct
20 Correct 13 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 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 10 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 0 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 78 ms 288 KB Output is correct
34 Correct 70 ms 312 KB Output is correct
35 Correct 66 ms 296 KB Output is correct
36 Correct 72 ms 208 KB Output is correct
37 Correct 90 ms 292 KB Output is correct
38 Correct 78 ms 208 KB Output is correct
39 Correct 82 ms 296 KB Output is correct
40 Correct 64 ms 208 KB Output is correct
41 Correct 79 ms 208 KB Output is correct
42 Correct 90 ms 208 KB Output is correct
43 Correct 37 ms 296 KB Output is correct
44 Correct 46 ms 288 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 208 KB Output is correct
2 Correct 90 ms 292 KB Output is correct
3 Correct 128 ms 288 KB Output is correct
4 Correct 88 ms 292 KB Output is correct
5 Correct 82 ms 296 KB Output is correct
6 Correct 80 ms 292 KB Output is correct
7 Correct 64 ms 288 KB Output is correct
8 Correct 77 ms 208 KB Output is correct
9 Correct 94 ms 208 KB Output is correct
10 Correct 87 ms 292 KB Output is correct
11 Correct 75 ms 208 KB Output is correct
12 Correct 95 ms 208 KB Output is correct
13 Correct 76 ms 208 KB Output is correct
14 Correct 82 ms 292 KB Output is correct
15 Correct 43 ms 208 KB Output is correct
16 Correct 51 ms 308 KB Output is correct
17 Correct 81 ms 288 KB Output is correct
18 Correct 45 ms 292 KB Output is correct