Submission #283667

#	Time	Username	Problem	Language	Result	Execution time	Memory
283667		TMJN	Crocodile's Underground City (IOI11_crocodile)	C++17	100 / 100	1414 ms	92288 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

struct edge{
	int to,cost;
};

vector<edge>E[100000];
int C[100000];
long long D[100000];
priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>>pq;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
	for(int i=0;i<M;i++){
		E[R[i][0]].push_back({R[i][1],L[i]});
		E[R[i][1]].push_back({R[i][0],L[i]});
	}
	for(int i=0;i<K;i++){
		pq.push({0,P[i]});
		pq.push({0,P[i]});
	}
	while(!pq.empty()){
		int x=pq.top().second;
		long long d=pq.top().first;
		pq.pop();
		C[x]++;
		if(C[x]==2){
			D[x]=d;
			for(edge e:E[x]){
				pq.push({d+e.cost,e.to});
			}
		}
	}
	return D[0];
}

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