제출 #951842

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
951842	2024-03-22 20:08:57	arbuzick	Monster Game (JOI21_monster)	C++17	100 / 100	71 ms	2708 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>
using namespace std;
map<pair<int, int>, bool> mp;
bool query(int i, int j) {
    if (mp.count({i, j})) {
        return mp[{i, j}];
    }
    mp[{i, j}] = Query(i, j);
    mp[{j, i}] = !mp[{i, j}];
    return mp[{i, j}];
}
vector<int> my_sort(vector<int> nw) {
    map<pair<int, int>, int> vl;
    map<int, int> cnt;
    for (int i = 0; i < (int)nw.size(); ++i) {
        for (int j = i + 1; j < (int)nw.size(); ++j) {
            if (query(nw[i], nw[j])) {
                vl[{nw[i], nw[j]}] = 1;
                cnt[nw[i]]++;
            } else {
                vl[{nw[j], nw[i]}] = 1;
                cnt[nw[j]]++;
            }
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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