Submission #71136465

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a),E##i=(b);i<=E##i;i++)
#define REV(i,a,b) for(int i=(a),E##i=(b);i>=E##i;i--)
#define CLOSE_TIE ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define psbk push_back
#define endl '\n'
template <typename T>
void _outval(string s,int p,const T &t) {cout<<s.substr(p,s.length()-p)<<'='<<t<<endl; }
template <typename T, typename... Args>
void _outval(string s,int p,const T &t,const Args &...rest){
    string n="";
    while(s[p]!=',') n+=s[p++];
    cout<<n<<'='<<t<<", ";
    _outval(s,p+1,rest...);
}
#define outval(...) _outval(#__VA_ARGS__,0,__VA_ARGS__)
#define outarr(a,be,ed)\
{cout<<(#a)<<": ";\
FOR(iiii,be,ed)cout<<'['<<iiii<<"]="<<a[iiii]<<(iiii<ed?", ":"\n");}
const int N=1e6+5;
string s;
int n,id[N],cnt;
char num[N];
ll ans,len[N];
signed main(){
    CLOSE_TIE
    cin>>s;
    n=s.size(); s='!'+s;
    id[1]=++cnt; len[id[1]]=1; num[1]=s[1];
    FOR(i,2,n){
        if(s[i]==s[i-1]) id[i]=id[i-1],++len[id[i]];
        else id[i]=++cnt,num[cnt]=s[i],len[cnt]=1;
    }
    //outarr(len,1,cnt); outarr(id,1,n); outarr(num,1,cnt);
    FOR(i,2,cnt){
        if(num[i]=='0') continue;
        if(num[i]-1!=num[i-1]) continue;
        ans+=min(len[i],len[i-1]);
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result