Shortest Routes I

#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define fill(arr,val) memset(arr,val,sizeof(arr))
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ii pair<int,int>
#define dq deque<int>
using namespace std;

const int dx[]={1,0,-1,0};
const int dy[]={0,1,0,-1};
const int N=1e5+5;
const int M=2e5+3;
int n,m,u,v,c;
ll dist[N];
vector<ii>g[M];
priority_queue<ii,vector<ii>,greater<ii>>q;

void dijk(int start) {
    for (int i=1; i<=n; i++) {
        dist[i]=-1e18;
    }
    dist[start]=0;
    q.push(ii(dist[start],start));
    while (!q.empty()) {
        int cost=q.top().fi;
        int node=q.top().se;
        if (cost>dist[node]) continue;
        q.pop();
        for (auto z:g[node]) {
            if (dist[z.fi]<dist[node]+z.se) {
                dist[z.fi]=dist[node]+z.se;
                q.push(ii(dist[z.fi],z.fi));
            }
        }
    }
}
int main() {
    //freopen("file.inp","r",stdin);
    //freopen("file.out","w",stdout);
    fast;
    cin >> n >> m;
    for (int i=1; i<=m; i++) {
        cin >> u >> v >> c;
        g[u].push_back(ii(v,c));
        //g[v].push_back(ii(u,c));
    }
    dijk(1);
    for (int i=1; i<=n; i++) {
        cout << dist[i] << ' ';
    }

    return 0;
}

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER