| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 201684 | cheetose | Walk (POI13_spa) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
char s[66];
const int m = 1000000;
Vll in[m],chk[m];
int n, k;
ll r()
{
scanf("%s", s);
ll res = 0;
fup(i, 0, k - 1, 1)res = res * 2 + s[i] - '0';
return res;
}
bool f(Vi &v, ll x)
{
for (ll y : v)if (y == x)return 1;
return 0;
}
bool g(ll xx, ll yy)
{
fup(i, 0, m - 1, 1)chk[i].clear();
int T=m,cnt = 0;
queue<ll> q;
q.push(xx);
chk[xx%m].pb(xx);
while (!q.empty() && cnt<T)
{
ll x = q.front();
q.pop();
fup(i, 0, k - 1, 1)
{
ll y = x ^ (1LL << i);
if (yy == y)return 1;
if (!f(in[y%m],y) && !f(chk[y%m],y))
{
cnt++;
q.push(y);
chk[y%m].pb(y);
}
}
}
return cnt >= T;
}
int main() {
scanf("%d%d", &k, &n);
ll x = r(), y = r();
fup(i, 0, n - 1, 1)
{
ll x = r();
in[x%m].pb(x);
}
puts(g(x, y) && g(y, x) ? "TAK" : "NIE");
}