# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43803 | wzy | Commuter Pass (JOI18_commuter_pass) | C++11 | 599 ms | 146920 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 pii pair<long long,long long>
#define pb push_back
#define ppi pair<pii , pii>
#define piii pair<long long,ppi >
#define F first
#define S second
long long f1[100005] , f2[100005] , f3[100005] ;
int n , m ;
vector<pii> adj[100005];
int s, t , u , v;
int main(){
cin>>n>>m;
cin>>s>>t>>u>>v;
for(int i = 0 ; i < m ; i ++){
int x , y , z;
cin>>x>>y>>z;
adj[x].pb(pii(z,y));
adj[y].pb(pii(z,x));
}
for(int i = 1 ; i <= n; i++){
f1[i] = (long long) 1e18 , f2[i] = (long long) 1e18 , f3[i] = (long long) 1e18;
}
priority_queue<pii , vector<pii> , greater<pii> > pq;
pq.push(pii(0 , u));
while(!pq.empty()){
pii u = pq.top();
# | 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... |