fork(1) 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.  
  33. int consistency1(int n){
  34.  
  35. 	int total = 0;
  36. 	for(int i=0; i<n; i++) total += a[i];
  37.  
  38. 	if(total % 4 != 0) return false;
  39. 	int x = total/4;
  40.  
  41. 	unordered_map<int,int> prefixSum;
  42. 	unordered_map<int,int> suffixSum;
  43.  
  44. 	int sum = 0;
  45. 	for(int i=n-1; i>=2; i--){
  46. 		sum += a[i];
  47. 		suffixSum[sum]++;
  48. 	}
  49. 	prefixSum[a[0]]++;
  50.  
  51.  
  52. 	int ans = 0;
  53. 	int leftSum = a[0];
  54.  
  55.  
  56. 	for(int i=1; i<=n-2; i++){
  57.  
  58. 		leftSum += a[i];
  59. 		int rightSum = total - leftSum;
  60.  
  61. 		suffixSum[rightSum]--;
  62. 		if(suffixSum[rightSum] == 0) suffixSum.erase(rightSum);
  63.  
  64.  
  65. 		if(leftSum == 2*x && rightSum == 2*x){
  66. 			ans += prefixSum[leftSum/2] * suffixSum[rightSum/2];
  67. 		}
  68.  
  69. 		prefixSum[leftSum]++;
  70. 	}
  71.  
  72. 	return ans;
  73.  
  74. }
  75.  
  76.  
  77.  
  78.  
  79.  
  80. int consistency2(int n){
  81.  
  82. 	int total = 0;
  83. 	for(int i=0; i<n; i++) total += a[i];
  84.  
  85. 	if(total % 4 != 0) return 0;
  86.  
  87. 	int x = total/4;
  88.  
  89. 	vector<int> suffixWays(n, 0);
  90. 	int ct_x = 0;
  91. 	int sum = 0;
  92.  
  93. 	for(int i=n-1; i>=0; i--){
  94. 		sum += a[i];
  95.  
  96. 		if(sum == 2*x){
  97. 			suffixWays[i] += ct_x; 
  98. 		}		
  99. 		if(sum == x){
  100. 			ct_x++;
  101. 		}
  102. 	}
  103.  
  104.  
  105. 	sum = 0;
  106. 	ct_x = 0;
  107. 	int ans = 0;
  108.  
  109. 	for(int i=0; i<=n-3; i++){
  110. 		sum += a[i];
  111. 		if(sum == 2*x)	ans += ct_x * suffixWays[i+1];
  112.  
  113. 		if(sum == x) ct_x++;
  114. 	}
  115.  
  116.  
  117.     return ans;
  118. }
  119.  
  120.  
  121.  
  122.  
  123.  
  124.  
  125.  
  126.  
  127.  
  128.  
  129.  
  130.  
  131.  
  132.  
  133.  
  134.  
  135.  
  136.  
  137.  
  138.  
  139.  
  140.  
  141.  
  142. int practice(int n){
  143.  
  144.  
  145. }
  146.  
  147.  
  148.  
  149.  
  150.  
  151. void solve() {
  152.  
  153.     int n;
  154.     cin>> n;
  155.  
  156.     a.resize(n);
  157.     for(int i=0; i<n; i++) cin >> a[i];
  158.  
  159.     cout << consistency1(n) << " " << consistency2(n) << endl;
  160.  
  161.     // cout << practice(n) << endl;
  162.  
  163.  
  164. }
  165.  
  166.  
  167.  
  168.  
  169.  
  170. int32_t main() {
  171.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  172.  
  173.     int t = 1;
  174.     cin >> t;
  175.     while (t--) {
  176.         solve();
  177.     }
  178.  
  179.     return 0;
  180. }
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
3
5
0 0 0 0 0 
12
2 -3 6 0 4 -5 6 0 2 3 4 1
11
8 -3 1 -6 4 -4 7 -7 2 -2 0
stdout
copy 
4 4
4 4
4 4
https://ideone.com/imNiPO
language:
C++14 (gcc 8.3)
created:
5 days 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!