# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168044 | Muhammad_Aneeq | Walk (POI13_spa) | C++20 | 2021 ms | 327680 KiB |
/*
بسم الله الرحمن الرحيم
Author:
(:Muhammad Aneeq:)
*/
#include <iostream>
#include <map>
#warning check the output
using namespace std;
map<string,int>vis;
string x,y;
bool ans=0;
int n,k;
void dfs()
{
if (vis[x])
return;
if (ans)
return;
if (x==y)
{
ans=1;
return;
}
vis[x]=1;
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;
vis[z]=1;
}
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... |