oj.uz

답안 #492531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492531 2021-12-07T17:51:34 Z Jarif_Rahman Monster Game (JOI21_monster) C++17
87 / 100
 137 ms 4520 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;
    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 n0 = n;
    
    for(int i = 0; i < n0-1; i++){
        if(i == 0){
            auto s0 = win(sth[0]);
            if(s0.size() == 1){
                auto s1 = win(s0[0]);
                if(s1.size() == 1){
                    continue;
                }
            }
        }
        if(i != 0 && query(sth[i-1], sth[i])) continue;
        bool bl = 0;
        for(int j = i+2; j < n0; j++){
            if(query(sth[j], sth[j-2])){
                if((i == 0 && win(sth[j-1]).size() != 1) ||
                    (i != 0 && !query(sth[i-1], sth[j-1]))) 
                    reverse(sth.begin()+i, sth.begin()+j-1);
                else reverse(sth.begin()+i, sth.begin()+j);
                i = j-1;
                bl = 1;
                break;
            }
        }
        if(!bl){
            if((i == 0 && win(sth[n0-1]).size() != 1) ||
                (i != 0 && !query(sth[i-1], sth[n0-1])))
                reverse(sth.begin()+i, sth.begin()+n0-1);
            else reverse(sth.begin()+i, sth.begin()+n0);
            i = n0;
        }
    }

    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[sth[i]] = i;
    return ans;

}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 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 20 ms 456 KB Output is correct
17 Correct 19 ms 456 KB Output is correct
18 Correct 17 ms 456 KB Output is correct
19 Correct 19 ms 460 KB Output is correct
20 Correct 13 ms 460 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 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 15 ms 456 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 0 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 11 ms 468 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 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 20 ms 456 KB Output is correct
17 Correct 19 ms 456 KB Output is correct
18 Correct 17 ms 456 KB Output is correct
19 Correct 19 ms 460 KB Output is correct
20 Correct 13 ms 460 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 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 15 ms 456 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 0 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 11 ms 468 KB Output is correct
33 Correct 88 ms 4228 KB Output is correct
34 Correct 118 ms 4484 KB Output is correct
35 Correct 119 ms 4228 KB Output is correct
36 Correct 101 ms 4248 KB Output is correct
37 Correct 97 ms 4496 KB Output is correct
38 Correct 117 ms 4240 KB Output is correct
39 Correct 113 ms 4252 KB Output is correct
40 Correct 82 ms 4296 KB Output is correct
41 Correct 117 ms 4240 KB Output is correct
42 Correct 109 ms 4296 KB Output is correct
43 Correct 64 ms 4260 KB Output is correct
44 Correct 73 ms 4256 KB Output is correct

Subtask #3
62.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 121 ms 4224 KB Partially correct
2 Partially correct 106 ms 4276 KB Partially correct
3 Partially correct 123 ms 4248 KB Partially correct
4 Partially correct 125 ms 4288 KB Partially correct
5 Partially correct 94 ms 4376 KB Partially correct
6 Partially correct 93 ms 4288 KB Partially correct
7 Correct 94 ms 4252 KB Output is correct
8 Partially correct 93 ms 4232 KB Partially correct
9 Partially correct 109 ms 4296 KB Partially correct
10 Partially correct 106 ms 4376 KB Partially correct
11 Partially correct 137 ms 4364 KB Partially correct
12 Partially correct 100 ms 4376 KB Partially correct
13 Correct 102 ms 4292 KB Output is correct
14 Correct 96 ms 4288 KB Output is correct
15 Correct 73 ms 4252 KB Output is correct
16 Correct 74 ms 4168 KB Output is correct
17 Partially correct 98 ms 4520 KB Partially correct
18 Correct 67 ms 4288 KB Output is correct