Submission #1137341

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1137341	2025-01-19 16:46:49	Iwanttobreakfree	Crocodile's Underground City (IOI11_crocodile)	C++17	Compilation error	0 ms	0 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
    vector<bool> seen(n);
    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 || seen[nodoActual]) continue;
        seen[nodoActual] = true;
        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
                dist[nextNodo][false] = dist[nodoActual][true];
                dist[nextNodo][true] = dist[nodoActual][false] + w;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

crocodile.cpp: In function 'std::vector<std::vector<long long int> > Dijkstra(int, int*, std::vector<std::vector<std::pair<int, int> > >&)':
crocodile.cpp:31:120: error: expected ';' before '}' token
   31 |                 if (dist[nextNodo][true] != dist[nextNodo][false]) pq.push({{-dist[nextNodo][false], nextNodo}, false})
      |                                                                                                                        ^
      |                                                                                                                        ;
   32 |             }   // Solo se actualiza la segunda
      |             ~