제출 #1168460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168460		rayan_bd	사이버랜드 (APIO23_cyberland)	C++20	0 / 100	204 ms	2360 KiB

cyberland

#include <bits/stdc++.h>
using namespace std;

const double INF = 5e9+0.1;
const int mxN = 5;
vector<pair<int,int>> adj[mxN];

vector<int> ar;
double ans=INF;


void dfs(int u,int par,int h,double cost){
	if(u==h){
		ans=min(ans,cost);
		return;
	}
	if(ar[u]==2) cost/=2;
	for(auto it:adj[u]){
		if(it.first^par){
			dfs(it.first,u,h,cost+it.second);
		}
	}
}

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr){
	ar=arr;
	for(int i=1;i<=N;++i) adj[i].clear();
	for(int i=0;i<M;++i){
		adj[x[i]].push_back({y[i],c[i]});
		adj[y[i]].push_back({x[i],c[i]});
	} ans=INF;
	dfs(0,-1,H,0);
	return (ans==INF?-1:ans);
}

• 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