# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167749 | afvrevebva | Commuter Pass (JOI18_commuter_pass) | C++20 | 2095 ms | 327680 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll C=1e9;
const ll M=2e5;
vector<vector<pair<int,ll>>> adj;
void f(vector<ll> &v,int x){
v[x]=0;
queue<int>q;
q.push(x);
while(!q.empty()){
int i=q.front();
q.pop();
for(pair<int,ll> p:adj[i]){
ll j,c;
tie(j,c)=p;
if(v[j]>v[i]+c){
v[j]=v[i]+c;
q.push(j);
}
}
}
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
ll n,m,s,t,u,v;
# | 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... |