oj.uz

Submission #441930

# Submission time Handle Problem Language Result Execution time Memory
441930 2021-07-06T14:58:28 Z wiwiho Dungeons Game (IOI21_dungeons) C++17
100 / 100
 5073 ms 1915568 KB 
#include "dungeons.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

struct info{
    int go = 0;
    ll add = 0;
    int mn = MAX;
};

int n;
vector<int> s, p, w, l;
vector<vector<vector<info>>> dp;
int SZ = 25;
int SZ2 = 7;

void init(int _n, vector<int> _s, vector<int> _p, vector<int> _w, vector<int> _l){
    n = _n;
    s = _s;
    p = _p;
    w = _w;
    l = _l;
    s.eb(0);
    p.eb(0);
    w.eb(n);
    l.eb(n);
    dp.resize(SZ2, vector<vector<info>>(SZ, vector<info>(n + 1)));

    for(int i = 0; i < SZ2; i++){
        for(int k = 0; k <= n; k++){
            if(s[k] < (1 << (4 * i))){
                dp[i][0][k].go = w[k];
                dp[i][0][k].add = s[k];
            }
            else{
                dp[i][0][k].go = l[k];
                dp[i][0][k].add = p[k];
                dp[i][0][k].mn = s[k];
            }
        }
    }

    for(int i = 0; i < SZ2; i++){
        for(int j = 1; j < SZ; j++){
            for(int k = 0; k <= n; k++){
                dp[i][j][k].go = dp[i][j - 1][dp[i][j - 1][k].go].go;
                dp[i][j][k].add = dp[i][j - 1][k].add + dp[i][j - 1][dp[i][j - 1][k].go].add;
                ll tmp = dp[i][j - 1][dp[i][j - 1][k].go].mn;
                if(tmp < MAX) tmp -= dp[i][j - 1][k].add;
                dp[i][j][k].mn = min(dp[i][j - 1][k].mn, (int)max(0LL, tmp));
            }
        }
    }
}

