제출 #768947

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768947		HD1	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	50 ms	16380 KiB

cyberland

//we are all lost trying to be someone.
#include <bits/stdc++.h>
#include "cyberland.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 int ll;
typedef long double ld;
typedef pair<ll,ll> ii;
const ll MAX=(1e5+10)*2;
vector<ll> gfo[MAX];
bool vst[MAX];
double dist[MAX];
map<ii,double>A;
void bfs(ll ini){
    queue<ll> q;
    q.push(ini);
    vst[ini]=true;
    dist[ini]=0.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<=N; i++){
        dist[i]=-1.0;
    }
    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];

}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3