Submission #20955024

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)

int main() {
    int n;
    std::string s,x;
    std::cin >> n >> s >> x;
    std::vector dp(n+1, std::vector<int>(7,-1));
    std::vector<int> ten(n,1);
    rep(i,0,n-1) {
        ten[i+1] = ten[i]*10%7;
    }
    auto f = [&](auto f, int i, int mod) -> int {
        if(dp[i][mod] >= 0) return dp[i][mod];
        if(i == n) return dp[i][mod] = ( mod == 0 ) ? 1 : 0;
        int c = ten[n-1-i]*(s[i]-'0')%7;
        if(x[i] == 'T') {
            dp[i][mod] = std::max(f(f, i+1, mod), f(f, i+1, (mod+c)%7));
        }
        else {
            dp[i][mod] = std::min(f(f, i+1, mod), f(f, i+1, (mod+c)%7));
        }
        return dp[i][mod];
    };
    if(f(f, 0, 0)) {
        std::cout << "Takahashi\n";
    }
    else {
        std::cout << "Aoki\n";
    }
}

Submission Info

Judge Result