제출 #1252210

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1252210		lambd47	Crocodile's Underground City (IOI11_crocodile)	C++20	0 / 100	0 ms	320 KiB

crocodile

#include<bits/stdc++.h>
#include "crocodile.h"
using namespace std;
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define sz(v) ((int)v.size())
#define all(v) (v).begin(),(v).end()
#define ll long long

int travel_plan(int n, int m, int R[][2], int len[], int ps, int P[])
{
    vector<vector<int>> adj(n);
    L(i,0,m-1){
        auto [a,b]=R[i];
        adj[a].push_back(i);
        adj[b].push_back(i);
    }

    const ll MOD=1e17;
    vector<pair<ll,ll>> dp(n,{MOD,MOD});

    priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> pq;
    L(i,0,ps-1){
        dp[P[i]]={0,0};
        pq.push({0,0,P[i]});
    }
    
    while(!pq.empty()){
        auto [a,b,v]=pq.top();
        pq.pop();
        if(make_pair(a,b)!=dp[v])continue;

        for(auto e: adj[v]){
            int vai=R[e][0]^R[e][1]^v;
            ll w=len[e];
            if(dp[vai].second>b+w){
                dp[vai].first=dp[vai].second;
                dp[vai].second=b+w;
                pq.push({dp[vai].second,dp[vai].first,vai});
            }
            else if(dp[vai].first>b+w){
                dp[vai].first=b+w;
                pq.push({dp[vai].second,dp[vai].first,vai});
            }
        }

    }
    return dp[0].first;


}

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11