UESTC806 - Balloon Game Once More

电子科大校赛

神坑有木有，？里面的颜色可以填无限种，当时快疯了

博弈水题

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define MOD ((int)(1e9) + 7)
#define eps 1e-10
using namespace std;
typedef long long ll;
string str;
int Hash[210];
int main() {
    while (cin >> str) {
        char l, r;
        l = r = 0;
        memset(Hash, 0, sizeof(Hash));
        int cnt = 0, col = 0;
        for (int i = 0; i < str.size(); ++ i) {
            if (!Hash[str[i]] && str[i] != '?') {
                Hash[str[i]] = 1;
                col ++;
            }
            if (str[i] == '?') cnt ++;
        }
        bool flag;
        if (cnt) {
            for (int i = 0; i < str.size() - 1; ++ i) {
                if (str[i + 1] == '?') {
                    l = str[i]; break;
                }
            }
            for (int i = str.size()-1; i >= 0; -- i) {
                if (str[i - 1] == '?') {
                    r = str[i]; break;
                }
            }
            if (l && r && l == r) {
                if (col % 2) flag = 1;
                else flag = 0;
            }
            else {
                if (col % 2) {
                    flag = 1;
                }
                else {
                    if (cnt % 2) flag = 1;
                    else flag = 0;
                }
            }
        }
        else {
            if (col % 2) flag = 1;
            else flag = 0;
        }
        if (flag) puts("Yes");
        else puts("No");
    }
}