제출 #502070

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
502070	2022-01-05 08:21:16	tengiz05	Monster Game (JOI21_monster)	C++17	100 / 100	111 ms	292 KiB

monster

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "monster.h"
#include <bits/stdc++.h>
namespace {
    std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
    std::vector<int> sort(std::vector<int> a) {
        if (a.size() == 1) {
            return a;
        }
        int m = a.size() / 2;
        std::shuffle(a.begin(), a.end(), rnd);
        std::vector<int> l(a.begin(), a.begin() + m), r(a.begin() + m, a.end());
        l = sort(l);
        r = sort(r);
        int i = 0, j = 0;
        for (int k = 0; k < int(a.size()); k++) {
            if (i == int(l.size())) {
                a[k] = r[j++];
            } else if (j == int(r.size())) {
                a[k] = l[i++];
            } else if (Query(l[i], r[j])) {
                a[k] = r[j++];
            } else {
                a[k] = l[i++];
            }
        }
        return a;
    }
    std::vector<int> slow(std::vector<int> a) {
        int n = a.size();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 75 / 75