Ping

input/code.cpp: In function 'int dijkstra(int)':
input/code.cpp:28:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i=0;i<v[s].size();i++) {
                 ^

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

using namespace std;

vector<pair<pair<int,int>,int>> v[101010];
priority_queue<pair<int,int>> q;
int t[101010], e[101010];
int n,r,p;
int u,w,d;

#define INF 1010101010;

int dijkstra(int mid) {
	for (int i=1;i<=n;i++) {
		e[i] = INF;
		t[i]=0;
	}
	e[1] = 0;
	q.push(make_pair(0,1));
	while (!q.empty()) {
		int x = -q.top().first;
		int s = q.top().second;
		q.pop();
		if (t[s]) continue;
		t[s] = 1;
		for (int i=0;i<v[s].size();i++) {
			if (v[s][i].second > mid) continue;
			int u = v[s][i].first.first;
			if (x+v[s][i].first.second < e[u]) {
				e[u] = x+v[s][i].first.second;
				q.push(make_pair(-e[u],u));
			}
		}
	}
	return e[n];
}

int main() {
	cin >> n >> r >> p;
	for (int i=1;i<=r;i++){
		cin >> u >> w >> d;
		v[u].push_back(make_pair(make_pair(w,d),i));
		v[w].push_back(make_pair(make_pair(u,d),i));
	}
	int a=1;
	int b=r+1;
	while (a<b) {
		int mid = (a+b)/2;
		if (dijkstra(mid)>p) {
			a=mid+1;
		}
		else b=mid;
	}
	if (a == r+1) cout << "QAQ\n";
	else cout << a << "\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

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