# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683687 | yogesh_sane | Commuter Pass (JOI18_commuter_pass) | C++17 | 390 ms | 23820 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 <vector>
#include <queue>
#include <tuple>
#include <climits>
using namespace std;
int n, m, s, t, u, v;
vector<vector<pair<int, int>>> adj;
vector<long long>distU, distV, dpU, dpV;
long long const INF = 1e15;
long long ans = INF;
void dijkstras_ST(int start, int end){
fill(dpU.begin(), dpU.end(), INF);
fill(dpV.begin(), dpV.end(), INF);
vector<bool> visited(n+1, false);
priority_queue<tuple<long long, int, int>> q; //dist, node, parent
vector<long long>dist(n+1,INF);
q.push({0,start, 0});
dist[start] = 0;
while(!q.empty()){
long long dist_node;
int node, parent;
tie(dist_node, node, parent) = q.top();
dist_node *= -1;
q.pop();
if(!visited[node]){
visited[node] = true;
dist[node] = dist_node;
# | 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... |