| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1168071 | Muhammad_Aneeq | Walk (POI13_spa) | C++20 | 2943 ms | 327680 KiB | 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/
#include <iostream>
#include <map>
#include <set>
#warning check the output
using namespace std;
set<string>s;
string x,y;
bool ans=0;
int n,k;
void dfs()
{
    if (s.find(x)!=s.end())
        return;
    if (ans)
        return;
    if (x==y)
    {
        ans=1;
        return;
    }
    s.insert(x);
    for (int i=0;i<n;i++)
    {
        x[i]=(x[i]=='0'?'1':'0');
        dfs();
        x[i]=(x[i]=='0'?'1':'0');
    }
}
inline void solve()
{
    cin>>n>>k;
    cin>>x>>y;
    for (int i=0;i<k;i++)
    {
        string z;
        cin>>z;
        s.insert(z);
    }
    dfs();
    if (ans)
        cout<<"TAK";
    else
        cout<<"NIE";
    cout<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
