#include<bits/stdc++.h> using namespace std; // define #define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n"; #define ll long long #define ii pair <int , int> #define iii pair <int , ii> #define se second #define fi first #define all(v) (v).begin() , (v).end() #define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin()) #define bit(x,i) (((x) >> (i)) & 1LL) #define flip(x,i) ((x) ^ (1LL << (i))) #define ms(d,x) memset(d , x , sizeof(d)) #define exist __exist #define ends __ends #define visit visited #define left __left #define right __right #define prev __prev #define next __next #define sitingfake 1 #define orz 1 //constant const long long mod = 1e9 + 7; const long long linf = 4557430888798830399LL; const long long nlinf = -4485090715960753727LL; const int LOG = 20; const int inf = 1061109567; const int ninf = -1044266559; const int dx[] = {0 , -1 , 0 , 1}; const int dy[] = {-1 , 0 , 1 , 0}; template<typename T> bool maximize(T &a, const T &b) { if(a < b) {a = b; return 1;} return 0; } template<typename T> bool minimize(T &a, const T &b) { if(a > b) {a = b; return 1;} return 0; } void Plus(ll & a ,ll b) { b %= mod; a += b; if(a < 0) a += mod; a %= mod; return; } void Mul(ll & a, ll b) { (a *= (b % mod)) %= mod; return; } //code const int maxn = 1e6 + 7; string s; int n , k; int a[maxn] , b[maxn] , pref[2 * maxn] , timerA , timerB; namespace sub3 { int dp[2][5005]; int cost[5005][5005]; void compute() { for(int l = 1; l <= n; l++) { for(int r = l; r <= n; r++) { if(a[r] > b[l]) { cost[l][r] = cost[l][r - 1] + pref[a[r]] - pref[b[l] - 1]; } else cost[l][r] = cost[l][r - 1]; } } } void DnC(int l , int r, int optl , int optr , int cur) { if(l > r) return; int mid = (r + l) >> 1; int optk; dp[cur][mid] = inf; for(int i = optl; i <= min(mid , optr); i++) { if(minimize(dp[cur][mid] , dp[!cur][i - 1] + cost[i][mid])) { optk = i; } } DnC(l , mid - 1 , optl , optk , cur); DnC(mid + 1 , r , optk , optr , cur); } void solve() { ms(dp , 0x3f); dp[0][0] = 0; compute(); for(int i = 1; i <= n; i++) { dp[1][i] = cost[1][i]; } for(int i = 2; i <= k; i++) { DnC(i , n , 1 , n , i & 1); } cout << dp[k & 1][n]; } } namespace sub5 { ll cnt[2 * maxn]; ll sumpref[2 * maxn]; int pos[2 * maxn]; pair <ll , int> dp[maxn]; struct CHT { bool flag = 0; struct Line { ll a; ll b; int segments; pair <ll , int> val(ll x) { return {a * x + b , segments}; } double intersect(Line &other) { return ((other.b - b) * 1.0) / (1.0 * (a - other.a)); } friend bool bad(Line d1,Line d2,Line d3) { if(d1.intersect(d3) == d1.intersect(d2)) { if(d3.segments <= d2.segments) return 1; return 0; } return d1.intersect(d3) < d1.intersect(d2); //slope decreasing, find min <= //slope increasing, find max <= //else we must use LineContainer or Lichao Tree } }; deque<Line>dq; void AddLine(Line x) { while(dq.size() >= 2 && bad(dq[dq.size()-2] , dq.back() , x)) { dq.pop_back(); } dq.push_back(x); } pair <ll , int> get(ll x) { int l = 0,r = dq.size()-1 , mid = 0; while(l <= r) { mid =(r + l) >> 1; pair <ll , int> cur = dq[mid].val(x); if(mid > 0 && dq[mid-1].val(x) < cur) r = mid - 1;//min < else if(mid < dq.size()-1 && dq[mid+1].val(x) < cur) l = mid + 1;//min < else break; } return dq[mid].val(x); } }; ll cost(int l , int r) { if(a[r] < b[l]) return 0; return -pref[b[l] - 1] * (cnt[a[r]] - cnt[pos[l] - 1]) + sumpref[a[r]] - sumpref[pos[l] - 1]; } pair <ll , int> compute(ll lambda) { dp[0] = {0 , 0}; int it = 1; multiset <pair <ll ,int>> Min; Min.insert(dp[0]); CHT cht; for(int i = 1; i <= n; i++) { dp[i] = {linf , inf}; while(it <= i && b[it] <= a[i]) { cht.AddLine({-pref[b[it] - 1] , pref[b[it] - 1] * cnt[pos[it] - 1] - sumpref[pos[it] - 1] + dp[it - 1].fi , dp[it - 1].se }); cht.flag = 1; Min.erase(Min.find(dp[it - 1])); it++; } dp[i] = {linf , inf}; if(cht.flag) { pair <ll , int> val = cht.get(cnt[a[i]]); val.fi += lambda + sumpref[a[i]]; val.se++; minimize(dp[i] , val); } if(!Min.empty()) { pair <ll , int> val = *Min.begin(); val.fi += lambda; val.se++; minimize(dp[i] , val); } Min.insert(dp[i]); } return dp[n]; } void solve() { for(int i = 1; i <= 2 * n; i++) { if(s[i - 1] == 'A') { sumpref[i] = pref[i]; cnt[i] = 1; } sumpref[i] += sumpref[i - 1]; cnt[i] += cnt[i - 1]; } for(int i = 1; i <= n; i++) { pos[i] = max(a[i] , b[i]); } ll left = 0 , right = n * n , ans = 0; while(left <= right) { ll mid = (left + right) >> 1; if(compute(mid).se <= k) { ans = mid; right = mid - 1; } else left = mid + 1; } pair <ll , int> tmp = compute(ans); cout << tmp.fi - 1ll * ans * k; } } void solve(void) { cin >> n >> k; cin >> s; for(int i = 1; i <= 2 * n; i++) { pref[i] = pref[i - 1]; if(s[i - 1] == 'A') { a[++timerA] = i; } else { pref[i] += 1; b[++timerB] = i; } } sub5 :: solve(); } /** 5 3 AABABABBAB **/ signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "task" if(fopen(task".inp","r")) { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } int tc = 1; // cin >> tc; while(tc--) solve(); // execute; }

chorus.cpp: In function 'int main()':
chorus.cpp:297:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  297 |        freopen(task".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
chorus.cpp:298:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  298 |        freopen(task".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~