제출 #244635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244635		kimbj0709	Toll (BOI17_toll)	C++14	8 / 100	3087 ms	8696 KiB

toll

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 50050
#define f first
#define s second
int32_t main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int k,no_of_vertex,no_of_edge,no_of_query;
    int input1,input2,input3;
    cin >> k >> no_of_vertex >> no_of_edge >> no_of_query;
    vector<vector<pair<int,int> > > adj(maxn);
    for(int i=0;i<no_of_edge;i++){
        cin >> input1 >> input2 >> input3;
        adj[input1].push_back({input2,input3});
    }
    for(int i=0;i<no_of_query;i++){
        cin >> input1 >> input2;
        vector<int> dist(maxn,INT_MAX);
        priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q1;
        dist[input1] = 0;
        q1.push({0,input1});
        while(q1.size()!=0){
            pair<int,int> a = q1.top();
            q1.pop();
            for(auto j:adj[a.s]){
                if(dist[j.f]>a.f+j.s){
                    dist[j.f] = a.f+j.s;
                    q1.push({dist[j.f],j.f});
                }
            }
        }
        if(dist[input2]==INT_MAX){
            cout << -1 << "\n";
        }
        else{
            cout << dist[input2] << "\n";
        }
    }

}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 8 / 8
• Subtask 4: 0 / 31
• Subtask 5: 0 / 44