Submission #753718

#	Time	Username	Problem	Language	Result	Execution time	Memory
753718		nicksms	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	1376 ms	99980 KiB

crocodile

/**
 *      Author:  Nicholas Winschel
 *      Created: 05.09.2023 19:37:01
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
using pl = pair<ll, ll>;
#define f first
#define s second
#define sz(x) (int)((x).size())

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
	V<multiset<ll>> ts(N);
	priority_queue<pl, V<pl>, greater<pl>> h;
	V<bool> vis(N);
	V<ll> best(N);
	V<V<pi>> adj(N);
	for (int i = 0; i < M; i++) {
		adj[R[i][0]].emplace_back(R[i][1], i);
		adj[R[i][1]].emplace_back(R[i][0], i);
	}
	for (int i = 0; i < K; i++) {
		ts[P[i]].insert(0); ts[P[i]].insert(0);
		h.emplace(0, P[i]);
	}
	while (sz(h)) {
		auto p = h.top();
		h.pop();
		if (vis[p.s]) continue;
		vis[p.s]=true;
		best[p.s]=p.f;
		for (pi e : adj[p.s]) {
			if (vis[e.f]) continue;
			ts[e.f].insert(L[e.s]+best[p.s]);
			if (sz(ts[e.f])>=2) h.emplace(*(++ts[e.f].begin()), e.f);
		}
	}

	return best[0];
}

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