# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331776 | daniel920712 | Commuter Pass (JOI18_commuter_pass) | C++14 | 390 ms | 38368 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 <stdlib.h>
#include <math.h>
#include <set>
#include <map>
#include <algorithm>
#include <time.h>
#include <algorithm>
#include <queue>
#include <utility>
#include <map>
using namespace std;
vector < pair < int , pair < int , int > > > Next[1000005];
priority_queue < pair < int , int > , vector < pair < int , int > > , greater < pair < int , int > > > dij;
bool use[200005]={0};
int small[100005]={0};
int main()
{
int N,M,S,T,U,V,a,b,c,i;
scanf("%d %d",&N,&M);
scanf("%d %d %d %d",&S,&T,&U,&V);
for(i=1;i<=N;i++) small[i]=-1;
for(i=0;i<M;i++)
{
scanf("%d %d %d",&a,&b,&c);
Next[a].push_back(make_pair(i,make_pair(b,c)));
Next[b].push_back(make_pair(i,make_pair(a,c)));
}
dij.push(make_pair(0,S));
while(!dij.empty())
{
a=dij.top().first;
b=dij.top().second;
dij.pop();
if(small[b]!=-1) continue;
small[b]=a;
for(auto i:Next[b]) dij.push(make_pair(a+i.second.second,i.second.first));
}
for(i=1;i<=N;i++)
{
for(auto j:Next[i])
{
if(small[i]+j.second.second==small[j.second.first]) use[j.first]=1;
}
}
for(i=1;i<=N;i++) small[i]=-1;
dij.push(make_pair(0,U));
while(!dij.empty())
{
a=dij.top().first;
b=dij.top().second;
dij.pop();
if(small[b]!=-1) continue;
small[b]=a;
for(auto i:Next[b]) dij.push(make_pair(a+i.second.second*(1-use[i.first]),i.second.first));
}
printf("%d\n",small[V]);
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... |