Submission #932017

#	Time	Username	Problem	Language	Result	Execution time	Memory
932017		TheComputer	사이버랜드 (APIO23_cyberland)	C++17	0 / 100	22 ms	5724 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<int,int>>> adj(N);
	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]});
	
	std::vector<std::pair<double,int>> res;
	
	std::priority_queue<std::pair<int,int>> pq;
	std::vector<double> dist(N,(int)1e20);
	dist[H-1]=0;
	pq.push({0,H-1});
	while(!pq.empty()){
		std::pair<int,int> nd = pq.top();
		nd.first*=-1;
		pq.pop();
		for(int i = 0; i < (int)adj[nd.second].size(); i++){
			if(dist[adj[nd.second][i].first]>nd.first+adj[nd.second][i].second){
				dist[adj[nd.second][i].first] = nd.first+adj[nd.second][i].second;
				if(arr[adj[nd.second][i].first]==1&&adj[nd.second][i].first!=0) pq.push({(nd.first+adj[nd.second][i].second)*-1,adj[nd.second][i].first});
				else res.push_back({nd.first+adj[nd.second][i].second,adj[nd.second][i].first});
			}
		}
	}
	double r = (int)1e20;
	for(int i = 0; i < (int)res.size(); i++){
		r=std::min(res[i].first,r);
	}
	return r;
}

• 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