Submission #756637

#	Time	Username	Problem	Language	Result	Execution time	Memory
756637		pavement	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	571 ms	72936 KiB

crocodile

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

#define eb emplace_back
using ll = long long;
using ii = pair<int, int>;

ll fd[100005], sd[100005];
bool vis[100005];
vector<pair<int, ll> > adj[100005];
priority_queue<pair<ll, int>, vector<pair<ll, int> >, greater<pair<ll, int> > > pq, poss;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
	for (int i = 0; i < M; i++) {
		adj[R[i][0]].eb(R[i][1], L[i]);
		adj[R[i][1]].eb(R[i][0], L[i]);
	}
	for (int i = 0; i < N; i++) {
		fd[i] = sd[i] = (ll)1e16;
	}
	for (int i = 0; i < K; i++) {
		fd[P[i]] = sd[P[i]] = 0;
		pq.emplace(0, P[i]);
	}
	while (!poss.empty() || !pq.empty()) {
		while (!pq.empty()) {
			auto [d, v] = pq.top();
			pq.pop();
			if (sd[v] != d) continue;
			assert(!vis[v]);
			vis[v] = 1;
			for (auto [u, w] : adj[v]) {
				ll c = d + w;
				if (c < sd[u]) {
					assert(!vis[u]);
					sd[u] = c;
					if (sd[u] < fd[u]) swap(fd[u], sd[u]);
					if (sd[u] != (ll)1e16) poss.emplace(sd[u], u);
				}
			}
		}
		while (!poss.empty() && vis[poss.top().second]) poss.pop();
		if (poss.empty()) break;
		pq.emplace(poss.top());
		poss.pop();
	}
	return sd[0];
}

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