# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47137 | dqhungdl | Commuter Pass (JOI18_commuter_pass) | C++17 | 705 ms | 156224 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;
typedef pair<int64_t,int64_t> ii;
typedef pair<ii,int64_t> iii;
int64_t n,m,S,T,U,V,res,d[100005],dS[100005],dT[100005],dU[100005],dV[100005],F1[100005],F2[100005];
bool Free[100005];
vector<int64_t> dag[100005];
vector<ii> g[100005];
vector<iii> Edge;
set<ii> s;
void Dijkstra(int64_t start)
{
for(int64_t i=1; i<=n; i++)
d[i]=1e15;
d[start]=0;
s.insert(ii(0,start));
while(s.size()>0)
{
int64_t u=(*s.begin()).second;
s.erase(s.begin());
for(int64_t i=0; i<g[u].size(); i++)
{
int64_t v=g[u][i].first;
int64_t w=g[u][i].second;
if(d[v]>d[u]+w)
{
if(d[v]!=1e15)
s.erase(s.find(ii(d[v],v)));
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... |