Submission #113641

#	Time	Username	Problem	Language	Result	Execution time	Memory
113641		Mercenary	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	771 ms	89416 KiB

crocodile

#include "crocodile.h"
#include<bits/stdc++.h>

using namespace std;
const int maxn = 1e5 + 5;
const long long inf = (long long)1e18 + 5;
typedef long long ll;
typedef pair<ll,int> ii;
#define pb push_back
#define mp make_pair

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    priority_queue<ii,vector<ii>,greater<ii>> pq;
    vector<ll> d(N , inf) , d1(N , inf);
    vector<vector<ii>> adj(N);
    for(int i = 0 ; i < M ; ++i){
        adj[R[i][0]].pb(mp(R[i][1] , L[i]));
        adj[R[i][1]].pb(mp(R[i][0] , L[i]));
    }
    for(int i = 0 ; i < K ; ++i){
        d[P[i]] = d1[P[i]] = 0;
        pq.push(mp(0 , P[i]));
    }
    while(!pq.empty()){
        auto u = pq.top();pq.pop();
//        printf("%d %d\n",u.first,u.second);
        if(d1[u.second] != u.first)continue;
        for(ii c : adj[u.second]){
            if(d[c.first] > u.first + c.second){
                if(d1[c.first] != d[c.first]){
                    d1[c.first] = d[c.first];
                    pq.push(mp(d1[c.first] , c.first));
                }
                d[c.first] = u.first + c.second;
            }else if(d1[c.first] > u.first + c.second){
                d1[c.first] = u.first + c.second;
                pq.push(mp(d1[c.first] , c.first));
            }
        }
    }
    return d1[0];
}

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