fork download
  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. // 9 1 3
  28. // 1 0 1 1 0 1 0 1 1
  29.  
  30.  
  31. vector<int> a;
  32.  
  33. int consistency(int n, int x, int y){
  34.  
  35. unordered_map<int,int> mp = {{0, 1}};
  36.  
  37. int ans = 0;
  38.  
  39. int zero = 0;
  40. int one = 0;
  41.  
  42. for(int i=0; i<n; i++){
  43. if(a[i] == 1) one++;
  44. else zero++;
  45.  
  46. int val = y*zero - x*one;
  47.  
  48. if(mp.count(val)){
  49. ans += mp[val];
  50. }
  51.  
  52. mp[val]++;
  53.  
  54. }
  55.  
  56. return ans;
  57. }
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73. int practice(int n, int x, int y){
  74.  
  75.  
  76. return 0;
  77. }
  78.  
  79.  
  80.  
  81.  
  82.  
  83. void solve() {
  84.  
  85. int n, x, y;
  86. cin>> n >> x >> y;
  87.  
  88. a.resize(n);
  89. for(int i=0; i<n; i++) cin >> a[i];
  90.  
  91. cout << consistency(n, x, y) << endl;
  92.  
  93.  
  94. }
  95.  
  96.  
  97.  
  98.  
  99.  
  100. int32_t main() {
  101. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  102.  
  103. int t = 1;
  104. // cin >> t;
  105. while (t--) {
  106. solve();
  107. }
  108.  
  109. return 0;
  110. }
Success #stdin #stdout 0s 5312KB
stdin
9 1 3
1 0 1 1 0 1 0 1 1
stdout
3