| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 768314 | HD1 | Cyberland (APIO23_cyberland) | C++17 | 0 ms | 0 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.
//we are all lost trying to be someone.
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
#define sz(x) ll(x.size())
#define reve(x) reverse(x.begin(),x.end())
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
const ll MAX=1e5+10;
const ll mod=1e9+7;
const ll inf=1e18;
vector<ll> gfo[MAX];
bool vst[MAX];
double dist[MAX];
map<ii,ll>A;
void bfs(ll ini){
queue<ll> q;
q.push(ini);
vst[ini]=true;
dist[ini]=0;
while(sz(q)){
ll u=q.front();
q.pop();
for(ll v:gfo[u]){
if(!vst[v]){
vst[v]=true;
dist[v]=dist[u]+A[{u,v}];
q.push(v);
}
}
}
}
double solve(ll N, ll M, ll K,ll H, vector<ll> x, vector<ll> y, vector<ll> c, vector<ll> arr){
for(ll i=0; i<M; i++){
gfo[x[i]].push_back(y[i]);
gfo[y[i]].push_back(x[i]);
A[{x[i],y[i]}]=c[i];
A[{y[i],x[i]}]=c[i];
}
bfs(0);
return dist[H];
}