zoukankan      html  css  js  c++  java
  • Codeforce 580C. Kefa and Park

    Kefa decided to celebrate his first big salary by going to the restaurant. 

    He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1. Vertex 1 also contains Kefa's house. Unfortunaely for our hero, the park also contains cats. Kefa has already found out what are the vertices with cats in them.

    The leaf vertices of the park contain restaurants. Kefa wants to choose a restaurant where he will go, but unfortunately he is very afraid of cats, so there is no way he will go to the restaurant if the path from the restaurant to his house contains more than m consecutive vertices with cats. 

    Your task is to help Kefa count the number of restaurants where he can go.

    Input

    The first line contains two integers, n and m (2 ≤ n ≤ 105, 1 ≤ m ≤ n) — the number of vertices of the tree and the maximum number of consecutive vertices with cats that is still ok for Kefa.

    The second line contains n integers a1, a2, ..., an, where each ai either equals to 0 (then vertex i has no cat), or equals to 1 (then vertex i has a cat).

    Next n - 1 lines contains the edges of the tree in the format "xi yi" (without the quotes) (1 ≤ xi, yi ≤ nxi ≠ yi), where xi and yi are the vertices of the tree, connected by an edge. 

    It is guaranteed that the given set of edges specifies a tree.

    Output

    A single integer — the number of distinct leaves of a tree the path to which from Kefa's home contains at most m consecutive vertices with cats.

    简单的dfs,注意对边的处理和叶子节点的判断

    #include <cstdio>
    #include <cctype>
    #include <stdlib.h>
    #include <iostream>
    #include <cmath>
    #include <iomanip>
    #include <cstring>
    #include <algorithm>
    #include <string>
    #include <vector>
    #include <map>
    
    using namespace std;
    typedef long long LL;
    int cat[100005];
    vector<int> t[100005];
    int n,m;
    int total = 0;
    int visited[100005] = {0};
    void search(int now,int catnow){
      visited[now] = 1;
      // cout << now << endl;
      if (cat[now] == 1){
        catnow ++;
      }
      else {
        catnow = 0;
      }
      if (catnow > m){
        return;
      }
      int empty = 1;
      for (int i=0;i<t[now].size();i++){
          if (!visited[t[now][i]]){
            empty = 0; break;
          }
      }
      if (empty){
        total ++; return;
      }
      for (int i=0;i<t[now].size();i++){
        int after = t[now][i];
        if (visited[after]) continue;
        // cout << now << " " << after <<endl;
        search(after,catnow);
      }
    }
    
    int main()
    {
      // freopen("test.in","r",stdin);
    
      cin >> n >> m;
      for (int i=1;i<=n;i++){
        cin >> cat[i];
      }
      for (int i=1;i<n;i++){
        int a,b;
        cin >> a >> b;
        t[a].push_back(b);
        t[b].push_back(a);
      }
      search(1,0);
      cout << total;
      return 0;
    }
    View Code
  • 相关阅读:
    OAuth 2.0 访问新浪、腾讯的资源服务器
    OAuth 2.0 Authorization Code授权方式详解
    linux权限补充:rwt rwT rws rwS 特殊权限
    异步服务器框架设计
    vsftpd常规操作指南
    folly学习心得
    中国人口趋势(19902035)
    hbase系统搭建
    过载保护
    穷人和富人
  • 原文地址:https://www.cnblogs.com/ToTOrz/p/6840803.html
Copyright © 2011-2022 走看看