Submission #943963

#	Time	Username	Problem	Language	Result	Execution time	Memory
943963		Amaarsaa	Crocodile's Underground City (IOI11_crocodile)	C++14	0 / 100	2063 ms	4444 KiB

crocodile

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair < ll, ll >;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
	int i, x, c, y, s, p, X;
	vector < pair < int,int > > adj[N + 2];
	
	for (i = 0; i < M; i ++) {
		R[i][0] ++;
		R[i][1] ++;
		x = R[i][0];
		y = R[i][1];
		adj[x].push_back({y, L[i]});
		adj[y].push_back({x, L[i]});
	}
	priority_queue < pll, vector < pll > , greater < pll > > pq;
	vector < array < int, 2> > D(N + 2);
	for (i = 1; i <= N; i ++) D[i] = {1, 1};
	for (i = 0; i < K; i ++) {
		P[i] ++;
		pq.push({0, P[i]});
		D[P[i]] = {0, 0};
	}
	
	while(!pq.empty()) {
		x = pq.top().second;
		c = pq.top().first;
		pq.pop();
		if ( D[x][1] < c) continue;
		
		for ( pair < int, int > & pa : adj[x]) {
			X = pa.first;
			s = c + pa.second;
			p = D[X][1];
			if ( s >= D[X][0]) {
				D[X][1]= D[X][0];
				D[X][0] = s;
			}
			else {
				if ( s >= D[x][1]) {
					D[X][1] = s;
				}
			}
			if ( D[X][1] > p) {
				pq.push({D[X][1], X});
			}
		}
	}
  	return D[1][1];
}

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