fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define endl '\n'
  4. #define int long long
  5. const int MOD = pow(10,9)+7;
  6. const int MOD2 = 998244353;
  7. const int INF = LLONG_MAX/2;
  8.  
  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.     for(int i = 1 ; i < 1000000 ; i++){
  22.         primes[i] += primes[i-1];
  23.     }
  24. }
  25. int factorial(int n){
  26.     if(n==0){
  27.         return 1;
  28.     }
  29.     return (n*(factorial(n-1)))%MOD;
  30. }
  31. bool isPrime(int n){
  32.     if(n <= 1) return false;
  33.     for(int i = 2 ; i*i <= n ; i++){
  34.         if(n % i == 0) return false;
  35.     }
  36.     return true;
  37. }
  38.  
  39. int power(int a, int b){
  40.     if(b == 0) return 1;
  41.     a %= MOD;
  42.     int value = power(a, b / 2);
  43.     if(b % 2 == 0){
  44.         return (value * value) % MOD;
  45.     } else {
  46.         return ((value * value) % MOD * (a % MOD)) % MOD;
  47.     }
  48. }
  49.  
  50. int gcd(int a, int b){
  51.     if(a == 0) return b;
  52.     return gcd(b % a, a);
  53. }
  54. void solve() {
  55.     int n1;
  56.     cin>>n1;
  57.     vector<int>A[n1+1];
  58.     int value[n1+1];
  59.     for(int i = 0 ; i<n1-1 ; i++){
  60.         int a,b;
  61.         cin>>a>>b;
  62.         A[a].push_back(b);
  63.         A[b].push_back(a);
  64.     }
  65.     for(int i = 1 ; i<=n1 ; i++){
  66.         cin>>value[i];
  67.     }
  68.     int d;
  69.     cin>>d;
  70.     queue<int>q;
  71.     int visited[n1+1] = {0};
  72.     int level[n1+1] = {0};
  73.     int ones[n1+1] = {0};
  74.     visited[d] = 1;
  75.     if(value[d]==1){
  76.         ones[d] = 1;
  77.     }
  78.     q.push(d);
  79.     while(!q.empty()){
  80.         int node = q.front();
  81.         q.pop();
  82.         for(auto node1 : A[node]){
  83.             if(!visited[node1]){
  84.                 q.push(node1);
  85.                 visited[node1] = 1;
  86.                 level[node1] = level[node]+1;
  87.                 if(value[node1]==1){
  88.                     ones[node1] = 1+ones[node];
  89.                 }
  90.                 else{
  91.                     ones[node1] = ones[node];
  92.                 }
  93.             }
  94.             else{
  95.                 //parent
  96.             }
  97.         }
  98.     }
  99.     for(int i = 1; i <= n1; i++) {
  100.     cout << "Node " << i << ": Shortest Path Length = " << level[i]
  101.          << ", no of 1s = " << ones[i] << endl;
  102.     }
  103. }
  104.  
  105. signed main(){
  106.     ios::sync_with_stdio(false); cin.tie(NULL);
  107.     //int t;
  108.     //cin >> t;
  109.     //while(t--){
  110.         solve();
  111.     //}
  112.     return 0;
  113. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
8
1 2
1 3
2 4
2 5
3 6
3 7
5 8
1 0 1 1 0 1 0 1
1
stdout
copy 
Node 1: Shortest Path Length = 0, no of 1s = 1
Node 2: Shortest Path Length = 1, no of 1s = 1
Node 3: Shortest Path Length = 1, no of 1s = 2
Node 4: Shortest Path Length = 2, no of 1s = 2
Node 5: Shortest Path Length = 2, no of 1s = 1
Node 6: Shortest Path Length = 2, no of 1s = 3
Node 7: Shortest Path Length = 2, no of 1s = 2
Node 8: Shortest Path Length = 3, no of 1s = 2
https://ideone.com/M5LpNO
language:
C++14 (gcc 8.3)
created:
15 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!