Submission #1205141

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205141		simona1230	던전 (IOI21_dungeons)	C++20	0 / 100	7095 ms	165464 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=5*1e5+5;
const int logg=30;
int n;
vector<int> s,p,w,l,h;
vector<long long> v;
long long sum[maxn][32];
int ver[maxn][32];

void construct(long long x)
{
    for(int i=0; i<n; i++)
    {
        if(x>s[i])
        {
            ver[i][0]=w[i];
            sum[i][0]=s[i];
        }
        else
        {
            ver[i][0]=l[i];
            sum[i][0]=p[i];
        }
    }
    ver[n][0]=n;

    for(int j=1; j<=logg; j++)
        for(int i=0; i<=n; i++)
        {
            sum[i][j]=sum[i][j-1]+sum[ver[i][j-1]][j-1];
            if(1e18-sum[i][j-1]<sum[ver[i][j-1]][j-1])sum[i][j]=1e18;
            ver[i][j]=ver[ver[i][j-1]][j-1];
            //cout<<ver[i][j][num]<<" "<<i<<" "<<(1<<j)<<endl;
        }
}

void init(int N, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L)
{
    n=N;
    s=S;
    p=P;
    w=W;
    l=L;

    h=s;
    sort(h.begin(),h.end());
    v= {h[0]};
    for(int i=1; i<h.size(); i++)
        if(h[i]!=h[i-1])v.push_back(h[i]);
    v.push_back(1e18);
    return;
}

long long simulate(int x, int zz)
{
    long long z=zz;
    long long num=0;
    while(num<v.size()&&z>=v[num])num++;
    if(num<v.size())construct(v[num]);
    int in=0;

    while(num<v.size()&&x!=n)
    {
        in++;
        //cout<<x<<" "<<z<<" "<<v[num]<<endl;
        for(int j=logg;j>=0;j--)
        {
            if(z<v[num]-sum[x][j])
            {
                z+=sum[x][j];
                x=ver[x][j];
            }
        }
        if(x==n)return z;
        z+=sum[x][0];
        x=ver[x][0];
        while(num<v.size()&&z>=v[num])num++;
        if(num<v.size())construct(v[num]);
    }

    return z;
}

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