제출 #1168309

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168309		Faisal_Saqib	Walk (POI13_spa)	C++17	12 / 100	5102 ms	327680 KiB

spa

#include <bitset>
#include <iostream>
#include <unordered_map>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
using namespace std;
#define ll long long
int n,k;
char c;
ll asp=0,np=0;
// 10000000040
// 2e9 = 2000000000
// my pc limit = 8589884992
bitset<2000000000> ban[2];
map<ll,int> compress;
ll camper(ll x)
{
    auto it=compress.find(x);
    if(it!=compress.end())return it->second;
    return compress[x]=np++;
}
ll read()
{
    asp=0;
    for(int i=0;i<n;i++)
    {
        cin>>c;
        asp<<=1;
        asp+=c-'0';
    }
    return asp;
}
ll pw2[70];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    pw2[0]=1;
    for(int i=1;i<=n;i++)
        pw2[i]=2ll*pw2[i-1];
    ll st=read(),ed=read();
    set<ll> fp;
    for(int i=0;i<k;i++)
    {
        ll c=read();
        fp.insert(c);
        // ban[0][c]=ban[1][c]=1;
    }
    // lets do a double sided bfs
    // better time complexity
    queue<ll>pq;
    ban[0][camper(st)]=1;
    pq.push(st);
    ban[1][camper(ed)]=1;
    pq.push(ed);
    ll op=0;
    while(pq.size())
    {
        ll x=pq.front();
        pq.pop();
        // op++;
        // ll x=xa.first;
        int cx=camper(x);
        if(ban[0][cx]&ban[1][cx])
        {
            cout<<"TAK"<<endl;
            return 0;
        }
        // if(op*n >= 2e9)
        // {
        //     break;
        // }
        for(int bi=0;bi<n;bi++)
        {
            ll y=x^pw2[bi];
            if(fp.find(y)!=fp.end())continue;
            int cy=camper(y);
            for(int at=0;at<2;at++)
            {
                if(ban[at][cx] and !ban[at][cy])
                {
                    if(ban[1-at][cy])
                    {
                        cout<<"TAK"<<endl;
                        return 0;
                    }
                    ban[at][cy]=1;
                    pq.push(y);
                }
            }
        }
    }
    cout<<"NIE"<<endl;
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13