oj.uz

Submission #492690

# Submission time Handle Problem Language Result Execution time Memory
492690 2021-12-08T12:27:24 Z Jarif_Rahman Monster Game (JOI21_monster) C++17
100 / 100
 107 ms 4408 KB 
#include "monster.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
 
#ifdef LOCAL
#define debug(v) for(auto x: v) cerr << x << " "; cerr << #v << "\n";
#endif
 
vector<vector<int>> QQ;
bool query(int a, int b){
    if(a > b){
        if(QQ[b][a] == -1) QQ[b][a] = Query(b, a);
        return !QQ[b][a];
    }
    else{
        if(QQ[a][b] == -1) QQ[a][b] = Query(a, b);
        return QQ[a][b];
    }
}
 
template<typename it>
void merge_sort(it a, it b){
    int n = b-a;
    if(n == 1) return;
    merge_sort(a, a+n/2);
    merge_sort(a+n/2, b);
    int* ab = new int[n];
    merge(a, a+n/2, a+n/2, b, ab, [&](int x, int y){
        return query(y, x);
    });
    for(int i = 0; i < n; i++) *(a+i) = *(ab+i);
}
 
vector<int> Solve(int n){
    QQ = vector<vector<int>>(n, vector<int>(n, -1));
 
    vector<int> sth(n);
    for(int i = 0; i < n; i++) sth[i] = i;
    random_shuffle(sth.begin(), sth.end());
    merge_sort(sth.begin(), sth.end());
 
    auto win = [=](int x){
        vector<int> rt;
        for(int i = 0; i < n; i++) if(i != x && query(x, i)) rt.pb(i);
        return rt;
    };

    int z = -1, k = min(n, 10);
    vector<int> cnt(k, 0), ss(k);
    for(int i = 0; i < k; i++) ss[i] = i;
    for(int i = 0; i < k; i++){
        for(int j = 0; j < k; j++) if(i != j) cnt[i]+=query(sth[i], sth[j]);
    }

    sort(ss.begin(), ss.end(), [&](int x, int y){
        return cnt[x] < cnt[y];
    });
    if(query(sth[ss[0]], sth[ss[1]])) z = ss[0];
    else z = ss[1];

    reverse(sth.begin(), sth.begin()+z+1);

    for(;z+1 < n; z++){
        for(int i = z+1; i < n; i++) if(query(sth[z], sth[i])){
            reverse(sth.begin()+z+1, sth.begin()+i+1);
            z = i;
        }
    }
 
    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[sth[i]] = i;
    return ans;
}

Compilation message

monster.cpp: In function 'std::vector<int> Solve(int)':
monster.cpp:47:10: warning: variable 'win' set but not used [-Wunused-but-set-variable]
   47 |     auto win = [=](int x){
      |          ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 16 ms 456 KB Output is correct
17 Correct 10 ms 460 KB Output is correct
18 Correct 14 ms 456 KB Output is correct
19 Correct 15 ms 468 KB Output is correct
20 Correct 11 ms 456 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 10 ms 456 KB Output is correct
27 Correct 0 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 0 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 17 ms 460 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 0 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 16 ms 456 KB Output is correct
17 Correct 10 ms 460 KB Output is correct
18 Correct 14 ms 456 KB Output is correct
19 Correct 15 ms 468 KB Output is correct
20 Correct 11 ms 456 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 1 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 10 ms 456 KB Output is correct
27 Correct 0 ms 200 KB Output is correct
28 Correct 2 ms 200 KB Output is correct
29 Correct 0 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 17 ms 460 KB Output is correct
33 Correct 79 ms 4336 KB Output is correct
34 Correct 74 ms 4240 KB Output is correct
35 Correct 81 ms 4216 KB Output is correct
36 Correct 88 ms 4248 KB Output is correct
37 Correct 89 ms 4280 KB Output is correct
38 Correct 97 ms 4408 KB Output is correct
39 Correct 99 ms 4252 KB Output is correct
40 Correct 95 ms 4248 KB Output is correct
41 Correct 97 ms 4372 KB Output is correct
42 Correct 95 ms 4252 KB Output is correct
43 Correct 88 ms 4288 KB Output is correct
44 Correct 107 ms 4248 KB Output is correct

Subtask #3
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 4268 KB Output is correct
2 Correct 100 ms 4404 KB Output is correct
3 Correct 104 ms 4248 KB Output is correct
4 Correct 83 ms 4304 KB Output is correct
5 Correct 86 ms 4272 KB Output is correct
6 Correct 49 ms 4288 KB Output is correct
7 Correct 62 ms 4252 KB Output is correct
8 Correct 104 ms 4240 KB Output is correct
9 Correct 98 ms 4280 KB Output is correct
10 Correct 82 ms 4272 KB Output is correct
11 Correct 73 ms 4392 KB Output is correct
12 Correct 81 ms 4392 KB Output is correct
13 Correct 83 ms 4376 KB Output is correct
14 Correct 76 ms 4372 KB Output is correct
15 Correct 51 ms 4288 KB Output is correct
16 Correct 54 ms 4256 KB Output is correct
17 Correct 94 ms 4284 KB Output is correct
18 Correct 24 ms 4260 KB Output is correct