제출 #790269

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
790269		alexander707070	던전 (IOI21_dungeons)	C++17	0 / 100	63 ms	40992 KiB

dungeons

#include<bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define MAXN 400007
using namespace std;

int n,parent[MAXN],to[MAXN],last,comp[MAXN];
int win[MAXN],lose[MAXN],k;
vector<int> v[MAXN];
long long curr,dist[MAXN],pref,minloops,tocomp[MAXN];
int pos[MAXN];

pair<int,int> dp[MAXN][20];
bool li[MAXN][20];

pair<int,int> ff(int x,int p){
    if(x==0)return {n,0};
    if(p==0)return {parent[x],win[parent[x]]};

    if(li[x][p])return dp[x][p];
    li[x][p]=true;

    dp[x][p].first=ff(ff(x,p-1).first,p-1).first;
    dp[x][p].second=max( ff(x,p-1).second , ff(ff(x,p-1).first,p-1).second );
    
    return dp[x][p];
}

void dfs(int x,long long len){
    len+=win[x]; dist[x]=len;
    for(int i=0;i<v[x].size();i++){
        dfs(v[x][i],len);
    }
}

bool in[MAXN],dali,incyc[MAXN];
vector< vector<int> > cycle;
long long sum[MAXN];

int dfs2(int x){
    if(comp[x]!=0)return comp[x];

    in[x]=true;

    if(in[to[x]]){
        k++; comp[x]=k; dali=true;

        cycle.push_back({});
        cycle.back().push_back(to[x]); sum[k-1]+=win[to[x]];
        cycle.back().push_back(x); sum[k-1]+=win[x];
        incyc[to[x]]=incyc[x]=true;

        in[x]=false;
        return k;
    }

    comp[x]=dfs2(to[x]);

    if(dali){
        if(x==cycle.back()[0])dali=false;
        else {
            incyc[x]=true; sum[k-1]+=win[x];
            cycle.back().push_back(x);
        }
    }

    in[x]=false;

    return comp[x];
}

void init(int N,vector<int> s,vector<int> p,vector<int> w,vector<int> l){
    n=N;
    for(int i=0;i<n;i++){
        parent[i]=w[i];
        v[parent[i]].push_back(i);

        to[i]=l[i];

        win[i]=s[i]; lose[i]=p[i];
    }
    parent[n]=n;

    dfs(n,0);

    cycle.push_back({});
    for(int i=0;i<n;i++){
        if(comp[i]==0)dfs2(i);
    }

    for(int i=0;i<=k;i++){
        reverse(cycle[i].begin(),cycle[i].end());
        for(int f=0;f<cycle[i].size();f++){
            pos[cycle[i][f]]=f;
        }
    }
}

long long simulate(int x, int z){
    curr=z;

    while(x!=n){
        while(curr<win[x] and !incyc[x]){
            curr+=lose[x]; x=to[x];
        }
        
        if(curr<win[x]){            
            minloops=100000000; pref=0;

            for(int i=pos[x];i<cycle[comp[x]].size();i++){
                minloops=min( minloops, int( ceil(1.0*(win[cycle[comp[x]][i]]-curr-pref)/sum[comp[x]]) )*1LL );
                pref+=lose[cycle[comp[x]][i]];
            }
            for(int i=0;i<pos[x];i++){
                minloops=min( minloops, int( ceil(1.0*(win[cycle[comp[x]][i]]-curr-pref)/sum[comp[x]]) )*1LL );
                pref+=lose[cycle[comp[x]][i]];
            }

            if(minloops<0)minloops=0;
            curr+=minloops*sum[comp[x]];

            while(curr<win[x]){
                curr+=lose[x]; x=to[x];
            }
        }

        last=x;
        for(int i=19;i>=0;i--){
            if(ff(x,i).first!=n and ff(x,i).second<=curr){
                x=ff(x,i).first;
            }
        }

        curr+=dist[last]-dist[parent[x]];
        x=parent[x];
    }

    return curr;
}

/*
int main(){
    init(3, {2, 6, 9}, {3, 1, 2}, {2, 2, 3}, {1, 0, 1});
    cout<<simulate(0,1)<<"\n";
    cout<<simulate(2,3)<<"\n";
}
*/

컴파일 시 표준 에러 (stderr) 메시지

dungeons.cpp: In function 'void dfs(int, long long int)':
dungeons.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~
dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:93:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         for(int f=0;f<cycle[i].size();f++){
      |                     ~^~~~~~~~~~~~~~~~
dungeons.cpp: In function 'long long int simulate(int, int)':
dungeons.cpp:110:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |             for(int i=pos[x];i<cycle[comp[x]].size();i++){
      |                              ~^~~~~~~~~~~~~~~~~~~~~~

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