Submission #628228

#	Time	Username	Problem	Language	Result	Execution time	Memory
628228		abcvuitunggio	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	498 ms	73028 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    ll INF=1e16,d[N][2];
    vector <pair <ll, ll> > ke[N];
    priority_queue<pair <ll, ll>, vector <pair <ll, ll> >, greater <pair <ll, ll> > > q;
    for (int i=0;i<M;i++)
        for (int j=0;j<2;j++)
            ke[R[i][j]].push_back({R[i][j^1],L[i]});
    for (int i=0;i<N;i++)
        d[i][0]=d[i][1]=INF;
    for (int i=0;i<K;i++){
        q.push({0,P[i]});
        d[P[i]][0]=d[P[i]][1]=0;
    }
    while (!q.empty()){
        ll u=q.top().second,du=q.top().first;
        q.pop();
        if (du!=d[u][1])
            continue;
        for (auto [v,w]:ke[u]){
            if (d[v][0]>d[u][1]+w){
                if (d[v][1]>d[v][0])
                    q.push({d[v][0],v});
                d[v][1]=d[v][0];
                d[v][0]=d[u][1]+w;
                continue;
            }
            if (d[v][1]>d[u][1]+w){
                d[v][1]=d[u][1]+w;
                q.push({d[v][1],v});
            }
        }
    }
    return d[0][1];
}

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