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.  
  28.  
  29.  
  30. string a;
  31.  
  32. int consistency(int n){
  33.  
  34.  
  35. unordered_set<string> st = {
  36. "1",
  37. "101",
  38. "11001",
  39. "1111101",
  40. "1001110001",
  41. "110000110101",
  42. "11110100001001"
  43. };
  44. vector<int> dp(n+1, INF);
  45. dp[0] = 0;
  46. for(int i=1; i<=n; i++){
  47. int j=i-1;
  48. while(j>=0){
  49. string str = a.substr(j, i-j);
  50. if(st.count(str)){
  51. dp[i] = min(dp[i], dp[j] + 1);
  52. }
  53. j--;
  54. }
  55. }
  56.  
  57. if(dp[n] == INF) return -1;
  58. return dp[n];
  59.  
  60. }
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76. int practice(int n){
  77.  
  78.  
  79. return 0;
  80. }
  81.  
  82.  
  83.  
  84.  
  85.  
  86. void solve() {
  87.  
  88. int n;
  89.  
  90. cin >> a;
  91. n = a.size();
  92.  
  93. cout << consistency(n) << endl;
  94.  
  95.  
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102. int32_t main() {
  103. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  104.  
  105. int t = 1;
  106. // cin >> t;
  107. while (t--) {
  108. solve();
  109. }
  110.  
  111. return 0;
  112. }
Success #stdin #stdout 0.01s 5304KB
stdin
101110111001
stdout
4