# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
649669 | Uzouf | Commuter Pass (JOI18_commuter_pass) | C++14 | 109 ms | 262144 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 <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m; cin>>n>>m;
int s,t,u,v; cin>>s>>t>>u>>v;
vector<vector<pair<int,int> > > vv(n+5);
int cost[n+5][n+5];
for (int i=0;i<=n;i++) {
for (int j=0;j<=n;j++) cost[i][j]=1e18;
cost[i][i]=0;
}
for (int i=0;i<m;i++) {
int a,b,c; cin>>a>>b>>c;
vv[a].push_back({b,c});
vv[b].push_back({a,c});
cost[a][b]=c; cost[b][a]=c;
}
int dis[n+5],par[n+5];
for (int i=0;i<=n;i++) {
dis[i]=1e18; par[i]=i;
}
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
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... |