Shortest Routes I

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

int minDistance(int V, int dist[], bool sptSet[]) {
    int min = INT_MAX, min_index = 0;

    for (int v = 0; v < V; v++) {
        if (!sptSet[v] && dist[v] <= min) {
            min = dist[v];
            min_index = v;
        }
    }

    return min_index;
}

void printSolution(int V, int dist[]) {
    for (int i = 0; i < V; i++) {
        cout << dist[i] << " ";
    }
    cout << endl;
}

void dijkstra(int V, int** graph, int src) {
    int* dist = new int[V];
    bool* sptSet = new bool[V];

    for (int i = 0; i < V; i++) {
        dist[i] = INT_MAX;
        sptSet[i] = false;
    }

    dist[src] = 0;

    for (int count = 0; count < V - 1; count++) {
        int u = minDistance(V, dist, sptSet);

        sptSet[u] = true;

        for (int v = 0; v < V; v++) {
            if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX && dist[u] + graph[u][v] < dist[v]) {
                dist[v] = dist[u] + graph[u][v];
            }
        }
    }

    printSolution(V, dist);

    delete[] dist;
    delete[] sptSet;
}

int main() {
    int n, m;
    cin >> n >> m;

    int** graph = new int*[n];
    for (int i = 0; i < n; i++) {
        graph[i] = new int[n];
        fill(graph[i], graph[i] + n, 0);
    }

    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        if (graph[a-1][b-1] == 0) {
            graph[a-1][b-1] = c;
        } else {
            graph[a-1][b-1] = min(graph[a-1][b-1], c); 
        }
    }

    dijkstra(n, graph, 0);

    for (int i = 0; i < n; i++) {
        delete[] graph[i];
    }
    delete[] graph;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: RUNTIME ERROR

Test 12

Verdict: RUNTIME ERROR

Test 13

Verdict: ACCEPTED

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: RUNTIME ERROR

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: RUNTIME ERROR