Codeforces/codeforces/1535/C.cpp at master · Intruderp/Codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#define vi vector<int>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
#define F first
#define S second
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define pr(x) cout<<x<<'\n'; return ;
#define pry  cout<<"YES\n";return ;
#define prn  cout<<"NO\n"; return ;
#define all(v) v.begin(),v.end()
#define  loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
    int n,ans=0,x,y,z,a,b;
    string s;
    cin>>s;
    map<int,vi> m;
    n=s.length();
    loop(i,0,n)
    {
        if(s[i]=='0')
        {
            if(i%2)
            m[1].pb(i);
            else
            m[2].pb(i);
        }
        else if(s[i]=='1')
        {
            if(i%2)
            m[3].pb(i);
            else
            m[4].pb(i);
        }
    }
    loop(i,1,5)
    m[i].pb(n);
    loop(i,0,n)
    {
        a=0;
        x=0,y=0,z=0;
        if(s[i]=='0')
        {
            if(i%2)
            {
                auto it=upper_bound(all(m[2]),i);
                x=*it;
                auto it2=upper_bound(all(m[3]),i);
                y=*it2;
            }
            else
            {
                auto it=upper_bound(all(m[1]),i);
                x=*it;
                auto it2=upper_bound(all(m[4]),i);
                y=*it2;
            }
            //cout<<"here "<<x<<' '<<y<<endl;
            z=min(x,y);
            a=z-i;
        }
        else if(s[i]=='1')
        {
            if(i%2)
            {
                auto it=upper_bound(all(m[4]),i);
                x=*it;
                auto it2=upper_bound(all(m[1]),i);
                y=*it2;
            }
            else
            {
                auto it=upper_bound(all(m[3]),i);
                x=*it;
                auto it2=upper_bound(all(m[2]),i);
                y=*it2;
            }
            z=min(x,y);
            a=z-i;
        }
        else
        {
            int a1=0,a2=0;
            if(i%2)
            {
                auto it=upper_bound(all(m[2]),i);
                x=*it;
                auto it2=upper_bound(all(m[3]),i);
                y=*it2;
            }
            else
            {
                auto it=upper_bound(all(m[1]),i);
                x=*it;
                auto it2=upper_bound(all(m[4]),i);
                y=*it2;
            }
            z=min(x,y);
            a1=z-i;
            if(i%2)
            {
                auto it=upper_bound(all(m[4]),i);
                x=*it;
                auto it2=upper_bound(all(m[1]),i);
                y=*it2;
            }
            else
            {
                auto it=upper_bound(all(m[3]),i);
                x=*it;
                auto it2=upper_bound(all(m[2]),i);
                y=*it2;
            }
            z=min(x,y);
            a2=z-i;
            a=max(a1,a2);
        }
        ans+=a;
        //cout<<a<<endl;
    }
    pr(ans)
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    test
    solve();
    return 0;
}