Submission #1143349

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143349		Stormtrooper007	Walk (POI13_spa)	C++20	12 / 100	206 ms	3880 KiB

spa

#include <bits/stdc++.h>

using namespace std;
bitset<5000000>used;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    int n,m;
    cin>>n>>m;
    string s;
    string f;
    int st=0,fn=0;
    cin>>s>>f;
    int p=0;
    for(int i=n-1;i>=0;i--)
    {
        if(s[i]=='1')
        {
            st+=(1<<p);
        }
        p++;
    }
    p=0;
    for(int i=n-1;i>=0;i--)
    {
        if(f[i]=='1')
        {
            fn+=(1<<p);
        }
        p++;
    }
    for(int i=0;i<m;i++)
    {
        string str;
        cin>>str;
        int aux=0;
        p=0;
        for(int j=n-1;j>=0;j--)
        {
            if(str[j]=='1')
            {
                aux+=(1<<p);
            }
            p++;
        }
        //cout<<aux<<"na\n";
        used[aux]=1;
    }
    if(st==fn)
    {
        cout<<"TAK";
        return 0;
    }
    queue<int>q;
    used[st]=1;
    q.push(st);
    while(!q.empty())
    {
        int nr=q.front();
        q.pop();
        p=0;
        int aux=nr;
        for(int j=n-1;j>=0;j--)
        {
            if(!(nr&(1<<p)))
            {
                aux+=(1<<p);
            }
            else
            {
                aux-=(1<<p);
            }
            if(!used[aux])
            {
                used[aux]=1;
                q.push(aux);
            }
            if(!(nr&(1<<p)))
            aux-=(1<<p);
            else
            aux+=(1<<p);
            p++;
        }
       // cout<<nr<<'\n';
    }
    if(used[fn]==0)
    {
        cout<<"NIE";
    }
    else
    {
        cout<<"TAK";
    }
    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