Flowery Trails

input/code.cpp: In function 'void djikstra(int, int)':
input/code.cpp:21:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < conns[i].size(); ++j) {
                                      ^
input/code.cpp: In function 'int main()':
input/code.cpp:47:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 0; j < conns[i].size(); ++j) {
                                      ^

#include <iostream>
#include <queue>
#include <utility>
#include <vector>

const int N = 10000;
long long dist [N][2];
std::vector<int> conns [N];
std::vector<int> cost [N];

void djikstra(int s, int ind) {
	std::priority_queue<std::pair<long long, int>> que;
	que.push({-1,s});
	while(! que.empty()) {
		std::pair<long long, int> node = que.top();
		que.pop();

		int i = node.second;
		if (dist[i][ind] == 0) {
			dist[i][ind] = -node.first;
			for (int j = 0; j < conns[i].size(); ++j) {
				int t = conns[i][j];
				que.push({node.first - cost[i][j], t});
			}
		}
	}
}

int main() {
	int n, m;
	std::cin >> n >> m;
	for (int i = 0; i < m; ++i) {
		int a, b, c;
		std::cin >> a >> b >> c;
		--a; --b;
		conns[a].push_back(b);
		cost[a].push_back(c);
		conns[b].push_back(a);
		cost[b].push_back(c);
	}
	djikstra(0, 0);
	djikstra(n-1, 1);
	long long val = dist[0][0] + dist[0][1];
	long long total = 0;
	for (int i = 0; i < n; ++i) {
		if (dist[i][0] + dist[i][1] == val) {
			for (int j = 0; j < conns[i].size(); ++j) {
				int t = conns[i][j];
				if (dist[t][0] + dist[t][1] == val) {
					if (cost[i][j] == std::abs(dist[t][0] - dist[i][0])) total += cost[i][j];
				}
			}
		}
	}
	std::cout << total << '\n';
}

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