# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92029 | emil_physmath | Evacuation plan (IZhO18_plan) | C++17 | 4091 ms | 67428 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
using namespace std;
const int INF=1000000000;
const int MAXN=100005;
vector<pair<int, int> > nei[MAXN];
int dist[MAXN], p[MAXN];
int main()
{
int n, m, k, Q;
cin>>n>>m;
set<pair<int, int> > vert;
for (int i=0; i<m; i++)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
nei[u].push_back(make_pair(v, w));
nei[v].push_back(make_pair(u, w));
vert.insert(make_pair(u, v));
vert.insert(make_pair(v, u));
}
priority_queue< pair<int,int> > q;
for (int u=1; u<=n; u++)
{
dist[u]=INF;
p[u]=0;
}
cin>>k;
for (int i=0; i<k; i++)
{
int s;
scanf("%d", &s);
dist[s]=0;
q.push(make_pair(0, s));
}
while (!q.empty()) {
int v=q.top().second, cur_d=-q.top().first;
q.pop();
if (cur_d>dist[v]) continue;
for (int j=0; j<nei[v].size(); j++) {
int to=nei[v][j].first,
len=nei[v][j].second;
if (dist[v]+len<dist[to]) {
dist[to]=dist[v]+len;
p[to]=v;
q.push(make_pair(-dist[to], to));
}
}
}
cin>>Q;
while (Q--)
{
int s, e;
scanf("%d%d", &s, &e);
if (vert.find(make_pair(s, e))==vert.end())
{
for (int p=0; ; p++)
{
cout<<p<<endl;
}
}
printf("%d\n", min(dist[s], dist[e]));
}
char I;
cin >> I;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |