Submission #75424343

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ull unsigned long long
#define inf 1e12
#define eps 1e-9
#define endl "\n"
#define il inline
#define ls 2*k
#define rs 2*k+1
using namespace std;
const int N=2e6+5,M=3e6+5;
const int mod=998244353;
inline int read(){
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n;
string s;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int tc=1; 
	while(tc--){
		cin>>s;
		n=s.size();
		s=" "+s; 
		int ans=0,r=1;
		for(int l=1;l<=n;l++){
			if(r<l) r=l;
			while(r<=n && ((r-l+1)<=1 || s[r]!=s[r-1])) ++r;
			ans=(ans+r-l)%mod;
		}
		cout<<ans<<'\n';
	}
	
	return 0;
}

Submission Info

Judge Result