#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>
using namespace std;
// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define derr if(1) cerr
typedef vector<int> vi;
// END NO SAD
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<vector<ll>> matrix;
typedef pair<int, pii> state;
ll parse() {
string s;
cin >> s;
ll ret = 0;
for(int i = 0; i < sz(s); i++) {
ret <<= 1;
ret |= s[i] == '1';
}
return ret;
}
vector<ll> bad;
int n, k;
bool finite(ll src, ll snk) {
set<ll> s;
vector<ll> all;
all.reserve(n*k+n+1);
all.push_back(src);
s.insert(src);
for(int i = 0; i < sz(all) && sz(all) <= n*k; i++) {
for(int j = 0; j < n; j++) {
ll curr = all[i] ^ (1LL << j);
if(s.count(curr)) continue;
auto it = lower_bound(all(bad), curr);
if(it != bad.end() && *it == curr) continue;
s.insert(curr);
all.push_back(curr);
}
}
return !s.count(snk) && sz(all) <= n*k;
}
void solve() {
cin >> n >> k;
ll src = parse();
ll snk = parse();
bad.reserve(k);
for(int i = 0; i < k; i++) {
bad.push_back(parse());
}
sort(all(bad));
if(finite(src, snk) || finite(snk, src)) cout << "NIE\n";
else cout << "TAK\n";
}
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
7 ms |
384 KB |
Output is correct |
3 |
Correct |
13 ms |
512 KB |
Output is correct |
4 |
Correct |
55 ms |
1268 KB |
Output is correct |
5 |
Correct |
28 ms |
1152 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
4 ms |
384 KB |
Output is correct |
11 |
Correct |
77 ms |
2556 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
153 ms |
2856 KB |
Output is correct |
2 |
Correct |
526 ms |
7672 KB |
Output is correct |
3 |
Execution timed out |
5070 ms |
106872 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
110 ms |
8056 KB |
Output is correct |
3 |
Correct |
229 ms |
8056 KB |
Output is correct |
4 |
Correct |
55 ms |
2620 KB |
Output is correct |
5 |
Correct |
28 ms |
2688 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
99 ms |
5624 KB |
Output is correct |
4 |
Correct |
388 ms |
14932 KB |
Output is correct |
5 |
Correct |
178 ms |
14968 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
55 ms |
1520 KB |
Output is correct |
2 |
Execution timed out |
5071 ms |
258912 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
48 ms |
1152 KB |
Output is correct |
2 |
Correct |
1172 ms |
68792 KB |
Output is correct |
3 |
Correct |
2305 ms |
68612 KB |
Output is correct |
4 |
Execution timed out |
5080 ms |
188340 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
98 ms |
2352 KB |
Output is correct |
2 |
Execution timed out |
5069 ms |
141784 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
99 ms |
2168 KB |
Output is correct |
2 |
Correct |
105 ms |
1912 KB |
Output is correct |
3 |
Execution timed out |
5078 ms |
94764 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |