#827116 (C++17) No.2168 双頭ヒドラゲーム

• 問題: No.2168 双頭ヒドラゲーム
• ユーザー: tko919
• 提出日時: 2022-12-20 00:48:29
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 6,540 bytes
• コンパイル時間: 3,014 ms
• コンパイル使用メモリ: 231,980 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-29 02:37:48
• 合計ジャッジ時間: 3,863 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	3 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	WA	-
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	WA	-
testcase_23	WA	-

ソースコード

#line 1 "library/Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
#line 2 "library/Utility/fastio.hpp"
#include <unistd.h>

class FastIO{
    static constexpr int L=1<<16;
    char rdbuf[L];
    int rdLeft=0,rdRight=0;
    inline void reload(){
        int len=rdRight-rdLeft;
        memmove(rdbuf,rdbuf+rdLeft,len);
        rdLeft=0,rdRight=len;
        rdRight+=fread(rdbuf+len,1,L-len,stdin);
    }
    inline bool skip(){
        for(;;){
            while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;
            if(rdLeft==rdRight){
                reload();
                if(rdLeft==rdRight)return false;
            }
            else break;
        }
        return true;
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){
            x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));
        }
        return true;
    }
    template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){
        if(!skip())return false;
        if(rdLeft+20>=rdRight)reload();
        bool neg=false;
        if(rdbuf[rdLeft]=='-'){
            neg=true;
            rdLeft++;
        }
        x=0;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x=x*10+(rdbuf[rdLeft++]^48);
        }
        if(rdbuf[rdLeft]!='.')return true;
        rdLeft++;
        T base=.1;
        while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){
            x+=base*(rdbuf[rdLeft++]^48);
            base*=.1;
        }
        if(neg)x=-x;
        return true;
    }
    inline bool _read(char& x){
        if(!skip())return false;
        if(rdLeft+1>=rdRight)reload();
        x=rdbuf[rdLeft++];
        return true;
    }
    inline bool _read(string& x){
        if(!skip())return false;
        for(;;){
            int pos=rdLeft;
            while(pos<rdRight and rdbuf[pos]>' ')pos++;
            x.append(rdbuf+rdLeft,pos-rdLeft);
            if(rdLeft==pos)break;
            rdLeft=pos;
            if(rdLeft==rdRight)reload();
            else break;
        }
        return true;
    }
    template<typename T>inline bool _read(vector<T>& v){
        for(auto& x:v){
            if(!_read(x))return false;
        }
        return true;
    }

    char wtbuf[L],tmp[50];
    int wtRight=0;
    inline void flush(){
        fwrite(wtbuf,1,wtRight,stdout);
        wtRight=0;
    }
    inline void _write(const char& x){
        if(wtRight>L-32)flush();
        wtbuf[wtRight++]=x;
    }
    inline void _write(const string& x){
        for(auto& c:x)_write(c);
    }
    template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){
        if(wtRight>L-32)flush();
        if(x==0){
            _write('0');
            return;
        }
        else if(x<0){
            _write('-');
            if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {
                switch (sizeof(x)) {
                case 2: _write("32768"); return;
                case 4: _write("2147483648"); return;
                case 8: _write("9223372036854775808"); return;
                }
            }
            x=-x;
        }
        int pos=0;
        while(x!=0){
            tmp[pos++]=char((x%10)|48);
            x/=10;
        }
        rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];
        wtRight+=pos;
    }
    template<typename T>inline void _write(const vector<T>& v){
        rep(i,0,v.size()){
            if(i)_write(' ');
            _write(v[i]);
        }
    }
public:
    FastIO(){}
    ~FastIO(){flush();}
    inline void read(){}
    template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){
        assert(_read(head));
        read(tail...); 
    }
    template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\n');}
    template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){
        if(space)_write(' ');
        _write(head);
        write<ln,true>(tail...); 
    }
};

/**
 * @brief Fast IO
 */
#line 3 "sol.cpp"


FastIO io;
int main(){
    using P=pair<string,int>;
    map<P,string> memo;
    auto dfs=[&](auto& dfs,string& t,int n)->string{
        if(t.empty())return "";
        if(memo.count({t,n}))return memo[{t,n}];
        string t0,t1,t2;
        int i=0;
        assert(t[i++]=='(');
        for(int lev=0;;i++){
            if(lev==0 and t[i]=='|'){i++; break;}
            t0.push_back(t[i]);
            if(t[i]=='(')lev++;
            if(t[i]==')')lev--;
        }
        for(int lev=0;;i++){
            if(lev==0 and t[i]==')'){i++; break;}
            t1.push_back(t[i]);
            if(t[i]=='(')lev++;
            if(t[i]==')')lev--;
        }
        for(;i<t.size();i++)t2.push_back(t[i]);

        string ret;
        if(t2.size())ret="("+t0+"|"+t1+")"+dfs(dfs,t2,n);
        if(t0.empty() and t1.empty() and t2.empty())ret="";
        if(t0.empty() and t2.empty() and t1.size()){
            if(n==0)ret="(|"+dfs(dfs,t1,0)+")";
            else ret="(|"+dfs(dfs,t1,n)+")"+dfs(dfs,t,n-1);
        }
        if(t1.empty() and t2.empty() and t0.size()){
            if(n==0)ret="("+dfs(dfs,t0,0)+"|)";
            else ret="("+dfs(dfs,t0,n)+"|"+dfs(dfs,t,n-1)+")";
        }
        if(t2.empty() and t0.size() and t1.size()>=3 and t1.substr(t1.size()-3,3)=="(|)"){
            if(n==0)ret="("+dfs(dfs,t0,0)+"|("+t0+"|"+dfs(dfs,t1,0)+")(|))";
            else ret="("+dfs(dfs,t0,n)+"|"+dfs(dfs,t,n-1)+")";
        }
        if(t2.empty() and t0.size() and t1.size() and (t1.size()<=2 or t1.substr(t1.size()-3,3)!="(|)")){
            ret="("+t0+"|"+dfs(dfs,t1,n)+")";
        }
        return memo[{t,n}]=ret;
    };
    
    
    string S,T;
    io.read(S,T);
    rep(n,0,10){
        if(dfs(dfs,S,n)==T){
            io.write(0);
            return 0;
        }
    }
    io.write(1);
    return 0;
}