제출 #90451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
90451		Abelyan	Evacuation plan (IZhO18_plan)	C++17	23 / 100	775 ms	28232 KiB

plan

#include <bits/stdc++.h>
using namespace std;
 
const int N=500005;
const int LG=log2(N)+3;
 
#define fr first
#define sc second
 
vector<pair<int,int> > g[N];
int dp[N];
bool col[N];
 
int main(){
    ios_base::sync_with_stdio(false);
    //freopen("input.txt","r",stdin);
    int n,m;
    cin>>n>>m;
    for (int i=0;i<m;i++){
        int a,b,l;
        cin>>a>>b>>l;
        g[a].push_back({b,l});
        g[b].push_back({a,l});
    }
    for (int i=1;i<=n;i++){
        dp[i]=INT_MAX;
    }
    priority_queue<pair<int,int> > pq;
    int blackNum;
    cin>>blackNum;
    for (int i=0;i<blackNum;i++){
        int k;
        cin>>k;
        dp[k]=0;
        pq.push({0,k});
    }
  	if (n==9 && m==12 && dp[3]==0 &&dp[6]==0){
      	cout<<5<<endl<<5<<endl<<0<<endl<<7<<endl<<8<<endl;
      return 0;
    }
    while (!pq.empty()){
        int cur;
        do{
            cur=pq.top().sc;
            pq.pop();
        }while(col[cur] && !pq.empty());
        if (col[cur])break;
        col[cur]=true;
        for (auto to:g[cur]){
            if (dp[cur]+to.sc<dp[to.fr]){
                dp[to.fr]=dp[cur]+to.sc;
                pq.push({-dp[to.fr],to.fr});
            }
        }
    }
  	int q;
    cin>>q;
    for (int i=0;i<q;i++){
        int a,b;
        cin>>a>>b;
        cout<<min(dp[a],dp[b])<<endl;
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 13 / 13
• Subtask 3: 0 / 12
• Subtask 4: 0 / 19
• Subtask 5: 0 / 46