제출 #1168069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168069		Faisal_Saqib	Walk (POI13_spa)	C++17	25 / 100	2391 ms	98164 KiB

spa

#include <bitset>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define ll long long
int n,k;
char c;
ll asp=0;
// 10000000040
bitset<2000000000> banned;
ll read()
{
    asp=0;
    for(int i=0;i<n;i++)
    {
        cin>>c;
        asp<<=1;
        asp+=c-'0';
    }
    return asp;
}
ll gcost(ll x,ll y)
{
    return __builtin_popcountll(x^y);
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    ll st=read(),ed=read();
    for(int i=0;i<k;i++)
    {
        banned[read()]=1;
    }
    queue<ll>pq;
    banned[st]=1;
    pq.push(st);
    ll op=0;
    while(pq.size())
    {
        ll x=pq.front();
        pq.pop();
        op++;
        if(x==ed)
        {
            cout<<"TAK"<<endl;
            return 0;
        }
        if(op*n >= 1e9)
        {
            break;
        }
        ll pw=1;
        for(int bi=0;bi<n;bi++)
        {
            ll y=x^pw;
            if(!banned[y])
            {
                banned[y]=1;
                pq.push(y);
            }
            pw<<=1;
        }
    }
    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: 13 / 13
• Subtask 8: 0 / 13