Submission #7867074

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

ll k;
string s;

void solve(){
    cin >> s;
    cin >> k;
    int n=s.length();
    ll l=1;
    vector<ll> vec;
    Rep(i,1,n){
        if (s[i]==s[i-1]){
            l++;
        }
        else{
            vec.push_back(l);
            l=1;
        }
    }
    vec.push_back(l);
    int m=vec.size();
    if (m==1){
        cout << n*k/2 << endl;
        return;
    }
    ll ans=0;
    if (s[0]==s[n-1]){
        ans+=vec[0]/2+vec[m-1]/2;
        ans+=(k-1)*((vec[0]+vec[m-1])/2);
        Rep(i,1,m-1){
            ans+=k*(vec[i]/2);
        }
    }
    else{
        rep(i,m){

            ans+=k*(vec[i]/2);
        }
    }
    cout << ans << endl;
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}

Submission Info

Judge Result