Submission #1143179

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143179		andreeavl	Walk (POI13_spa)	C++20	24 / 100	199 ms	184992 KiB

spa

#include <iostream>

using namespace std;
int n,k;
int st,dr,x;
bool v[10000000], b[10000000];
string start, finish, a;

void dfs(int y)
{
    v[y]=true;
    if(y==dr)
    {
        cout<<"TAK";
        exit(0);
    }
    for(int i=0; i<n; i++)
        if(v[(y^(1<<i))]==false && b[(y^(1<<i))]==false)
            dfs((y^(1<<i)));
}

int sch(string &s)
{
    int y=0;
    for(int i=0; i<(int)s.size(); i++)
    {
        if(s[i]=='1')
            y+=(1<<i);
    }
    return y;
}

int main()
{
    cin>>n>>k;
    cin>>start>>finish;
    st=sch(start);
    dr=sch(finish);
    for(int i=1; i<=k; i++)
    {
        cin>>a;
        x=sch(a);
        b[x]=true;
    }
    dfs(st);
    cout<<"NIE";
    return 0;
}

• 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