Submission #169463

#	Time	Username	Problem	Language	Result	Execution time	Memory
169463		Shafin666	Crocodile's Underground City (IOI11_crocodile)	C++14	100 / 100	996 ms	72820 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define nyan "(=^･ω･^=)"
#define read_input         freopen("in.txt","r", stdin)
#define print_output       freopen("out.txt","w", stdout)
typedef long long ll;
typedef long double ld;
using namespace std;

const int maxn = 2e5+10;
int dist[maxn], visited[maxn];
vector<pii> adj[maxn];
int E[maxn][2];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for(int i = 0; i < M; i++) {
		adj[R[i][0]].pb({R[i][1], L[i]});
		adj[R[i][1]].pb({R[i][0], L[i]});
	}

	for(int i = 0; i < N; i++) dist[i] = 1e9+7, E[i][0] = E[i][1] = 1e9+7;

	multiset<pii> s;
	for(int i = 0; i < K; i++) {
		s.insert({0, P[i]});
		E[P[i]][0] = E[P[i]][1] = 0;
		dist[P[i]] = 0;
	}

	while(!s.empty()) {
		pii p = *s.begin();
		s.erase(s.begin());

		int u = p.second;
		if(visited[u]) continue;
		visited[u] = 1;

		for(auto p : adj[u]) {
			int v = p.first, w = p.second;
			

			/*if(dist[u] + w < dist[v]) {
				dist[v] = dist[u] + w;
				s.insert({dist[v], v});
			}*/
			int d = dist[u] + w;
			if(d <= E[v][0]) {
				E[v][1] = E[v][0];
				E[v][0] = d;

				dist[v] = E[v][1];
				s.insert({E[v][1], v});
			}
			else if(d < E[v][1]) {
				E[v][1] = d;

				dist[v] = d;
				s.insert({d, v});
			}
		}
	}
  	return E[0][1];
}

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