D - Three Days Ago (atcoder.jp)
求连续区间[l,r]数字数字出现次数均为偶数次的区间个数。
输入1
20230322
输出1
4
输入2
0112223333444445555556666666777777778888888889999999999
输出2
185
输入3
3141592653589793238462643383279502884197169399375105820974944
输出3
9
#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =5e5+ 10,M = N * 2,base =400 ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;
char g[N];
int s[N];
inline void solve()
{
cin >> g+1;
int n = strlen(g +1 ) ;
fu(i,1,n)
{
int x = g[i] - '0';
int v = 1 << x;
s[i] = s[i-1] ^ v ;
}
LL ans =0;
map<int,int> mp ;
mp[0] ++ ;
fu(i,1,n)
{
ans += mp[s[i]];
// 前面的 和当前出现数 的个数相同的情况
mp[s[i]] ++;
}
cout<< ans << endl;
}
signed main()
{
// freopen("1.txt","r",stdin);
// #define int long long
ios
// cout << fixed<<setprecision(2);
int t=1;
// cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Case #";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}