oj.uz

Submission #520208

# Submission time Handle Problem Language Result Execution time Memory
520208 2022-01-28T20:18:06 Z A_D Dungeons Game (IOI21_dungeons) C++17
25 / 100
 7000 ms 97704 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
const int N=4e5+100;
const int L=26;
int st[N][L][6];
long long we[N][L][6];
set<int> stt;
vector<long long> vec;
int sz;
int nnn;
void init(int nn,vector<int> s,vector<int> p,vector<int> w,vector<int> l){
    nnn=nn;
    for(auto x:s){
        stt.insert(x);
    }
    vec.push_back(0);
    for(auto x:stt)vec.push_back(x);
    vec.push_back(1e18);
    sz=vec.size();
    for(int k=0;k<sz-1;k++){
        for(int i=0;i<nnn;i++){
            if(vec[k]>=s[i]){
                st[i][0][k]=w[i];
                we[i][0][k]=s[i];
            }
            else{
                st[i][0][k]=l[i];
                we[i][0][k]=p[i];
            }
        }
        st[nnn][0][k]=nnn;
        for(int j=1;j<L;j++){
            for(int i=0;i<=nnn;i++){
                st[i][j][k]=st[st[i][j-1][k]][j-1][k];
                we[i][j][k]=we[i][j-1][k]+we[st[i][j-1][k]][j-1][k];
            }
        }
    }
}

long long simulate(int xx, int zz){
    int x=xx;
    long long z=zz;
    for(int k=0;k<sz-1;k++){
        if((long long)vec[k+1]<=z)continue;
        for(int j=L-1;j>=0;j--){
            int nx=st[x][j][k];
            long long nz=z+we[x][j][k];
            if(nx!=nnn&&nz<vec[k+1]){
                x=nx;
                z=nz;
            }
        }
        if(x!=nnn&&z<vec[k+1]){
            z=z+we[x][0][k];
            x=st[x][0][k];
        }
    }
    return z;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 87 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 152 ms 94244 KB Output is correct
3 Correct 170 ms 94176 KB Output is correct
4 Correct 164 ms 95384 KB Output is correct
5 Correct 153 ms 95252 KB Output is correct
6 Correct 142 ms 95432 KB Output is correct
7 Correct 149 ms 95560 KB Output is correct
8 Correct 153 ms 95172 KB Output is correct
9 Correct 146 ms 95168 KB Output is correct
10 Correct 156 ms 95036 KB Output is correct
11 Correct 168 ms 95428 KB Output is correct
12 Correct 237 ms 95500 KB Output is correct
13 Correct 223 ms 95428 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 152 ms 94244 KB Output is correct
3 Correct 170 ms 94176 KB Output is correct
4 Correct 164 ms 95384 KB Output is correct
5 Correct 153 ms 95252 KB Output is correct
6 Correct 142 ms 95432 KB Output is correct
7 Correct 149 ms 95560 KB Output is correct
8 Correct 153 ms 95172 KB Output is correct
9 Correct 146 ms 95168 KB Output is correct
10 Correct 156 ms 95036 KB Output is correct
11 Correct 168 ms 95428 KB Output is correct
12 Correct 237 ms 95500 KB Output is correct
13 Correct 223 ms 95428 KB Output is correct
14 Correct 2 ms 2096 KB Output is correct
15 Correct 208 ms 95792 KB Output is correct
16 Correct 258 ms 95876 KB Output is correct
17 Correct 278 ms 95280 KB Output is correct
18 Correct 360 ms 95408 KB Output is correct
19 Correct 275 ms 95540 KB Output is correct
20 Correct 250 ms 95304 KB Output is correct
21 Correct 291 ms 95300 KB Output is correct
22 Correct 198 ms 95300 KB Output is correct
23 Correct 293 ms 95500 KB Output is correct
24 Correct 324 ms 95524 KB Output is correct

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2124 KB Output is correct
2 Correct 152 ms 94244 KB Output is correct
3 Correct 170 ms 94176 KB Output is correct
4 Correct 164 ms 95384 KB Output is correct
5 Correct 153 ms 95252 KB Output is correct
6 Correct 142 ms 95432 KB Output is correct
7 Correct 149 ms 95560 KB Output is correct
8 Correct 153 ms 95172 KB Output is correct
9 Correct 146 ms 95168 KB Output is correct
10 Correct 156 ms 95036 KB Output is correct
11 Correct 168 ms 95428 KB Output is correct
12 Correct 237 ms 95500 KB Output is correct
13 Correct 223 ms 95428 KB Output is correct
14 Correct 2 ms 2096 KB Output is correct
15 Correct 208 ms 95792 KB Output is correct
16 Correct 258 ms 95876 KB Output is correct
17 Correct 278 ms 95280 KB Output is correct
18 Correct 360 ms 95408 KB Output is correct
19 Correct 275 ms 95540 KB Output is correct
20 Correct 250 ms 95304 KB Output is correct
21 Correct 291 ms 95300 KB Output is correct
22 Correct 198 ms 95300 KB Output is correct
23 Correct 293 ms 95500 KB Output is correct
24 Correct 324 ms 95524 KB Output is correct
25 Execution timed out 7008 ms 97704 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 87 ms 2252 KB Output isn't correct
2 Halted 0 ms 0 KB -