# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161225 | brover29 | Commuter Pass (JOI18_commuter_pass) | C++17 | 204 ms | 23612 KiB |
#include <bits/stdc++.h>
//qwerty47924692
using namespace std;
using ll = long long;
const ll N=2e5+29;
const string br="617283";
#define sz(a)(ll)a.size()
#define f first
#define s second
ll n,s,t,v,u,d[N],pr[N],m,used[N],du[N],dv[N],ds[N],dt[N],p[N],dp[4][N];
vector<pair<ll,ll>>g[N];
ll cost[N];
void djikstra(ll s,ll *d){
for(ll i=1;i<=n;i++){
d[i]=1e18;
used[i]=0;
pr[i]=-1;
}
pr[s]=0;
d[s]=0;
priority_queue<pair<ll,ll>>q;
q.push({0,s});
while(q.size()){
ll v=q.top().s;
q.pop();
if(used[v])continue;
used[v]=1;
for(auto [to,w]:g[v]){
if(d[to]>d[v]+w){
d[to]=d[v]+w;
# | 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... |