fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define endl '\n'
  4. #define int long long int
  5. const int MOD = 1000000007;
  6. const int MOD2 = 998244353;
  7. const int INF = LLONG_MAX / 2;
  8. const int MAXN = 100000;
  9. int primes[1000000];
  10.  
  11. /*void seive() {
  12.     fill(primes, primes + 1000000, 1);
  13.     primes[0] = primes[1] = 0;
  14.     for (int i = 2; i * i < 1000000; i++) {
  15.         if (primes[i]) {
  16.             for (int j = i * i; j < 1000000; j += i) {
  17.                 primes[j] = 0;
  18.             }
  19.         }
  20.     }
  21. }
  22.  
  23. bool isPrime(int n) {
  24.     if (n <= 1) return false;
  25.     for (int i = 2; i * i <= n; i++) {
  26.         if (n % i == 0) return false;
  27.     }
  28.     return true;
  29. }
  30.  
  31. int gcd(int a, int b) {
  32.     if (a == 0) return b;
  33.     return gcd(b % a, a);
  34. }*/
  35.  
  36. int power(int a, int b, int mod) {
  37.     int res = 1;
  38.     a %= mod;
  39.     while (b > 0) {
  40.         if (b & 1) res = res * a % mod;
  41.         a = a * a % mod;
  42.         b >>= 1;
  43.     }
  44.     return res;
  45. }
  46.  
  47. // nCr % MOD for n < MOD
  48. int nCrModP(int n, int r) {
  49.     if (r > n) return 0;
  50.     if (r == 0 || r == n) return 1;
  51.  
  52.     int numerator = 1, denominator = 1;
  53.     for (int i = 0; i < r; i++) {
  54.         numerator = (numerator * (n - i)) % MOD;
  55.         denominator = (denominator * (i + 1)) % MOD;
  56.     }
  57.     return (numerator * power(denominator, MOD - 2, MOD)) % MOD;
  58. }
  59.  
  60. // Lucas's Theorem
  61. int lucas(int n, int r) {
  62.     if (r == 0) return 1;
  63.     return (lucas(n / MOD, r / MOD) * nCrModP(n % MOD, r % MOD)) % MOD;
  64. }
  65. void solve() {
  66.     int n,m,k;
  67.     cin>>n>>m>>k;
  68.     int A[n],B[k][2];
  69.     vector<int>v[n+1];
  70.     for(int i = 0 ; i<n ; i++){
  71.         cin>>A[i];
  72.     }
  73.     for(int i = 0 ; i<k ; i++){
  74.         cin>>B[i][0]>>B[i][1];
  75.         v[B[i][0]].push_back(B[i][1]);
  76.         v[B[i][1]].push_back(B[i][0]);
  77.     }
  78.     queue<int>q;
  79.     int visited[n+1];
  80.     fill(visited,visited+n+1,false);
  81.     int prefix[n+1],maxi[n+1],parent[n+1];
  82.     int cnt = 0;
  83.     q.push(B[0][0]);
  84.     while(!q.empty()){
  85.         int node = q.front();
  86.         if(A[node-1]==0){
  87.             cnt++;
  88.         }
  89.         else{
  90.             cnt = 0;
  91.         }
  92.         prefix[node] = cnt;
  93.         if(node>1){
  94.             maxi[node] = max(prefix[node],maxi[parent[node]]);
  95.         }
  96.         else{
  97.             maxi[node] = prefix[node];
  98.         }
  99.         q.pop();
  100.         for(auto node1 : v[node]){
  101.             if(!visited[node1]){
  102.                 parent[node1] = node;
  103.                 visited[node1] = true;
  104.                 q.push(node1);
  105.             }
  106.         }
  107.     }
  108.     int count = 0;
  109.     for(int i = 2 ; i<=n ; i++){
  110.         if(v[i].size()==1){
  111.             if(maxi[i]<=m){
  112.                 count++;
  113.             }
  114.         }
  115.     }
  116.     cout<<count<<endl;
  117. }
  118.  
  119. signed main() {
  120.     ios::sync_with_stdio(false); cin.tie(NULL);
  121.     int t;
  122.     cin >> t;
  123.     while (t--) {
  124.         solve();
  125.     }
  126.     return 0;
  127. }
  128.  
Success #stdin #stdout 0s 5328KB
comments (?)
stdin
copy 
2
7
1
6
1
0
1
1
0
0
0
1 2
1 3
2 4
2 5
3 6
3 7
5
2
4
1
1
0
1
1
1 2
2 3
3 4
4 5
stdout
copy 
2
1
https://ideone.com/sGCTKg
language:
C++14 (gcc 8.3)
created:
8 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!