CSES - Aalto Competitive Programming 2024 - wk6 - Homework

CSES - Aalto Competitive Programming 2024 - wk6 - Homework - Results

Submission details
Task:	Shortest Routes I
Sender:	snude
Submission time:	2024-10-06 18:06:44 +0300
Language:	C++ (C++11)
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.28 s	details
#7	ACCEPTED	0.28 s	details
#8	ACCEPTED	0.28 s	details
#9	ACCEPTED	0.28 s	details
#10	ACCEPTED	0.28 s	details
#11	ACCEPTED	0.17 s	details
#12	ACCEPTED	0.14 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.15 s	details
#15	ACCEPTED	0.15 s	details
#16	ACCEPTED	0.13 s	details
#17	ACCEPTED	0.14 s	details
#18	ACCEPTED	0.19 s	details

Compiler report

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

Code

#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
	ll n, m;
	cin >> n >> m;

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

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

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

	distance[1] = 0;
	q.push({ 0, 1 });
	while (!q.empty()) {
		ll 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]) {
			ll 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 (ll i = 1; i < n + 1; i++) {
		cout << distance[i] << " ";
	}
	cout << "\n";

	return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`10 20 8 5 1 9 10 2 7 9 8 9 8 8 ...` view save

correct output
`0 9 11 20 13 14 19 29 27 29` view save

user output
`0 9 11 20 13 14 19 29 27 29` view save

Test 2

Verdict: ACCEPTED

input
`10 20 5 6 4 5 1 7 7 4 4 7 8 1 ...` view save

correct output
`0 7 9 17 15 17 21 22 25 30` view save

user output
`0 7 9 17 15 17 21 22 25 30` view save

Test 3

Verdict: ACCEPTED

input
`10 20 1 4 1 4 2 1 9 10 1 1 2 4 ...` view save

correct output
`0 2 11 1 2 7 16 18 12 13` view save

user output
`0 2 11 1 2 7 16 18 12 13` view save

Test 4

Verdict: ACCEPTED

input
`10 20 6 3 5 7 5 8 5 1 8 8 9 5 ...` view save

correct output
`0 5 9 18 22 10 14 23 27 36` view save

user output
`0 5 9 18 22 10 14 23 27 36` view save

Test 5

Verdict: ACCEPTED

input
`10 20 8 9 3 2 3 8 10 5 3 2 5 3 ...` view save

correct output
`0 8 16 18 11 17 24 23 16 26` view save

user output
`0 8 16 18 11 17 24 23 16 26` view save

Test 6

Verdict: ACCEPTED

input
`100000 200000 18000 18001 426710313 73018 73012 558438094 87726 87671 355171790 53170 53171 869493690 ...` view save

correct output
`0 479659405 1165315262 1854343...` view save

user output
`0 479659405 1165315262 1854343...` Truncated

Test 7

Verdict: ACCEPTED

input
`100000 200000 26504 26450 258578924 49543 49544 28958186 75174 75175 89459846 39175 39228 119699475 ...` view save

correct output
`0 655556128 1413395076 1814086...` view save

user output
`0 655556128 1413395076 1814086...` Truncated

Test 8

Verdict: ACCEPTED

input
`100000 200000 39477 39413 773046299 69758 69759 558754983 23279 23280 142570619 61416 61479 874921013 ...` view save

correct output
`0 269736525 626115013 70199222...` view save

user output
`0 269736525 626115013 70199222...` Truncated

Test 9

Verdict: ACCEPTED

input
`100000 200000 76662 76636 844365635 73339 73342 755006676 89878 89879 396562588 18801 18781 954807004 ...` view save

correct output
`0 598585836 1267139909 1803859...` view save

user output
`0 598585836 1267139909 1803859...` Truncated

Test 10

Verdict: ACCEPTED

input
`100000 200000 11724 11725 818399968 33244 33197 722525474 65530 65531 483965413 62405 62454 199581867 ...` view save

correct output
`0 387990617 441010945 92441292...` view save

user output
`0 387990617 441010945 92441292...` Truncated

Test 11

Verdict: ACCEPTED

input
`100000 200000 1 2 1 1 3 1 1 4 1 1 5 1 ...` view save

correct output
`0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` Truncated

Test 12

Verdict: ACCEPTED

input
`100000 99999 1 2 1000000000 2 3 1000000000 3 4 1000000000 4 5 1000000000 ...` view save

correct output
`0 1000000000 2000000000 300000...` view save

user output
`0 1000000000 2000000000 300000...` Truncated

Test 13

Verdict: ACCEPTED

input
`1 1 1 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 14

Verdict: ACCEPTED

input
`99999 149997 1 2 1 2 3 1 3 4 1 4 5 1 ...` view save

correct output
`0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 ...` view save

user output
`0 1 1 2 2 3 3 4 4 5 5 6 6 7 7 ...` Truncated

Test 15

Verdict: ACCEPTED

input
`99997 149994 1 3 3 3 5 3 5 7 3 7 9 3 ...` view save

correct output
`0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

user output
`0 1 2 3 4 5 6 7 8 9 10 11 12 1...` Truncated

Test 16

Verdict: ACCEPTED

input
`60003 120000 1 2 30010 1 3 30010 1 4 30010 1 5 30010 ...` view save

correct output
`0 30010 30010 30010 30010 3001...` view save

user output
`0 30010 30010 30010 30010 3001...` Truncated

Test 17

Verdict: ACCEPTED

input
`60003 120000 1 2 30010 1 3 30010 1 4 30010 1 5 30010 ...` view save

correct output
`0 30010 30010 30010 30010 3001...` view save

user output
`0 30010 30010 30010 30010 3001...` Truncated

Test 18

Verdict: ACCEPTED

input
`100000 149997 1 50000 99997 1 49999 99995 1 49998 99993 1 49997 99991 ...` view save

correct output
`0 1 3 5 7 9 11 13 15 17 19 21 ...` view save

user output
`0 1 3 5 7 9 11 13 15 17 19 21 ...` Truncated

Aalto Competitive Programming 2024 - wk6 - Homework

Shortest Routes I

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Tasks

Submissions (snude)