# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
201666 |
2020-02-11T16:39:50 Z |
cheetose |
Walk (POI13_spa) |
C++11 |
|
5000 ms |
239752 KB |
#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];
unordered_set<ll> S;
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 g(ll xx, ll yy)
{
int T = n*k, cnt = 0;
queue<int> q;
unordered_set<ll> chk;
q.push(xx);
chk.insert(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 (S.find(y) == S.end() && chk.find(y)==chk.end())
{
cnt++;
q.push(y);
chk.insert(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();
S.insert(x);
}
puts(g(x, y) && g(y, x) ? "TAK" : "NIE");
}
Compilation message
spa.cpp: In function 'll r()':
spa.cpp:68:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", s);
~~~~~^~~~~~~~~
spa.cpp: In function 'int main()':
spa.cpp:99:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &k, &n);
~~~~~^~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
376 KB |
Output is correct |
2 |
Correct |
6 ms |
376 KB |
Output is correct |
3 |
Correct |
6 ms |
504 KB |
Output is correct |
4 |
Correct |
21 ms |
1144 KB |
Output is correct |
5 |
Correct |
13 ms |
1144 KB |
Output is correct |
6 |
Correct |
4 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
256 KB |
Output is correct |
8 |
Correct |
5 ms |
256 KB |
Output is correct |
9 |
Correct |
4 ms |
256 KB |
Output is correct |
10 |
Correct |
5 ms |
256 KB |
Output is correct |
11 |
Correct |
106 ms |
13676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
149 ms |
17160 KB |
Output is correct |
2 |
Correct |
249 ms |
17468 KB |
Output is correct |
3 |
Execution timed out |
5065 ms |
143832 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
4012 KB |
Output is correct |
2 |
Correct |
66 ms |
7224 KB |
Output is correct |
3 |
Correct |
119 ms |
7928 KB |
Output is correct |
4 |
Correct |
31 ms |
2428 KB |
Output is correct |
5 |
Correct |
19 ms |
2212 KB |
Output is correct |
6 |
Correct |
6 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
435 ms |
16224 KB |
Output is correct |
2 |
Incorrect |
90 ms |
5108 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5027 ms |
239752 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
5113 ms |
227184 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
118 ms |
13628 KB |
Output is correct |
2 |
Execution timed out |
5050 ms |
222872 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
121 ms |
13496 KB |
Output is correct |
2 |
Correct |
47 ms |
5820 KB |
Output is correct |
3 |
Correct |
3576 ms |
77924 KB |
Output is correct |
4 |
Correct |
69 ms |
9788 KB |
Output is correct |
5 |
Correct |
4543 ms |
159560 KB |
Output is correct |