# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1143325 | Stormtrooper007 | Walk (POI13_spa) | C++20 | 0 ms | 0 KiB |
#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[i]=='1')
{
aux+=(1<<p);
}
p++;
}
used[aux]=1;
}
queue<string>q;
used[st]=1;
q.push(st);
while(!q.empty())
{
string str=q.front();
p=0;
for(int j=n-1;j>=0;j++)
{
if(str[i]=='1')
{
aux+=(1<<p);
}
p++;
}
}
if(mp.find(f)==mp.end())
{
cout<<"NIE";
}
else
{
cout<<"TAK";
}
return 0;
}