Submission #117588

#	Time	Username	Problem	Language	Result	Execution time	Memory
117588		KieranHorgan	악어의 지하 도시 (IOI11_crocodile)	C++17	0 / 100	431 ms	150724 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>

using namespace std;
#define endl '\n'
#define ll long long
#define ld double
#define pii pair<int,int>
#define rand() abs((rand()<<15)|rand())
#define randll() abs(((long long)rand()<<30)|rand())

vector<pair<int,int>> AdjList[1000005];
int dist1[100005];
int dist2[100005];

// signed main() {
// 	ios_base::sync_with_stdio(false);
// 	cin.tie(NULL);
// 	long long seed;
// 	asm("rdtsc" : "=A"(seed));
// 	srand(seed);

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]});
	}

	int n, m, k;
	cin >> n >> m >> k;
	for(int i = 0; i < m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		AdjList[u].push_back({w,v});
		AdjList[v].push_back({w,u});
	}
	vector<int> destination(k);
	for(auto &x: destination)
		cin >> x;


	memset(dist1, 63, sizeof(dist1));
	memset(dist2, 63, sizeof(dist2));
	priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
	for(auto x: destination) {
		pq.push({0,x});
		dist1[x]=0;
		dist2[x]=0;
	}
	while(!pq.empty()) {
		int u = pq.top().second;
		int w = pq.top().first; pq.pop();
		if(w > dist2[u]) continue;
		// cerr << u << ": " << dist2[u] << endl;
		for(auto v: AdjList[u])
			if(dist2[u]+v.first < dist1[v.second]) {
				// cerr << " " << u << "->" << v.second << endl;
				dist2[v.second] = dist1[v.second];
				dist1[v.second] = dist2[u] + v.first;
				if(dist2[v.second])
					pq.push({dist2[v.second], v.second});
			} else if(dist2[u]+v.first < dist2[v.second]) {
				// cerr << "  " << u << "->" << v.second << endl;
				dist2[v.second] = dist2[u] + v.first;
				pq.push({dist2[v.second], v.second});
			}
	}

	// cout << dist2[0] << endl;
	return dist2[0];
}

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