제출 #1333619

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1333619		yc11	Wind Turbines (EGOI25_windturbines)	C++20	0 / 100	4094 ms	16092 KiB

Main

#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<pair<int,int> > > n1;


signed main(){
    int n,m,q;
    cin>>n>>m>>q;
    n1.resize(n);
    for (int i = 0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        n1[a].push_back(make_pair(b,c));
        n1[b].push_back(make_pair(a,c));
    }
    for (int i = 0;i<q;i++){
        int l,r;
        cin>>l>>r;
        int ans = 0;
        vector<int> d;
        d.assign(n,1e9);
        int ans1 = r-l+1;
        priority_queue<pair<int,int >, vector<pair<int,int > >, greater<pair<int,int > > > pq;
        for (int j = l;j<=r;j++){
            d[j] = 0;
            for (int k = 0;k<n1[j].size();k++){
                pq.push(make_pair(n1[j][k].second,n1[j][k].first));
            }
        }
        while (!pq.empty()){
            
            int a = pq.top().first;
            int b = pq.top().second;
        
           
            pq.pop();
            if (d[b]<=a) continue;
            d[b] = a;
            ans = ans+a;
          
            for (int j = 0;j<n1[b].size();j++){
                if (d[n1[b][j].first]>a+n1[b][j].second){
                    pq.push(make_pair(n1[b][j].second,n1[b][j].first));
                }
            }
        }
        cout<<ans<<"\n";



    }

    return 0;
    }

• Subtask 0: 0 / 0
• Subtask 1: 0 / 8
• Subtask 2: 0 / 11
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 16
• Subtask 6: 0 / 14
• Subtask 7: 0 / 21