Submission #68121

#	Time	Username	Problem	Language	Result	Execution time	Memory
68121		KieranHorgan	악어의 지하 도시 (IOI11_crocodile)	C++17	100 / 100	1255 ms	100832 KiB

crocodile

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

vector<pair<int, int>> AdjList[100005];
int visited[100005];
int p[100005];
int ans[100005];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
	for(int i = 0; i < M; i++) {
		AdjList[R[i][0]].push_back({L[i], R[i][1]});
		AdjList[R[i][1]].push_back({L[i], R[i][0]});
	}

	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
	for(int i = 0; i < K; i++) {
		q.push({0, P[i]});
		p[P[i]]=1;
	}

	while(!q.empty()) {
		int d = q.top().first;
		int u = q.top().second;
		q.pop();
		if(!p[u] && !visited[u]) {
			visited[u]=1;
			continue;
		}
		if(visited[u] == 2) {
			continue;
		}
		visited[u]=2;
		ans[u] = d;
		for(auto v: AdjList[u])
			if(visited[v.second] != 2)
				q.push({d+v.first, v.second});
	}

	return ans[0];
}

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