Codeforces1045I

Posted rrrr-wys

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Codeforces1045I相关的知识,希望对你有一定的参考价值。

Codeforces1045I


做法:如果至多有一种字母出现奇数次,则合法,因此把整个串用一个26位2进制数表示,对于每一个数,枚举可能的对应串的状态即可。

#include <bits/stdc++.h>
typedef long long ll;
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while( ! isdigit(c) ) { if(c == ‘-‘) f = -1; c = getchar(); }
    while( isdigit(c) ) { x = x*10 + c - ‘0‘; c = getchar(); }
    return x * f;
}
inline void write( ll x ) {
    if( x >= 10 ) write( x / 10 );
    putchar( x % 10 + ‘0‘ );
}
using namespace std;
int n, w;
char c;
ll ans = 0;
map< ll , int > M;
int main() {
    n = read();
    for ( int i = 1 ; i <= n ; ++ i ) {
        w = 0;
        c = getchar();
        while( c != ‘
‘ ) { w ^= ( 1 << ( c - ‘a‘ ) ); c = getchar(); }
        ans += M[ w ];
        for ( int j = 0 ; j < 26 ; ++ j ) 
            if( M.find( w ^ ( 1 << j ) ) != M.end() ) 
                ans += M[ w ^ ( 1 << j ) ];
        ++ M[ w ];
    }
    write( ans ); putchar( ‘
‘ );
    return 0;
}

以上是关于Codeforces1045I的主要内容,如果未能解决你的问题,请参考以下文章

[Codeforces Round #522 (Div. 2, based on Technocup 2019 Elimination Round 3)][C. Playing Piano](代码片段

c_cpp Codeforces片段

Codeforces 86C Genetic engineering(AC自动机+DP)

CodeForces 1005D Polycarp and Div 3(思维贪心dp)

(Incomplete) Codeforces 394 (Div 2 only)

CodeForces 931F Teodor is not a liar!