Submission #62146

#	Time	Username	Problem	Language	Result	Execution time	Memory
62146		aome	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	1018 ms	100468 KiB

crocodile

#include "crocodile.h"

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> ii;

const int N = 100005;

int visit[N];
bool finish[N];
vector< pair<int, int> > G[N];

void add(int u, int v, int w) {
	G[u].push_back({w, v}), G[v].push_back({w, u});
}

int travel_plan(int n, int M, int R[][2], int L[], int K, int P[]) {
	priority_queue< ii, vector<ii>, greater<ii> > pq;
	for (int i = 0; i < M; ++i) {
		add(R[i][0], R[i][1], L[i]);
	}
	for (int i = 0; i < K; ++i) {
		pq.push({0, P[i]}), finish[P[i]] = 1;
	}
	while (pq.size()) {
		int u = pq.top().second; 
		int du = pq.top().first;
		pq.pop(), visit[u]++;
		if (finish[u]) {
			if (visit[u] != 1) continue;
		}
		else {
			if (visit[u] != 2) continue;
		}
		if (u == 0) return du;
		for (auto v : G[u]) pq.push({du + v.first, v.second});
	}
}

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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