Submission #520206

#	Time	Username	Problem	Language	Result	Execution time	Memory
520206		A_D	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	423 ms	94192 KiB

dungeons

#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<int> 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=0;j>=0;){
            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;
            }
            else{
                break;
            }
        }
        if(x!=nnn&&z<vec[k+1]){
            z=z+we[x][0][k];
            x=st[x][0][k];
        }
    }
    return z;
}

Compilation message (stderr)

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:19:19: warning: overflow in conversion from 'double' to 'std::vector<int>::value_type' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 |     vec.push_back(1e18);
      |                   ^~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11