Submission #782913

#TimeUsernameProblemLanguageResultExecution timeMemory
782913NemanjaSo2005Chorus (JOI23_chorus)C++17
0 / 100
1 ms312 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; ll N,K,kol[1000005]; string A,B; vector<int> pa,pb; int main(){ cin>>N>>K; cin>>A; int pok=0; for(int it=1;it<=N;it++){ pok++; if(pok==K+1) pok=1; kol[pok]++; } for(int i=1;i<=K;i++){ for(int it=1;it<=kol[i];it++) B.push_back('A'); for(int it=1;it<=kol[i];it++) B.push_back('B'); } for(int i=0;i<2*N;i++){ if(A[i]=='A') pa.push_back(i); if(B[i]=='A') pb.push_back(i); } ll kol=0; for(int i=0;i<N;i++) kol+=max(pa[i]-pb[i],0); cout<<kol<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...