Wide delivery

#include <iostream>
#include <limits.h>
#include <vector>

int maxWidth(std::vector<int>& dist, std::vector<bool>& exists)
{
    int max = 0, max_v=0;

    for (size_t v = 0; v < dist.size(); v++)
      if (exists[v] && dist[v] >= max) max = dist[v], max_v = v;

    return max_v;
}


std::vector<int> dijkstra(std::vector<std::vector<int>>& graph, int src)
{
  std::vector<int> maxPosWidth(graph.size(), 0); 

  std::vector<bool> exists(graph.size(), true); 

  maxPosWidth[src] = INT_MAX;

  for (size_t count = 0; count < graph.size() - 1; count++) {
    int u = maxWidth(maxPosWidth, exists);

    exists[u] = false;

    for (size_t v = 0; v < graph.size(); v++)
      if (exists[v] && graph[u][v]!=-1 && std::min(maxPosWidth[u], graph[u][v]) > maxPosWidth[v])
        maxPosWidth[v] = std::min(maxPosWidth[u], graph[u][v]);
  }
  return maxPosWidth;

}


int main(){
  int n, m;
  std::cin >> n >> m;
  std::vector<std::vector<int>> neighbors(n, std::vector<int> (n, -1));

  for (int i = 0; i<m; ++i){
    int c1, c2, dist;
    std::cin >> c1 >> c2 >> dist;
    if (neighbors[c1-1][c2-1]==-1){
      neighbors[c1-1][c2-1] = dist;
      neighbors[c2-1][c1-1] = dist;
    }else {
      neighbors[c1-1][c2-1] = std::min(dist, neighbors[c1-1][c2-1]);
      neighbors[c2-1][c1-1] = std::min(dist, neighbors[c1-1][c2-1]);
    }
  }


  std::vector<int> dist = dijkstra(neighbors, 0);

  for (int i = 1; i<n; ++i){
    std::cout << dist[i] << " ";
  }
  std::cout << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: RUNTIME ERROR

Test 61

Verdict: RUNTIME ERROR

Test 62

Verdict: RUNTIME ERROR

Test 63

Verdict: RUNTIME ERROR

Test 64

Verdict: RUNTIME ERROR

Test 65

Verdict: RUNTIME ERROR

Test 66

Verdict: RUNTIME ERROR

Test 67

Verdict: RUNTIME ERROR

Test 68

Verdict: RUNTIME ERROR

Test 69

Verdict: RUNTIME ERROR