Shortest Routes I

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:42:37: warning: overflow in conversion from 'float' to 'std::vector<int>::value_type' {aka 'int'} changes value from '+Inff' to '2147483647' [-Woverflow]
   42 |         vector<int> distance(n + 1, INFINITY);
      |                                     ^~~~~~~~

#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

// Debug printing
#ifdef DEBUG
#define deb(fmt, args...) printf("DEBUG: %d: " fmt, __LINE__, ##args)
#else
#define deb(fmt, args...)
#endif

int main(int argc, char *argv[])
{
	// Read the input parameters
	int n, m;
	cin >> n >> m;

	// Read pairs from multiple lines
	// vector<vector<int>> input_pairs(m, vector<int>(3));
	vector<vector<pair<int, int>>> adj(n + 1);
	int a, b, w;
	for (int i = 0; i < m; i++) {
		cin >> a >> b >> w;
		adj[a].push_back({ b, w });
	}

	// for (int i = 0; i < n + 1; i++) {
	// 	deb("kaupungin %d naapurit\n", i);
	// 	for (int j = 0; j < adj[i].size(); j++) {
	// 		deb("%d, %d\n", adj[i][j].first, adj[i][j].second);
	// 	}
	// }

	priority_queue<pair<int, int>> q;
	vector<int> distance(n + 1, INFINITY);
	vector<bool> processed(n + 1, false);

	distance[1] = 0;
	q.push({ 0, 1 });
	while (!q.empty()) {
		int a = q.top().second; q.pop();
		if (processed[a])
			continue;
		// deb("käsitellään %d\n", a);
		processed[a] = true;
		for (auto u : adj[a]) {
			int b = u.first, w = u.second;
			// deb("naapuri %d, distance: %d\n", b, w);
			if (distance[a] + w < distance[b]) {
				distance[b] = distance[a] + w;
				q.push({ -distance[b], b });
			}
		}
	}

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

	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: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED