Submission #1244284

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <cstdio>
#include <math.h>
#include <utility>
#include <list>
#include <functional>
#include <queue>
using namespace std;

#define ll long long
#define vecint vector<int>
#define Pii pair<int, int>

#define REP(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define print(a) cout << a << endl

#define MOD 1000000007
#define NIL -1

int N,M,Q;
struct edge{
    int to;
    int cost;
};
vector<edge> e[2000];
Pii q[1000];

void solve(int s,int cost){
    int ans=0;
    bool used[N];
    rep(i,N){
        used[i]=false;
    }
    queue<int> q;
    q.push(s);
    used[s]=true;
    while(q.size()!=0){
        int top=q.front();
        q.pop();
        ans++;
        rep(i,e[top].size()) {
//            printf("if %d from %d to %d if cost %d < %d\n",(int)!used[e[top][i].to],top,e[top][i].to,cost,e[top][i].cost);
            if (!used[e[top][i].to] && e[top][i].cost > cost) {
//                printf("ok\n");
                q.push(e[top][i].to);
                used[e[top][i].to]=true;
            }
//            rep(i,N){
//                printf("%d:%d  ",i,used[i]);
//            }
//            putchar('\n');
        }
    }
    print(ans);
    return;
}



int main(){
    cin>>N>>M;
    rep(i,M){
        int a,b,y;
        cin>>a>>b>>y;
        a--;b--;
        edge x,z;
        x.to=b;x.cost=y;
        e[a].push_back(x);
        z.to=a;z.cost=y;
        e[b].push_back(z);
    }
    cin>>Q;
    rep(i,Q){
        int a,b;
        cin>>a>>b;
        a--;
        q[i]=make_pair(a,b);
    }
    rep(i,Q){
        solve(q[i].first,q[i].second);
    }
    return 0;
}

Submission Info

Judge Result