Submission #1188603

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188603		prism7k	Crocodile's Underground City (IOI11_crocodile)	C++20	0 / 100	0 ms	320 KiB

crocodile

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

vector<int> par;
vector<vector<pair<int, int>>> adj;
vector<int> dist, dist2;
set<int> exits;
const int INF = 2e9+5;

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
	par.resize(N);
	adj.resize(N);
	dist.assign(N, INF);
	dist2.assign(N, INF);
	
	for(int i = 0; i < M; ++i) {
		int u = R[i][0], v = R[i][1];
		int w = L[i];
		adj[u].push_back({v, w});
		adj[v].push_back({u, w});
	}
	
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
	for(int i = 0; i < K; ++i) { 
		q.push({0, P[i]}); 
		dist[P[i]] = 0;
		exits.insert(P[i]);
	}
	
	while(!q.empty()) {
		auto[cur_weight, u] = q.top(); q.pop();
		if(cur_weight != dist[u]) continue;
		
		for(auto[v, w] : adj[u]) {
			if(dist[u] + w < dist[v]) {
				dist[v] = dist[u] + w;
				q.push({dist[v], v});
				par[v] = u;
			}
		}
	}
	
    vector<int> idx(N);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int a, int b) { return dist[a] < dist[b]; });
    vector<int> f(N, INF);
    
    for(int u : idx) {
        if(dist[u] == 0) {
            f[u] = 0;
            continue;
        }
        multiset<int> cand;
        for(auto [v,w] : adj[u]){
            if(dist[v] < dist[u]){
                cand.insert(f[v] + w);
            }
        }
        auto it = cand.begin();
        ++it;
        f[u] = *it;
    }

    return f[0];
}

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