| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 544824 | Jesus | Crocodile's Underground City (IOI11_crocodile) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,m,k;
vector<pair<int,int>> arbol[100001];
pair<int,int> salidas[100001];
bool visitado[100001];
queue<int> considerar;
int main()
{
    ios_base::sync_with_stdio();cin.tie(0);
    cin>>n>>m>>k;
    for(int i=0;i<m;i++){
        int x,y,z;
        cin>>x>>y>>z;
        arbol[x].push_back({y,z});
        salidas[x]={1000000001,1000000001};
        arbol[y].push_back({x,z});
        salidas[y]={1000000001,1000000001};
    }
    for(int i=0;i<k;i++){
        int x;
        cin>>x;
        considerar.push(x);
        salidas[x].second=0;
    }
    while(considerar.size()>0){
        int x;
            visitado[considerar.front()]=true;
        for(pair<int,int> aux:arbol[considerar.front()]){
            if(visitado[aux.first]==false){
                x=aux.second+salidas[considerar.front()].second;
                if(x<salidas[aux.first].first){
                    salidas[aux.first].second=salidas[aux.first].first;
                    salidas[aux.first].first=x;
                }
                else if(x<salidas[aux.first].second) salidas[aux.first].second=x;
                if(salidas[aux.first].first!=1000000001&&salidas[aux.first].second!=1000000001&&aux.first!=0) considerar.push(aux.first);
            }
        }
        considerar.pop();
    }
    cout<<salidas[0].second;
    return 0;
}