ll simulate(int x, int _z){
    ll z = _z;
//    cerr << "query " << x << " " << z << "\n";

    while(x != n){
//        cerr << "test " << x << " " << z << "\n";
        int lg = min(SZ2 - 1, (int)__lg(z) / 4);
        for(int i = SZ - 1; i >= 0; i--){
            if(dp[lg][i][x].mn < MAX && dp[lg][i][x].mn <= z) continue;
            z += dp[lg][i][x].add;
            x = dp[lg][i][x].go;
        }
        z += s[x];
        x = w[x];
//        cerr << "ok " << x << " " << z << "\n";
    }

    return z;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 8 ms 9804 KB Output is correct
4 Correct 200 ms 238760 KB Output is correct
5 Correct 8 ms 9768 KB Output is correct
6 Correct 198 ms 238668 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5068 KB Output is correct
2 Correct 1634 ms 1912816 KB Output is correct
3 Correct 1655 ms 1913068 KB Output is correct
4 Correct 1608 ms 1912980 KB Output is correct
5 Correct 1761 ms 1913152 KB Output is correct
6 Correct 1823 ms 1913176 KB Output is correct
7 Correct 1748 ms 1912988 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5068 KB Output is correct
2 Correct 350 ms 239396 KB Output is correct
3 Correct 298 ms 239408 KB Output is correct
4 Correct 228 ms 239400 KB Output is correct
5 Correct 230 ms 239412 KB Output is correct
6 Correct 367 ms 239452 KB Output is correct
7 Correct 347 ms 239444 KB Output is correct
8 Correct 246 ms 239412 KB Output is correct
9 Correct 263 ms 239420 KB Output is correct
10 Correct 252 ms 239412 KB Output is correct
11 Correct 263 ms 239456 KB Output is correct
12 Correct 371 ms 239412 KB Output is correct
13 Correct 294 ms 239412 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5068 KB Output is correct
2 Correct 350 ms 239396 KB Output is correct
3 Correct 298 ms 239408 KB Output is correct
4 Correct 228 ms 239400 KB Output is correct
5 Correct 230 ms 239412 KB Output is correct
6 Correct 367 ms 239452 KB Output is correct
7 Correct 347 ms 239444 KB Output is correct
8 Correct 246 ms 239412 KB Output is correct
9 Correct 263 ms 239420 KB Output is correct
10 Correct 252 ms 239412 KB Output is correct
11 Correct 263 ms 239456 KB Output is correct
12 Correct 371 ms 239412 KB Output is correct
13 Correct 294 ms 239412 KB Output is correct
14 Correct 5 ms 5068 KB Output is correct
15 Correct 252 ms 239416 KB Output is correct
16 Correct 338 ms 239448 KB Output is correct
17 Correct 262 ms 239444 KB Output is correct
18 Correct 244 ms 239440 KB Output is correct
19 Correct 348 ms 239408 KB Output is correct
20 Correct 283 ms 239412 KB Output is correct
21 Correct 306 ms 239380 KB Output is correct
22 Correct 364 ms 239388 KB Output is correct
23 Correct 256 ms 239540 KB Output is correct
24 Correct 368 ms 239420 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5068 KB Output is correct
2 Correct 350 ms 239396 KB Output is correct
3 Correct 298 ms 239408 KB Output is correct
4 Correct 228 ms 239400 KB Output is correct
5 Correct 230 ms 239412 KB Output is correct
6 Correct 367 ms 239452 KB Output is correct
7 Correct 347 ms 239444 KB Output is correct
8 Correct 246 ms 239412 KB Output is correct
9 Correct 263 ms 239420 KB Output is correct
10 Correct 252 ms 239412 KB Output is correct
11 Correct 263 ms 239456 KB Output is correct
12 Correct 371 ms 239412 KB Output is correct
13 Correct 294 ms 239412 KB Output is correct
14 Correct 5 ms 5068 KB Output is correct
15 Correct 252 ms 239416 KB Output is correct
16 Correct 338 ms 239448 KB Output is correct
17 Correct 262 ms 239444 KB Output is correct
18 Correct 244 ms 239440 KB Output is correct
19 Correct 348 ms 239408 KB Output is correct
20 Correct 283 ms 239412 KB Output is correct
21 Correct 306 ms 239380 KB Output is correct
22 Correct 364 ms 239388 KB Output is correct
23 Correct 256 ms 239540 KB Output is correct
24 Correct 368 ms 239420 KB Output is correct
25 Correct 207 ms 238640 KB Output is correct
26 Correct 301 ms 239412 KB Output is correct
27 Correct 262 ms 239452 KB Output is correct
28 Correct 261 ms 239472 KB Output is correct
29 Correct 333 ms 239412 KB Output is correct
30 Correct 286 ms 239408 KB Output is correct
31 Correct 315 ms 239412 KB Output is correct
32 Correct 394 ms 239456 KB Output is correct
33 Correct 1388 ms 239368 KB Output is correct
34 Correct 1578 ms 239448 KB Output is correct
35 Correct 1809 ms 239428 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5068 KB Output is correct
2 Correct 1634 ms 1912816 KB Output is correct
3 Correct 1655 ms 1913068 KB Output is correct
4 Correct 1608 ms 1912980 KB Output is correct
5 Correct 1761 ms 1913152 KB Output is correct
6 Correct 1823 ms 1913176 KB Output is correct
7 Correct 1748 ms 1912988 KB Output is correct
8 Correct 5 ms 5068 KB Output is correct
9 Correct 350 ms 239396 KB Output is correct
10 Correct 298 ms 239408 KB Output is correct
11 Correct 228 ms 239400 KB Output is correct
12 Correct 230 ms 239412 KB Output is correct
13 Correct 367 ms 239452 KB Output is correct
14 Correct 347 ms 239444 KB Output is correct
15 Correct 246 ms 239412 KB Output is correct
16 Correct 263 ms 239420 KB Output is correct
17 Correct 252 ms 239412 KB Output is correct
18 Correct 263 ms 239456 KB Output is correct
19 Correct 371 ms 239412 KB Output is correct
20 Correct 294 ms 239412 KB Output is correct
21 Correct 5 ms 5068 KB Output is correct
22 Correct 252 ms 239416 KB Output is correct
23 Correct 338 ms 239448 KB Output is correct
24 Correct 262 ms 239444 KB Output is correct
25 Correct 244 ms 239440 KB Output is correct
26 Correct 348 ms 239408 KB Output is correct
27 Correct 283 ms 239412 KB Output is correct
28 Correct 306 ms 239380 KB Output is correct
29 Correct 364 ms 239388 KB Output is correct
30 Correct 256 ms 239540 KB Output is correct
31 Correct 368 ms 239420 KB Output is correct
32 Correct 207 ms 238640 KB Output is correct
33 Correct 301 ms 239412 KB Output is correct
34 Correct 262 ms 239452 KB Output is correct
35 Correct 261 ms 239472 KB Output is correct
36 Correct 333 ms 239412 KB Output is correct
37 Correct 286 ms 239408 KB Output is correct
38 Correct 315 ms 239412 KB Output is correct
39 Correct 394 ms 239456 KB Output is correct
40 Correct 1388 ms 239368 KB Output is correct
41 Correct 1578 ms 239448 KB Output is correct
42 Correct 1809 ms 239428 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 5 ms 5068 KB Output is correct
45 Correct 1932 ms 1915560 KB Output is correct
46 Correct 1722 ms 1915388 KB Output is correct
47 Correct 1655 ms 1915388 KB Output is correct
48 Correct 1655 ms 1915480 KB Output is correct
49 Correct 1982 ms 1915460 KB Output is correct
50 Correct 1633 ms 1915360 KB Output is correct
51 Correct 1591 ms 1915480 KB Output is correct
52 Correct 1601 ms 1915376 KB Output is correct
53 Correct 2680 ms 1915472 KB Output is correct
54 Correct 3280 ms 1915472 KB Output is correct
55 Correct 3403 ms 1915364 KB Output is correct
56 Correct 4904 ms 1915568 KB Output is correct
57 Correct 3387 ms 1915464 KB Output is correct
58 Correct 4192 ms 1915408 KB Output is correct
59 Correct 3671 ms 1915468 KB Output is correct
60 Correct 4960 ms 1915464 KB Output is correct
61 Correct 5073 ms 1915540 KB Output is correct