Submission #1244199

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define pb         push_back

typedef long long ll;
const ll INF = 1000000000000000000ll;
const ll MOD = 1000000007ll;
const double EPS = 1e-8;

vector<pair<int, int>> adj[200001];
int used[100001];
int n, m;

int bfs(int v, int w){
	for(int i=0; i<n; i++){
		used[i] = -1;
	}

	queue<int> que;
	que.push(v);
	used[v] = 1;
	int cnt = 0;
	while(!que.empty()){
		int now = que.front(); que.pop();
		cnt++;

		for(int i=0; i<adj[now].size(); i++){
			auto p = adj[now][i];
			auto next = p.first;
			auto y = p.second;
			//printf("%d %d %d\n", v, next, y);

			if(used[next] == -1 && y > w){
				used[next] = 1;
				que.push(next);
			}
		}
	}
	
	return cnt;
}

int main(void) {
	//ios_base::sync_with_stdio(false);
	//cin.tie(0);
	
	cin >> n >> m;
	for(int i=0; i<m; i++){
		int a, b, y;
		cin >> a >> b >> y;
		a--; b--;

		adj[a].pb(make_pair(b, y));
		adj[b].pb(make_pair(a, y));
	}

	int q;
	cin >> q;
	for(int i=0; i<q; i++){
		int v, w;
		cin >> v >> w;
		v--;

		cout << bfs(v, w) << endl;

	}
	
	return 0;
}

Submission Info

Judge Result