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. // 6
  28. // 0 1 1 0 0 1
  29.  
  30.  
  31. vector<int> a;
  32.  
  33. int consistency1(int n){
  34.  
  35. 	vector<int> condensed;
  36.  
  37. 	for(int i=0; i<n; ){
  38. 		int j = i;
  39. 		while(j<n && a[j] == a[i]) j++;
  40. 		int ct = j-i;
  41. 		condensed.push_back(ct);
  42. 		i = j;
  43. 	}
  44.  
  45. 	int m = condensed.size();
  46. 	if(m==1) return 0;
  47.  
  48. 	int ans = 0;
  49. 	for(int i=1; i<m; i++){
  50. 		ans += min(condensed[i], condensed[i-1]);
  51. 	}
  52.  
  53. 	return ans;
  54. }
  55.  
  56.  
  57.  
  58.  
  59. int consistency2(int n){
  60.  
  61. 	vector<int> zero(n+1);
  62. 	vector<int> one(n+1);
  63.  
  64. 	int ans = 0;
  65. 	for(int i=0; i<n; i++){
  66. 		if(a[i] == 0){
  67. 			zero[i+1] = zero[i] + 1;
  68. 			int ct = zero[i+1];
  69.  
  70. 			if(one[i+1-ct] >= ct) ans++;
  71. 		}
  72. 		else{
  73. 			one[i+1] += one[i] + 1;
  74. 			int ct = one[i+1];
  75.  
  76. 			if(zero[i+1-ct] >= ct) ans++;
  77. 		}
  78. 	}
  79.  
  80.  
  81. 	return ans;
  82. }
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94.  
  95.  
  96.  
  97.  
  98. int practice(int n){
  99.  
  100.  
  101.     return 0;
  102. }
  103.  
  104.  
  105.  
  106.  
  107.  
  108. void solve() {
  109.  
  110.     int n;
  111.     cin>> n;
  112.  
  113.     a.resize(n);
  114.     for(int i=0; i<n; i++) cin >> a[i];
  115.  
  116.     cout << consistency1(n) << " " <<  consistency2(n)  << endl;
  117.  
  118.  
  119. }
  120.  
  121.  
  122.  
  123.  
  124.  
  125. int32_t main() {
  126.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  127.  
  128.     int t = 1;
  129.     // cin >> t;
  130.     while (t--) {
  131.         solve();
  132.     }
  133.  
  134.     return 0;
  135. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
6
0 1 1 0 0 1
stdout
copy 
4 4
https://ideone.com/TKsgrr
language:
C++14 (gcc 8.3)
created:
4 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!