Submission #1143190

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143190		adimiclaus15	Walk (POI13_spa)	C++20	24 / 100	229 ms	50652 KiB

spa

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int n,m,i,j,k,l,a,b;char x[1<<22],w;
void red(int &x)
{
    x=0;
    for(i=0;i<n;i++)cin>>w,x=x*2+w-'0';
}
void df(int v)
{
    x[v]=2;
    for(int i=0;i<n;i++)
        if(x[v^(1<<i)]==0)
            df(v^(1<<i));
}
int main()
{
cin>>n>>m;
red(a),red(b);
if(a == b) {
  cout << "TAK";
  return 0;
}
//cout<<a<<' '<<b;
for(j=0;j<m;j++)
    red(k),x[k]=1;
df(a);
if(x[b]==2)
    cout<<"TAK";
    else cout<<"NIE";
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 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