# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753785 | buihuynhtay | Commuter Pass (JOI18_commuter_pass) | C++14 | 298 ms | 17992 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 Size(x) ((int)(x).size())
#define MASK(i) (1LL<<(i))
#define bit(mask, i) (((mask) >> (i)) & 1)
const long long inf = 1e18;
const int mod = 1e9 + 7;
const int N = 1e5 + 1;
template<class T1, class T2>
bool Min(T1 &a, T2 b){
if(a >= b){a = b; return true;}
return false;
}
int n, m, s, t, u, v;
bool vs[N];
long long minDist[N], minDistU[N], minDistV[N], dpU[N], dpV[N];
vector<pair<int,int>> graph[N];
#define pli pair<long long, int>
void dijkstra(int s, long long minDist[]){
for(int i = 1; i <= n; i++) minDist[i] = inf;
minDist[s] = 0;
priority_queue<pli, vector<pli>, greater<pli>> pq;
pq.push({minDist[s], s});
while(pq.empty() == 0){
long long du = pq.top().first;
int u = pq.top().second;
# | 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... |