Submission #147373

#	Time	Username	Problem	Language	Result	Execution time	Memory
147373		jhwest2	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	1268 ms	75472 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
#define va first
#define vb second
using namespace std;
typedef pair<int, int> pii;

const int MAX = 101010, INF = 2e9;
int dist[MAX];
bool chk[MAX];
vector<pii> edge[MAX];
priority_queue<pii, vector<pii>, greater<pii>> pq;

pii operator+(const pii &a, const pii &b) {
	return pii(a.va + b.va, a.vb + b.vb);
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for (int i=0; i<M; i++) {
		edge[R[i][0]].push_back(pii(L[i], R[i][1]));
		edge[R[i][1]].push_back(pii(L[i], R[i][0]));
	}
	for (int i=0; i<N; i++) dist[i] = INF;
	for (int i=0; i<K; i++) {
		dist[P[i]] = 0;
		for (auto j : edge[P[i]]) pq.push(j);
	}

  	while (!pq.empty()) {
  		pii tmp = pq.top();
  		pq.pop();

  		if (dist[tmp.vb] != INF) continue;
  		if (!chk[tmp.vb]) {
  			chk[tmp.vb] = true;
  			continue;
  		}
  		dist[tmp.vb] = tmp.va;

  		for (auto i : edge[tmp.vb]) pq.push(i+pii(tmp.va, 0));
  	}

  	return dist[0];
}

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