Submission #48323

#	Time	Username	Problem	Language	Result	Execution time	Memory
48323		marvenlee	Sightseeing (NOI14_sightseeing)	C++14	9 / 25	3540 ms	105780 KiB

sightseeing

#include <iostream>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;

int main()
{
    int n,m,q;
    cin >> n >> m >> q;
    vector< vector<ii> >graph;
    graph.assign(n+1,vector<ii>());
    for(int i=0;i<m;i++)
    {
        int u,v,w;
        cin >> u >> v >> w;
        graph[u].push_back(ii(v,w));
        graph[v].push_back(ii(u,w));
    }
    priority_queue<ii , vector<ii> , greater<ii> > pq;
    vector<int> dist (n+1,0);
    dist[1]=2e9;
    pq.push(ii(2e9,1));
    while(!pq.empty())
    {
        int d=pq.top().first;
        int u=pq.top().second;
        if(dist[u]!=d) continue;
        pq.pop();
        for(int i=0;i<graph[u].size();i++)
        {
            int v=graph[u][i].first, w=graph[u][i].second;
            if(dist[v]< min(dist[u],w))
            {
                dist[v]=min(dist[u],w);
                pq.push(ii(dist[v],v));
            }
        }
    }
    for(int i=0;i<q;i++)
    {
        int x;
        cin >> x;
        cout << dist[x] << endl;
    }
    return 0;
}

Compilation message (stderr)

sightseeing.cpp: In function 'int main()':
sightseeing.cpp:30:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<graph[u].size();i++)
                     ~^~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 10