Shortest Routes I

input/code.cpp: In function 'void Test()':
input/code.cpp:50:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
 
const int N=100005;
const LL INF=0x3f3f3f3f3f3f3f3f;

struct Edge {
    int v, w;
};
vector<Edge> edge[N];
 
struct Node {
    LL dis;
    int u;
    bool operator < (const Node& A) const { 
        return dis > A.dis; 
    }
};
 
LL dis[N];
 
void Dijkstra(int n, int s) 
{
    bool vis[N] = {};
    for(int i=1; i<=n; i++)
        dis[i] = INF;
    dis[s] = 0;
    priority_queue<Node> q;
    q.push({0, s});
    while (!q.empty()) 
    {
        int u = q.top().u; q.pop();
        if (vis[u]) continue;
        vis[u] = true;
        
        for (auto e : edge[u]) 
        {
            int &v = e.v, &w = e.w;
            if (dis[v] > w + dis[u])
            {
                dis[v] = w + dis[u];
                q.push({dis[v], v});
            }
        }
    }
}
 
void Test() {
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    int n, m;
    cin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int u, v, w;
        cin >> u >> v >> w;
        edge[u].push_back({v, w});
    }
    Dijkstra(n, 1);
    for(int i=1; i<=n; i++)
        cout << dis[i] << " ";
 
    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: 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