# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41087 | kriii | Commuter Pass (JOI18_commuter_pass) | C++14 | 439 ms | 15640 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 <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
vector<pair<int, int> > G[100100];
int N,M,S,T,U,V;
vector<long long> dist(int s)
{
vector<long long> ret(N,1e18);
priority_queue<pair<long long, int> > Q;
Q.push({0,s}); ret[s] = 0;
while (!Q.empty()){
long long c = -Q.top().first; int x = Q.top().second; Q.pop();
if (ret[x] < c) continue;
for (auto &e : G[x]){
int y = e.first; long long nc = c + e.second;
if (ret[y] > nc){
Q.push({-nc,y}); ret[y] = nc;
}
}
}
return move(ret);
}
int main()
{
scanf ("%d %d %d %d %d %d",&N,&M,&S,&T,&U,&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... |