oj.uz

Submission #488161

# Submission time Handle Problem Language Result Execution time Memory
488161 2021-11-18T04:17:31 Z yungyao Dungeons Game (IOI21_dungeons) C++17
25 / 100
 203 ms 115432 KB 
using namespace std;
#pragma GCC optimize("Ofast")
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <set>
#include <map>

typedef long long LL;
typedef pair<int,int> pii;
#define F first
#define S second
#define pb push_back
#define mkp make_pair
#define iter(x) x.begin() x.end()
#define REP(n) for (int __=n;__--;)
#define REP0(i,n) for (int i=0;i<n;++i)
#define REP1(i,n) for (int i=1;i<=n;++i)

const int maxn = 5e4+200,mod = 0;
const LL inf = 1e9;

pair <int,LL> go[6][maxn][24];
map <int,int> mp;
LL imp[maxn];
int N,c = 0;
void init(int n,vector <int> s,vector <int> p,vector <int> w,vector <int> l){
    N = n;
    for (auto &x:s) mp[x] = 0;
    for (auto &[x,d]:mp){
        imp[++c] = x;
        d = c;
    }
    imp[++c] = 1e18;
    REP0(k,c) REP0(i,24){
        go[k][n][i] = mkp(n,0);
    }
    REP0(k,c) REP0(i,n){
        if (imp[k] >= s[i]) go[k][i][0] = mkp(w[i], s[i]);
        else go[k][i][0] = mkp(l[i], p[i]);
    }
    REP0(k,c) REP1(j,23) REP0(i,n){
        go[k][i][j] = mkp(go[k][go[k][i][j-1].F][j-1].F,
                          go[k][i][j-1].S + go[k][go[k][i][j-1].F][j-1].S);
    }

    //REP0(i,n)REP0(j,24) cout << go[c-1][i][j].F << ',' << go[c-1][i][j].S << ' ';cout << '\n';
}

LL simulate(int x,int is){
    LL z = is;

    REP0(k,c){
        if (z >= imp[k+1]) continue;
        for (int i=24;i--;) if (z + go[k][x][i].S < imp[k+1] and go[k][x][i].F != N){
            z += go[k][x][i].S;
            x = go[k][x][i].F;
        }

        z += go[k][x][0].S;
        x = go[k][x][0].F;
        if (x == N) return z;
    }
    return z;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 3 ms 460 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 716 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 74 ms 40112 KB Output is correct
3 Correct 95 ms 40132 KB Output is correct
4 Correct 79 ms 40156 KB Output is correct
5 Correct 76 ms 40116 KB Output is correct
6 Correct 78 ms 40156 KB Output is correct
7 Correct 84 ms 40140 KB Output is correct
8 Correct 92 ms 40232 KB Output is correct
9 Correct 72 ms 40156 KB Output is correct
10 Correct 78 ms 40140 KB Output is correct
11 Correct 93 ms 40156 KB Output is correct
12 Correct 138 ms 40152 KB Output is correct
13 Correct 130 ms 40156 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 74 ms 40112 KB Output is correct
3 Correct 95 ms 40132 KB Output is correct
4 Correct 79 ms 40156 KB Output is correct
5 Correct 76 ms 40116 KB Output is correct
6 Correct 78 ms 40156 KB Output is correct
7 Correct 84 ms 40140 KB Output is correct
8 Correct 92 ms 40232 KB Output is correct
9 Correct 72 ms 40156 KB Output is correct
10 Correct 78 ms 40140 KB Output is correct
11 Correct 93 ms 40156 KB Output is correct
12 Correct 138 ms 40152 KB Output is correct
13 Correct 130 ms 40156 KB Output is correct
14 Correct 2 ms 2252 KB Output is correct
15 Correct 112 ms 77780 KB Output is correct
16 Correct 132 ms 96580 KB Output is correct
17 Correct 140 ms 115432 KB Output is correct
18 Correct 164 ms 115396 KB Output is correct
19 Correct 146 ms 115400 KB Output is correct
20 Correct 135 ms 77768 KB Output is correct
21 Correct 164 ms 96504 KB Output is correct
22 Correct 102 ms 59028 KB Output is correct
23 Correct 151 ms 96520 KB Output is correct
24 Correct 203 ms 77816 KB Output is correct

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 74 ms 40112 KB Output is correct
3 Correct 95 ms 40132 KB Output is correct
4 Correct 79 ms 40156 KB Output is correct
5 Correct 76 ms 40116 KB Output is correct
6 Correct 78 ms 40156 KB Output is correct
7 Correct 84 ms 40140 KB Output is correct
8 Correct 92 ms 40232 KB Output is correct
9 Correct 72 ms 40156 KB Output is correct
10 Correct 78 ms 40140 KB Output is correct
11 Correct 93 ms 40156 KB Output is correct
12 Correct 138 ms 40152 KB Output is correct
13 Correct 130 ms 40156 KB Output is correct
14 Correct 2 ms 2252 KB Output is correct
15 Correct 112 ms 77780 KB Output is correct
16 Correct 132 ms 96580 KB Output is correct
17 Correct 140 ms 115432 KB Output is correct
18 Correct 164 ms 115396 KB Output is correct
19 Correct 146 ms 115400 KB Output is correct
20 Correct 135 ms 77768 KB Output is correct
21 Correct 164 ms 96504 KB Output is correct
22 Correct 102 ms 59028 KB Output is correct
23 Correct 151 ms 96520 KB Output is correct
24 Correct 203 ms 77816 KB Output is correct
25 Runtime error 38 ms 9200 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 716 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -