Submission #234916

#	Time	Username	Problem	Language	Result	Execution time	Memory
234916		Nodir_Bobiev	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	957 ms	44024 KiB

crocodile

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

vector < pair < int, int > > gr[111111];
int cnt[111111], min1[111111], min2[111111];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for(int i = 0; i < M; i ++ ){
		gr[R[i][0]].push_back({L[i], R[i][1]});
		gr[R[i][1]].push_back({L[i], R[i][0]});
	}
	for( int i = 0; i < N; i ++ ){
		min1[i] = min2[i] = 1e9;
	}
	set < pair < int, int > > q;
	for( int i = 0; i < K; i ++ ){
		min1[P[i]] = min2[P[i]] = 0;
		q.insert({0, P[i]});
	}
	while(!q.empty()){
		pair < int, int > pp = *q.begin(); q.erase(pp);
		int v = pp.second;
		for( auto edge: gr[v] ){
			int cost = edge.first, to = edge.second;
			if( min1[to] >= min2[v]+cost ){
				q.erase({min2[to], to});
				min2[to] = min1[to];
				min1[to] = min2[v]+cost;
				q.insert({min2[to], to});
			}
			else if( min2[to] > min2[v]+cost ){
				q.erase({min2[to], to});
				min2[to] = min2[v] + cost;
				q.insert({min2[to], to});
			}
		}
	}
	/*
	for( int i = 0; i < N; i ++ ){
		cout << "min1[" << i <<"]=" << min1[i] << "; min2[" << i << "]="<<min2[i]<<endl;
	}
	*/
	return min2[0];
}

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