oj.uz

Submission #876115

# Submission time Handle Problem Language Result Execution time Memory
876115 2023-11-21T09:26:22 Z green_gold_dog Monster Game (JOI21_monster) C++17
25 / 100
 133 ms 4404 KB 
#include<bits/stdc++.h>
#include "monster.h"

using namespace std;

#define al(a) a.begin(), a.end()

random_device rd;
mt19937 rnd(1);

typedef int ll;

map<pair<ll, ll>, bool> m;

bool query(ll a, ll b) {
        return (m.find(make_pair(a, b)) != m.end() ? m[make_pair(a, b)] : (m[make_pair(a, b)] = !(m[make_pair(b, a)] = Query(b, a))));
}

void s(vector<ll>& all) {
        if (all.size() <= 1) {
                return;
        }
        if (all.size() <= 40) {
                vector<pair<ll, ll>> now;
                map<ll, vector<ll>> big, sma;
                for (ll i = 0; i < all.size(); i++) {
                        ll cb = 0;
                        for (ll j = 0; j < all.size(); j++) {
                                if (i != j) {
                                        if (query(all[i], all[j])) {
                                                sma[all[i]].push_back(all[j]);
                                        } else {
                                                cb++;
                                                big[all[i]].push_back(all[j]);
                                        }
                                }
                        }
                        now.emplace_back(cb, all[i]);
                }
                sort(now.rbegin(), now.rend());
                if (sma[now[0].second].empty()) {
                        if (now.size() > 2 && find(al(sma[now[2].second]), now[1].second) != sma[now[2].second].end()) {
                                swap(now[1], now[2]);
                        }
                } else {
                        if (find(al(sma[now[1].second]), now[0].second) != sma[now[1].second].end()) {
                                swap(now[0], now[1]);
                        }
                }
                if (big[now[now.size() - 1].second].empty()) {
                        if (now.size() > 2 && find(al(big[now[now.size() - 3].second]), now[now.size() - 2].second) != big[now[now.size() - 3].second].end()) {
                                swap(now[now.size() - 2], now[now.size() - 3]);
                        }
                } else {
                        if (find(al(big[now[now.size() - 2].second]), now.back().second) != big[now[now.size() - 2].second].end()) {
                                swap(now[now.size() - 2], now.back());
                        }
                }
                for (ll i = 0; i < all.size(); i++) {
                        all[i] = now[i].second;
                }
                return;
        }
        ll x, now;
        vector<ll> sm, bi;
        do {
                x = rnd() % all.size();
                now = all[x];
                sm.clear();
                bi.clear();
                for (ll j = 0; j < all.size(); j++) {
                        if (j != x) {
                                if (query(now, all[j])) {
                                        sm.push_back(all[j]);
                                } else {
                                        bi.push_back(all[j]);
                                }
                        }
                }
        } while (sm.size() < 6 || bi.size() < 6);
        s(sm);
        s(bi);
        if (!sm.empty() && !bi.empty()) {
                swap(sm.back(), bi[0]);
        }
        all.clear();
        for (auto i : sm) {
                all.push_back(i);
        }
        all.push_back(now);
        for (auto i : bi) {
                all.push_back(i);
        }
}

vector<ll> Solve(ll n) {
        vector<ll> all;
        for (ll i = 0; i < n; i++) {
                all.push_back(i);
        }
        s(all);
        vector<ll> ans(n);
        for (ll i = 0; i < n; i++) {
                ans[all[i]] = i;
        }
        return ans;
}

Compilation message

monster.cpp: In function 'void s(std::vector<int>&)':
monster.cpp:26:34: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |                 for (ll i = 0; i < all.size(); i++) {
      |                                ~~^~~~~~~~~~~~
monster.cpp:28:42: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |                         for (ll j = 0; j < all.size(); j++) {
      |                                        ~~^~~~~~~~~~~~
monster.cpp:59:34: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |                 for (ll i = 0; i < all.size(); i++) {
      |                                ~~^~~~~~~~~~~~
monster.cpp:71:34: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |                 for (ll j = 0; j < all.size(); j++) {
      |                                ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 15 ms 768 KB Output is correct
17 Correct 17 ms 1724 KB Output is correct
18 Correct 15 ms 1252 KB Output is correct
19 Correct 14 ms 1112 KB Output is correct
20 Correct 16 ms 1264 KB Output is correct
21 Correct 0 ms 592 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 17 ms 908 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 600 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 15 ms 1112 KB Output is correct
33 Correct 100 ms 3968 KB Output is correct
34 Correct 94 ms 3908 KB Output is correct
35 Correct 110 ms 3144 KB Output is correct
36 Correct 117 ms 3448 KB Output is correct
37 Correct 104 ms 3076 KB Output is correct
38 Correct 106 ms 3592 KB Output is correct
39 Correct 110 ms 3924 KB Output is correct
40 Correct 110 ms 3680 KB Output is correct
41 Correct 100 ms 3128 KB Output is correct
42 Correct 109 ms 3032 KB Output is correct
43 Correct 104 ms 3772 KB Output is correct
44 Correct 92 ms 3268 KB Output is correct

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Partially correct 109 ms 3504 KB Partially correct
2 Partially correct 107 ms 3188 KB Partially correct
3 Partially correct 112 ms 3516 KB Partially correct
4 Partially correct 114 ms 3444 KB Partially correct
5 Partially correct 109 ms 3712 KB Partially correct
6 Partially correct 106 ms 3468 KB Partially correct
7 Partially correct 112 ms 3172 KB Partially correct
8 Partially correct 119 ms 3576 KB Partially correct
9 Partially correct 99 ms 3376 KB Partially correct
10 Partially correct 116 ms 3476 KB Partially correct
11 Partially correct 119 ms 3848 KB Partially correct
12 Partially correct 121 ms 3768 KB Partially correct
13 Incorrect 133 ms 4404 KB Wrong Answer [6]
14 Halted 0 ms 0 KB -