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,m1;
  56.     cin>>n1>>m1;
  57.     vector<int>A[n1];
  58.     for(int i = 0 ; i<m1 ; i++){
  59.         int a,b;
  60.         cin>>a>>b;
  61.         A[a].push_back(b);
  62.         A[b].push_back(a);
  63.     }
  64.     int d;
  65.     cin>>d;
  66.     queue<int>q;
  67.     int visited[n1] = {0};
  68.     int level[n1] = {0};
  69.     int ways[n1] = {0};
  70.     visited[d] = 1;
  71.     ways[d] = 1;
  72.     q.push(d);
  73.     while(!q.empty()){
  74.         int node = q.front();
  75.         q.pop();
  76.         for(auto node1 : A[node]){
  77.             if(!visited[node1]){
  78.                 q.push(node1);
  79.                 visited[node1] = 1;
  80.                 level[node1] = level[node]+1;
  81.                 ways[node1] = ways[node];
  82.             }
  83.             else{
  84.                 if((level[node]+1)==(level[node1])){
  85.                     ways[node1] = ways[node1] + ways[node];
  86.                 }
  87.             }
  88.         }
  89.     }
  90.     for(int i = 0 ; i<n1 ; i++){
  91.         cout<<ways[i]<<" ";
  92.     }
  93.     cout<<endl;
  94. }
  95.  
  96. signed main(){
  97.     ios::sync_with_stdio(false); cin.tie(NULL);
  98.     //int t;
  99.     //cin >> t;
  100.     //while(t--){
  101.         solve();
  102.     //}
  103.     return 0;
  104. }
Success #stdin #stdout 0.01s 5324KB
comments (?)
stdin
copy 
4 4
0 1
0 2
1 3 
2 3 
0
stdout
copy 
1 1 1 2
https://ideone.com/3SXjLd
language:
C++14 (gcc 8.3)
created:
1 day 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!