Submission #367267

#	Time	Username	Problem	Language	Result	Execution time	Memory
367267		wind_reaper	Crocodile's Underground City (IOI11_crocodile)	C++17	0 / 100	1 ms	364 KiB

crocodile

#include <bits/stdc++.h>
#include "crocodile.h"

using namespace std;

const int INF = 1e9 + 1;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
	vector<vector<pair<int, int>>> adj(N);
	for(int i = 0; i < M; i++){
		adj[R[i][0]].push_back({R[i][1], L[i]});
		adj[R[i][1]].push_back({R[i][0], L[i]});
	}

	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
	vector<array<int, 2>> d(N, {INF, INF});
	for(int i = 0; i < K; i++){
		d[i] = {0, 0};
		pq.push({0, i});
	}

	while(!pq.empty()){
		auto[dv, node] = pq.top();
		pq.pop();

		if(dv > d[node][1]) continue;
		for(auto& [v, l] : adj[node]){
			int nx = dv + l;
			if(nx > d[v][1]) continue;
			d[v][1] = nx;
			if(d[v][1] < d[v][0]) swap(d[v][1], d[v][0]);
			pq.push({nx, v});
		}
	}

	return (d[0][0] == INF ? -1 : d[0][0]);
}
/*int32_t main(){
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL); 
	
	return 0; 
}*/
/*
implement something equivalent to a multi source dijkstra
*/

• Subtask 1: 0 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11