fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. vector<int> consistency(int n){
  33.  
  34. 	vector<vector<int>> dp(n, vector<int>(2,0));
  35. 	if(a[0] & 1){
  36. 		dp[0][0] = 1;
  37. 		dp[0][1] = 0;
  38. 	}
  39. 	else{
  40. 		dp[0][0] = 0;
  41. 		dp[0][1] = 1;
  42. 	}
  43.  
  44. 	for(int i=1; i<n; i++){
  45.  
  46. 		if(a[i] & 1){
  47. 			dp[i][0] = dp[i-1][1];
  48. 			if(i-2>=0) dp[i][0] += dp[i-2][1];
  49.  
  50. 			dp[i][1] = dp[i-1][0];
  51. 			if(i-2>=0) dp[i][1] += dp[i-2][0];
  52. 		}
  53. 		else{
  54. 			dp[i][0] = dp[i-1][0];
  55. 			if(i-2>=0) dp[i][0] += dp[i-2][0];
  56.  
  57. 			dp[i][1] = dp[i-1][1];
  58. 			if(i-2>=0) dp[i][1] += dp[i-2][1];
  59. 		}
  60.  
  61. 	}
  62.  
  63. 	return dp[n-1];
  64.  
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81. vector<int> practice(int n){
  82.  
  83.  
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. void solve() {
  91.  
  92.     int n;
  93.     cin>> n;
  94.  
  95.     a.resize(n);
  96.     for(int i=0; i<n; i++) cin >> a[i];
  97.  
  98.     auto ans = consistency(n);
  99.  
  100.     cout << "Odd Ways : " << ans[0] << " , Even Ways : " << ans[1] << endl;
  101.  
  102.  
  103. }
  104.  
  105.  
  106.  
  107.  
  108.  
  109. int32_t main() {
  110.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  111.  
  112.     int t = 1;
  113.     cin >> t;
  114.     while (t--) {
  115.         solve();
  116.     }
  117.  
  118.     return 0;
  119. }
Success #stdin #stdout 0.01s 5324KB
comments (?)
stdin
copy 
2
4
5 4 1 3
4
5 4 1 6
stdout
copy 
Odd Ways : 2 , Even Ways : 1
Odd Ways : 1 , Even Ways : 2
https://ideone.com/SByeGH
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!