zoukankan      html  css  js  c++  java
  • hdu 4707 Pet

    题目连接

    http://acm.hdu.edu.cn/showproblem.php?pid=4707  

    Pet

    Description

    One day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamster. He put the cheese trap in his room and waited for three days. Nothing but cockroaches was caught. He got the map of the school and foundthat there is no cyclic path and every location in the school can be reached from his room. The trap’s manual mention that the pet will always come back if it still in somewhere nearer than distance D. Your task is to help Lin Ji to find out how many possible locations the hamster may found given the map of the school. Assume that the hamster is still hiding in somewhere in the school and distance between each adjacent locations is always one distance unit.

    Input

    The input contains multiple test cases. Thefirst line is a positive integer T (0<T<=10), the number of test cases. For each test cases, the first line has two positive integer N (0<N<=100000) and D(0<D<N), separated by a single space. N is the number of locations in the school and D is the affective distance of the trap. The following N-1lines descripts the map, each has two integer x and y(0<=x,y<N), separated by a single space, meaning that x and y is adjacent in the map. Lin Ji’s room is always at location 0.

    Output

    For each test case, outputin a single line the number of possible locations in the school the hamster may be found.

    Sample Input

    1
    10 2
    0 1
    0 2
    0 3
    1 4
    1 5
    2 6
    3 7
    4 8
    6 9

    Sample Output

    2

    #include<algorithm>
    #include<iostream>
    #include<cstdlib>
    #include<cstring>
    #include<cstdio>
    #include<vector>
    #include<map>
    using std::map;
    using std::min;
    using std::sort;
    using std::pair;
    using std::vector;
    using std::multimap;
    #define pb(e) push_back(e)
    #define sz(c) (int)(c).size()
    #define mp(a, b) make_pair(a, b)
    #define all(c) (c).begin(), (c).end()
    #define iter(c) __typeof((c).begin())
    #define cls(arr, val) memset(arr, val, sizeof(arr))
    #define cpresent(c, e) (find(all(c), (e)) != (c).end())
    #define rep(i, n) for(int i = 0; i < (int)n; i++)
    #define tr(c, i) for(iter(c) i = (c).begin(); i != (c).end(); ++i)
    const int N = 100010;
    const int INF = 0x3f3f3f3f;
    int n, d, ans;
    vector<int> G[N];
    void init() {
        rep(i, n) {
            G[i].clear();
        }
    }
    void built() {
        int u, v;
        rep(i, n - 1) {
            scanf("%d %d", &u, &v);
            G[u].pb(v);
            G[v].pb(u);
        }
    }
    void dfs(int u, int fa, int dep) {
        if(dep > d) ans++;
        int m = sz(G[u]);
        for(int i = 0; i < m; i++) {
            int to = G[u][i];
            if(to != fa) {
                dfs(to, u, dep + 1);
            }
        }
    }
    void solve() {
        ans = 0;
        init(), built();
        dfs(0, -1, 0);
        printf("%d
    ", ans);
    }
    int main() {
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w+", stdout);
    #endif
        int t;
        scanf("%d", &t);
        while(t--) {
            scanf("%d %d", &n, &d);
            solve();
        }
        return 0;
    }
  • 相关阅读:
    【原】手写梯度下降《三》之
    【原】特征/SVD分解(图像压缩)/PCA降维简介
    【原】手写梯度下降《二》之
    【原】手写梯度下降《一》之
    Python守护进程和脚本单例运行
    subprocess popen 子进程退出的问题
    subprocess.Popen 详解
    python可以序列化的对象
    concurrent.futures的一些经验
    详解multiprocessing多进程-Pool进程池模块
  • 原文地址:https://www.cnblogs.com/GadyPu/p/4792982.html
Copyright © 2011-2022 走看看