제출 #1041782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041782		khanhtb	악어의 지하 도시 (IOI11_crocodile)	C++14	100 / 100	243 ms	74152 KiB

crocodile

#include <bits/stdc++.h>
#include "crocodile.h"
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define pf push_front
#define vi vector<ll>
#define vii vector<vi>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(a) a.begin(), a.end()
#define fi first
#define se second
using namespace std;
const ll mod = 1e9+7; 
const ll inf = 1e18;
const ll blocksz = 320;
const ll N = 3e5+8;
pair<int,int> d[N];
int n,m,k;
vector<pair<int,int>> g[N];
vector<int> s;
bool use[N];
void dijkstra(vector<int> &s){
    for(int i = 0; i < n; i++) d[i] = {mod,mod};
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    for(int x:s){
        pq.push({0,x});
        d[x].fi = d[x].se = 0;
    }
    while(pq.size()){
        int du = pq.top().fi, u = pq.top().se;
        pq.pop();
        if(use[u]) continue;
        use[u] = 1;
        for(pair<int,int> ed:g[u]){
            int v = ed.fi, w = ed.se;
            if(du + w < d[v].fi){
                d[v].se = d[v].fi;
                d[v].fi = du + w;
                pq.push({d[v].se,v});
            }
            else if(du + w < d[v].se){
                d[v].se = du + w;
                pq.push({d[v].se,v});
            }
        }
    }
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    n = N, m = M, k = K;
    for(int i = 0; i < m; i++){
        int u = R[i][0], v = R[i][1], w = L[i];
        g[u].pb({v,w});
        g[v].pb({u,w});
    }
    for(int i = 0; i < k; i++){
        int x = P[i];
        s.pb(x);
    }
    dijkstra(s);
    return d[0].se;
}

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