oj.uz

Submission #804255

# Submission time Handle Problem Language Result Execution time Memory
804255 2023-08-03T07:41:17 Z fatemetmhr Monster Game (JOI21_monster) C++17
25 / 100
 289 ms 4304 KB 
//  ~ Be Name Khoda ~  //

#include "monster.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  1e3   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   + 7;
const ll  inf   =  1e18;

namespace {

int a[maxn5], cnt[maxn5], done[maxn5][maxn5];

bool assk(int a, int b){
    if(done[a][b] == -1){
        done[a][b] = Query(a, b);
        done[b][a] = done[a][b] ^ 1;
    }
    return done[a][b];
}

bool cmp(int i, int j){return cnt[i] < cnt[j] || (cnt[i] == cnt[j] && assk(i, j));}


}  // namespace

std::vector<int> Solve(int n) {
    std::vector<int> ret(n);

    memset(done, -1, sizeof done);

    for(int i = 1; i < n; i++){
        int lo = -1, hi = i;
        while(hi - lo > 1){
            int mid = (lo + hi) >> 1;
            if(assk(a[mid], i))
                hi = mid;
            else
                lo = mid;
        }
        cnt[i] = lo + 1;
        for(int j = hi; j < i; j++)
            cnt[a[j]]++;
        for(int j = max(0, lo - 10); j < lo; j++) if(!assk(i, a[j])){
            cnt[a[j]]++;
            cnt[i]--;
            //cout << "ha? " << i << ' ' << j << ' ' << a[j] << endl;
        }
        for(int j = hi + 1; j < min(i, hi + 11); j++) if(assk(i, a[j])){
            cnt[a[j]]--;
            cnt[i]++;
        }
        //cout << "* " << i << ' ' << lo << ' ' << hi << ' ' << cnt[i] << ' ' << cnt[0] << endl;
        a[i] = i;
        sort(a, a + i + 1, cmp);
    }
    /*
    for(int i = 0; i < n; i++)
        cout << a[i] << ' ' << cnt[a[i]] << endl;
    cout << endl;
    //*/

    for (int i = 0; i < n; i++)
        ret[a[i]] = i;

    return ret;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4176 KB Output is correct
2 Correct 2 ms 4176 KB Output is correct
3 Correct 2 ms 4176 KB Output is correct
4 Correct 2 ms 4296 KB Output is correct
5 Correct 3 ms 4296 KB Output is correct
6 Correct 2 ms 4176 KB Output is correct
7 Correct 3 ms 4176 KB Output is correct
8 Correct 2 ms 4176 KB Output is correct
9 Correct 2 ms 4292 KB Output is correct
10 Correct 2 ms 4176 KB Output is correct
11 Correct 2 ms 4220 KB Output is correct
12 Correct 3 ms 4176 KB Output is correct
13 Correct 2 ms 4288 KB Output is correct
14 Correct 3 ms 4176 KB Output is correct
15 Correct 2 ms 4176 KB Output is correct
16 Correct 35 ms 4176 KB Output is correct
17 Correct 36 ms 4176 KB Output is correct
18 Correct 32 ms 4176 KB Output is correct
19 Correct 29 ms 4176 KB Output is correct
20 Correct 38 ms 4176 KB Output is correct
21 Correct 2 ms 4176 KB Output is correct
22 Correct 2 ms 4176 KB Output is correct
23 Correct 2 ms 4304 KB Output is correct
24 Correct 2 ms 4292 KB Output is correct
25 Correct 2 ms 4176 KB Output is correct
26 Correct 25 ms 4300 KB Output is correct
27 Correct 2 ms 4292 KB Output is correct
28 Correct 2 ms 4176 KB Output is correct
29 Correct 2 ms 4296 KB Output is correct
30 Correct 2 ms 4176 KB Output is correct
31 Correct 2 ms 4176 KB Output is correct
32 Correct 12 ms 4176 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4176 KB Output is correct
2 Correct 2 ms 4176 KB Output is correct
3 Correct 2 ms 4176 KB Output is correct
4 Correct 2 ms 4296 KB Output is correct
5 Correct 3 ms 4296 KB Output is correct
6 Correct 2 ms 4176 KB Output is correct
7 Correct 3 ms 4176 KB Output is correct
8 Correct 2 ms 4176 KB Output is correct
9 Correct 2 ms 4292 KB Output is correct
10 Correct 2 ms 4176 KB Output is correct
11 Correct 2 ms 4220 KB Output is correct
12 Correct 3 ms 4176 KB Output is correct
13 Correct 2 ms 4288 KB Output is correct
14 Correct 3 ms 4176 KB Output is correct
15 Correct 2 ms 4176 KB Output is correct
16 Correct 35 ms 4176 KB Output is correct
17 Correct 36 ms 4176 KB Output is correct
18 Correct 32 ms 4176 KB Output is correct
19 Correct 29 ms 4176 KB Output is correct
20 Correct 38 ms 4176 KB Output is correct
21 Correct 2 ms 4176 KB Output is correct
22 Correct 2 ms 4176 KB Output is correct
23 Correct 2 ms 4304 KB Output is correct
24 Correct 2 ms 4292 KB Output is correct
25 Correct 2 ms 4176 KB Output is correct
26 Correct 25 ms 4300 KB Output is correct
27 Correct 2 ms 4292 KB Output is correct
28 Correct 2 ms 4176 KB Output is correct
29 Correct 2 ms 4296 KB Output is correct
30 Correct 2 ms 4176 KB Output is correct
31 Correct 2 ms 4176 KB Output is correct
32 Correct 12 ms 4176 KB Output is correct
33 Correct 186 ms 4176 KB Output is correct
34 Correct 180 ms 4176 KB Output is correct
35 Correct 232 ms 4296 KB Output is correct
36 Correct 179 ms 4176 KB Output is correct
37 Correct 242 ms 4176 KB Output is correct
38 Correct 230 ms 4304 KB Output is correct
39 Correct 134 ms 4176 KB Output is correct
40 Correct 214 ms 4176 KB Output is correct
41 Correct 260 ms 4176 KB Output is correct
42 Correct 135 ms 4272 KB Output is correct
43 Correct 125 ms 4176 KB Output is correct
44 Correct 199 ms 4268 KB Output is correct

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Partially correct 171 ms 4176 KB Partially correct
2 Partially correct 188 ms 4304 KB Partially correct
3 Partially correct 289 ms 4176 KB Partially correct
4 Partially correct 223 ms 4304 KB Partially correct
5 Partially correct 220 ms 4304 KB Partially correct
6 Incorrect 208 ms 4284 KB Wrong Answer [6]
7 Halted 0 ms 0 KB -