Submission #1137339

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1137339	2025-01-19 16:42:20	Iwanttobreakfree	Crocodile's Underground City (IOI11_crocodile)	C++17	0 / 100	0 ms	320 KiB

crocodile

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
// Multi-Dijkstra
vector<vector<long long>> Dijkstra(int K, int P[], vector<vector<pair<int,int>>>& lista) {
    int n = lista.size();
    priority_queue<pair<pair<long long,int>, bool>> pq; // log N
    vector<vector<long long>> dist(n, vector<long long> (2, 1e18)); // nos guardamos las rutas alternativas
    // dist[v][0] nos guardamos la segunda distancia mas corta a una de las salidas
    // dist[v][1] nos guardamos la primera distancia mas corta a una de las salidas
    for (int i = 0; i < K; ++i) {
        dist[P[i]][1] = 0;
        dist[P[i]][0] = 0;
        pq.push({{dist[P[i]][0], P[i]}, 0});
    }
    while (!pq.empty()) {
        int nodoActual = pq.top().first.second;
        long long distActual = -pq.top().first.first;
        bool masCorta = pq.top().second;
        pq.pop();
        if (dist[nodoActual][masCorta] < distActual) continue;
        for (auto vecino: lista[nodoActual]) {
            int nextNodo = vecino.first, w = vecino.second;
            // Actualizar distancia mas corta
            if (dist[nextNodo][true] > dist[nodoActual][false] + w) { // Hemos encontrado una ruta alternativa que mejora la anterior
                if (dist[nextNodo][false] > dist[nextNodo][true]) {
                    dist[nextNodo][false] = dist[nodoActual][true];
                    pq.push({{-dist[nextNodo][0], nextNodo}, false});
                }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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