제출 #1130796

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1130796		harut_13	Evacuation plan (IZhO18_plan)	C++20	0 / 100	82 ms	14408 KiB

plan

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <map>
#include <string>
#include <ios>
#include <iomanip>
#include <deque>
#include <queue>
#include <list> 
#include <stack>

#define FASTIO ios_base::sync_with_stdio(0); cin.tie(NULL);
#define CY   cout<<"YES"<<endl
#define CN   cout<<"NO"<<endl
#define ll   long long
#define ciN  cin
#define itn  int
#define pshb  push_back
#define sz  size()
#define vec vector<int>
#define vecl vector<long long>
#define fro for
#define Int int
#define stirng string
#define nedl   endl 
#define pi 3.141592653589793238463
#define endl '\n'
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MOD 1000000007


using namespace std;

ll gcd(ll n1, ll n2)
{
    if (n2 != 0)
        return gcd(n2, n1 % n2);
    else
        return n1;
}
ll lcm(ll a, ll b) {
    return a * b / (gcd(a, b));
}

ll pv(ll a, ll b) {
    if (b == 0)return 1;
    ll res = (pv(a, b / 2));
    if (b % 2) {
        return ((res) * (res) * (a));
    }
    else {
        return (res) * (res);
    }
}
void solve() {
    int n, m; cin >> n >> m;
    vector<vector<pll>> gp(n);
    for (int i = 0; i < m; i++) {
        int u, v, w; cin >> u >> v >> w;
        gp[--u].pshb({ --v,w });
        gp[v].pshb({ u,w });
    }
    int k; cin >> k;
    vec  v(k);
    for (int i = 0; i < k; i++) {
        cin >> v[i];
        v[i]--;
    }
    int q; cin >> q;
    vector<pii> harc(q);
    for (int i = 0; i < q; i++) {
        cin >> harc[i].first;
        cin >> harc[i].second;
        harc[i].first--;
        harc[i].second--;
    }
    vecl d(n, 1e18);
    priority_queue<pll> pq;
    for (int i = 0; i < k; i++) {
        pq.push({ 0,v[i] });
        d[v[i]] = 0;
    }
    while (pq.sz) {
        int u = pq.top().second;
        ll w = pq.top().first;
        pq.pop();
        //cout << "??" << u << endl;
        if (d[u] != w)continue;
        for (auto &x : gp[u]) {
            int to = x.first;
            ll dist = x.second;
            if (dist + w < d[to]) {
                d[to] = dist + w;
                pq.push({ d[to],u });
            }
        }
    }
    /*for (int i = 0; i < n; i++) {
        cout << d[i] << " " << i + 1 << endl;
    }*/
   
    for (int i = 0; i < q; i++) {
        cout << min(d[harc[i].first], d[harc[i].second])<<endl;
    }
}



signed main() {
    FASTIO
        //int t; cin >> t;
    //while (t--)
        solve();


}

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