# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
359034 | shahriarkhan | Commuter Pass (JOI18_commuter_pass) | C++14 | 454 ms | 25384 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 ;
const int mx = 1e5 + 5 ;
const long long INF = 1e18 ;
typedef pair<long long , int> li ;
vector<pair<int,long long> > adj[mx] ;
long long dp1[mx] , dp2[mx] , dist_s[mx] , dist_t[mx] , dist_u[mx] , dist_v[mx] , ans = INF ;
int vis[mx] , n , m ;
void djikstra1(int start , long long dist[])
{
for(int i = 1 ; i <= n ; ++i) dist[i] = INF , vis[i] = 0 ;
priority_queue<li,vector<li>,greater<li> > pq ;
pq.push({0,start}) , dist[start] = 0 ;
while(!pq.empty())
{
int u = pq.top().second ;
long long cost = pq.top().first ;
pq.pop() ;
if(vis[u]) continue ;
vis[u] = 1 ;
for(auto p : adj[u])
{
int v = p.first ;
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... |