Ping

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

#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

#define ll long long
#define ld long double
#define ii pair<int,int>
#define si pair<string,int>
#define iii pair<int,ii>
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define msvs map<string,vs>
#define msi map<string,int>
#define mss map<string,int>
#define us unordered_set
#define um unordered_map
#define pq priority_queue
#define pb push_back
#define mp make_pair
#define forall(i,a,b) for (int i=a;i<b;i++)
#define foreach(v,c) for( typeof( (c).begin()) v = (c).begin();  v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define N (1<<17)
#define M 1000000007
#define I 500000004

int n,q;
ll p;
vector<ii> v[10001];
priority_queue<ii> qq;
int t[10001], e[10001];

#define INF 999999999

int main()
{
	cin.sync_with_stdio(false);
	cin >> n >> q >> p;
	for (int i = 1; i <= n; i++) e[i] = INF;
	e[1] = 0;
	bool found = false;
	for (int j = 0; j < q; j++) {
		int x1,x2,d; cin >> x1 >> x2 >> d;
		if (d > p || found) continue;
		v[x1].pb(mp(x2,d));
		v[x2].pb(mp(x1,d));
		qq.push(mp(0,1));
		while (!qq.empty()) {
			int x = -qq.top().first;
			int s = qq.top().second;
			qq.pop();
			if (t[s]) continue;
			t[s] = 1;
			for (int i = 0; i < v[s].size(); i++) {
				int u = v[s][i].first;
				if (x+v[s][i].second < e[u]) {
					e[u] = x+v[s][i].second;
					qq.push(make_pair(-e[u],u));
				}
			}
		}
		memset(t, 0, sizeof(t));
		if (e[n] <= p) {
			cout << j+1 << "\n";
			found = true;
		}
	}
	if (!found) cout << "QAQ\n";
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: RUNTIME ERROR

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: WRONG ANSWER