제출 #932038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
932038		vjudge1	사이버랜드 (APIO23_cyberland)	C++17	15 / 100	32 ms	7244 KiB

cyberland

#include <bits/stdc++.h>



double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr){
	std::vector<std::vector<std::pair<long long , long long>>> adj(N);
	for(int i = 0; i < M ; i++) adj[x[i]].push_back({y[i],c[i]});
	for(int i = 0; i < M ; i++) adj[y[i]].push_back({x[i],c[i]});
	std::vector<long double> dist(N,-1);
	std::priority_queue<std::pair<long double,long long>> pq;
	dist[H]=0;
	pq.push({0,H});
	while(!pq.empty()){
		std::pair<long double,long long> nd = pq.top(); pq.pop();
		nd.first*=-1;
		if(dist[nd.second]<nd.first&&dist[nd.second]!=-1) continue;
		//std::cout<<nd.first<<" "<<nd.second<<'\n';
		for(auto dat:adj[nd.second]){
			if(dist[dat.first]>dist[nd.second]+dat.second||dist[dat.first]==-1){
				dist[dat.first]=dist[nd.second]+dat.second;
				pq.push({dist[dat.first]*-1,dat.first});
			}
		}
	}
	long double res = dist[0];
	if(res==-1) return res;
	for(int i = 0; i < N; i++) if(arr[i]==0) res=std::min(res,dist[i]);
	return dist[0];
}

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