提出 #59866417

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

using ull = unsigned long long;

using ll = long long;

const int N = 12;
map<pair<ull, int>, int> mp;

pair<ull, int> tr(vector<int> a, vector<int> b, vector<int> c, int opt) {
    ull tr = 0;
    for (int i : a) tr = tr * 13331 + i;
    tr *= 23337;
    for (int i : b) tr = tr * 741123 + i;
    tr *= 154154;
    for (int i : c) tr = tr * 8585821 + i;
    tr *= 23474747;
    return {tr, opt};
}

int dfs(vector<int> a, vector<int> b, vector<int> c,int tp) {
    // for (int i:a) cerr<<i<<' ';
    // cerr<< " |  ";
    // for (int i:b) cerr<<i<<' ';
    // cerr<< " |  ";
    // for (int i:c) cerr<<i<<' ';
    // cerr<< " |  ";
    // cerr<<'\n';
    // cerr << tr(a,b,c,tp).first<<'\n';
    if(mp.count(tr(a,b,c,tp))) return mp[tr(a,b,c,tp)];
    if (tp==0){
        if(a.size()==0){
            return 2;
        }
        // cerr<<"tp=0!"<<a.size()<<'\n';
        bool flg=0;
        for(int i=0;i<a.size();i++){
            vector<int> t1, t2;
            t1 = a;
            t1.erase(t1.begin()+i);

            if(dfs(t1,b,c,tp^1)==2)flg=1;
            for(int j=0;j<c.size();j++){
                // cerr<<j<<' '<<i<<'\n';
                if(c[j]<a[i]){
                    t1.push_back(c[j]);
                    t2 = c;
                    t2.erase(t2.begin()+j);
                    // cerr<<"tr(a,c):";
                    // for(int i:t1)cerr<<i<<' ';
                    // cerr<<'|';
                    // for(int i:t2)cerr<<i<<' ';
                    // cerr<<'\n';
                    if(dfs(t1,b,t2,tp^1)==2)flg=1;
                    t1.pop_back();
                }
            }
        }
        if(flg==0){
            mp[tr(a,b,c,tp)] = 2;
            return 2;
        } else{
            mp[tr(a,b,c,tp)] = 1;
            return 1;
        }
    }else{
        if(b.size()==0){
            return 2;
        }
        
        bool flg=0;
        for(int i=0;i<b.size();i++){
            // cerr<<i<<'\n';
            vector<int> t1, t2;
            t1 = b;
            t1.erase(t1.begin()+i);

            if(dfs(a,t1,c,tp^1)==2)flg=1;
            for(int j=0;j<c.size();j++){
                if(c[j]<b[i]){
                    t1.push_back(c[j]);
                    t2 = c;
                    t2.erase(t2.begin()+j);
                    if(dfs(a,t1,t2,tp^1)==2)flg=1;
                    t1.pop_back();
                }
            }
        }
        if(flg==0){
            mp[tr(a,b,c,tp)] = 2;
            return 2;
        } else{
            mp[tr(a,b,c,tp)] = 1;
            return 1;
        }
    }
}



int main(){
    int n,m,l;
    vector<int>a,b,c;
    cin>>n>>m>>l;
    while(n--){
        int x;
        cin>>x;
        a.push_back(x);
    }
    while(m--){
        int x;
        cin>>x;
        b.push_back(x);
    }
    while(l--){
        int x;
        cin>>x;
        c.push_back(x);
    }
    if(dfs(a,b,c,0) == 1) cout << "Takahashi";
    else cout<<"Aoki";


    

    return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int dfs(std::vector<int>, std::vector<int>, std::vector<int>, int)’:
Main.cpp:39:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   39 |         for(int i=0;i<a.size();i++){
      |                     ~^~~~~~~~~
Main.cpp:45:26: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   45 |             for(int j=0;j<c.size();j++){
      |                         ~^~~~~~~~~
Main.cpp:74:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   74 |         for(int i=0;i<b.size();i++){
      |                     ~^~~~~~~~~
Main.cpp:81:26: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   81 |             for(int j=0;j<c.size();j++){
      |                         ~^~~~~~~~~

ジャッジ結果