Shortest Routes I

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

const int INF = 1000000000; // Large value to represent infinity
vector<vector<pair<int, int>>> adj; // Adjacency list

void dijkstra(int s, vector<int>& d) {
    int n = adj.size();
    d.assign(n, INF); // Initialize distances to infinity
    vector<bool> u(n, false); // Processed array

    d[s] = 0; // Distance to the source is 0
    for (int i = 0; i < n; i++) {
        int v = -1;
        // Find the unprocessed vertex with the smallest distance
        for (int j = 0; j < n; j++) {
            if (!u[j] && (v == -1 || d[j] < d[v]))
                v = j;
        }

        // If the smallest distance is infinity, stop (remaining vertices are unreachable)
        if (d[v] == INF)
            break;

        u[v] = true;
        // Relax edges
        for (auto edge : adj[v]) {
            int to = edge.first;
            int len = edge.second;

            if (d[v] + len < d[to]) {
                d[to] = d[v] + len;
            }
        }
    }
}

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

    adj.resize(n); // Resize adjacency list to hold `n` nodes

    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a - 1].push_back({b - 1, c}); // Add directed edge from a to b with weight c
    }

    vector<int> d;
    dijkstra(0, d); // Run Dijkstra from the source node 0

    // Print the distance to each node
    for (int i = 0; i < n; i++) {
        if (d[i] == INF) {
            cout << "INF "; // If unreachable, print "INF"
        } else {
            cout << d[i] << " "; // Otherwise, print the distance
        }
    }

    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: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: TIME LIMIT EXCEEDED