Submission #263363

#	Time	Username	Problem	Language	Result	Execution time	Memory
263363		maximath_1	Crocodile's Underground City (IOI11_crocodile)	C++11	100 / 100	1269 ms	59304 KiB

crocodile

#include "crocodile.h"
#include <vector>
#include <queue>
using namespace std;

vector<pair<int, int> > adj[100005];
int dist[100005];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
	for(int i = 0; i < N; i ++) dist[i] = -1;
	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;
	for(int i = 0; i < K; i ++){
		pq.push({0, P[i]});
		dist[P[i]] = -69;
	}

	while(!pq.empty()){
		pair<int, int> nw = pq.top();
		pq.pop();

		if(dist[nw.second] >= 0) continue;
		if(dist[nw.second] == -1){
			dist[nw.second] = -69;
			continue;
		}

		dist[nw.second] = nw.first;

		for(pair<int, int> nx : adj[nw.second])
			pq.push({nw.first + nx.second, nx.first});
	}

	return dist[0];
}

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