fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-11-10 21:48:45
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-11-10 21:59:16
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. // #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e9
  46. #define name "REMOVEPALIN"
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)1e6+10;
  54. string s;
  55.  
  56. namespace hungeazy {
  57.  
  58. 	int a[N][5],dp[N][5][5];
  59.  
  60. 	void solve(void)
  61. 	{	
  62. 		int n = sz(s);
  63. 		if (n == 1)
  64. 		{
  65. 			cout << 0;
  66. 			return;
  67. 		}
  68. 		if (n == 2)
  69. 		{
  70. 			if (s[0] == s[1]) cout << 1;
  71. 			else cout << 0;
  72. 			return;
  73. 		}
  74. 		FOR(i,1,n) a[i][2] = s[i-1]-'a';
  75. 		FOR(i,1,n)
  76. 			FOR(j,0,4)
  77. 				a[i][j] = (a[i][2]+j-2+26)%26;
  78. 		fill(dp,0x3f);
  79. 		FOR(i,0,4)
  80. 			FOR(j,0,4)
  81. 				if (a[1][i] != a[2][j])
  82. 					minimize(dp[2][i][j],abs(2-i)+abs(2-j));
  83. 		FOR(i,3,n)
  84. 			FOR(j,0,4)
  85. 				FOR(k,0,4)
  86. 					FOR(t,0,4)
  87. 						if (a[i][t] != a[i-2][j] and a[i][t] != a[i-1][k])
  88. 							minimize(dp[i][k][t],dp[i-1][j][k]+abs(2-t));
  89. 		int ans = oo;
  90. 		FOR(i,0,4)
  91. 			FOR(j,0,4) minimize(ans,dp[n][i][j]);
  92. 		cout << ans;
  93. 	}
  94.  
  95. }
  96.  
  97. bool M2;
  98. signed main()
  99. {
  100.     fast;
  101.     if (fopen(name".inp","r"))
  102.     {
  103.     	freopen(name".inp","r",stdin);
  104.     	freopen(name".out","w",stdout);
  105.     }
  106.     cin >> s;
  107.     hungeazy::solve();
  108.     time();
  109.     memory();
  110.     return 0;
  111. }
  112. // ██░ ██  █    ██  ███▄    █   ▄████
  113. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  114. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  115. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  116. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  117. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  118. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  119. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  120. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.02s 102216KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1000000000
stderr
copy 
-------------Time:21.842ms.
114.442 MB
https://ideone.com/GMhgJ8
language:
C++14 (gcc 8.3)
created:
13 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!