Submission #1188621

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188621		prism7k	Crocodile's Underground City (IOI11_crocodile)	C++20	89 / 100	288 ms	51572 KiB

crocodile

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

const int INF = 2e9+5;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    vector<vector<pair<int,int>>> adj(N);
    vector<vector<int>> dist(N, vector<int>(2, INF));
	
	for(int i = 0; i < M; ++i) {
		int u = R[i][0], v = R[i][1];
		int w = L[i];
		adj[u].push_back({v, w});
		adj[v].push_back({u, w});
	}
	
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
	for(int i = 0; i < K; ++i) { 
		q.push({0, P[i]}); 
		dist[P[i]][0] = 0;
		dist[P[i]][1] = 0;
	}
	
	while(!q.empty()) {
		auto[cur_weight, u] = q.top(); q.pop();
		if(dist[u][1] < cur_weight) continue;
		for(auto[v, w] : adj[u]) {
			if(cur_weight + w < dist[v][0]) {
				q.push({dist[v][0], v});
				dist[v][1] = dist[v][0];
				dist[v][0] = cur_weight + w;
			} else if(cur_weight + w < dist[v][1]) {
				dist[v][1] = cur_weight + w;
				q.push({dist[v][1], v});
			}
		}
	}
    
    return dist[0][1];
}

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