# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
230136 |
2020-05-08T16:57:19 Z |
xiaowuc1 |
Walk (POI13_spa) |
C++14 |
|
5000 ms |
249044 KB |
#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;
}
unordered_set<ll> bad;
int n, k;
bool finite(ll src, ll snk) {
unordered_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) || bad.count(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();
for(int i = 0; i < k; i++) {
bad.insert(parse());
}
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();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
512 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
3 |
Correct |
7 ms |
512 KB |
Output is correct |
4 |
Correct |
17 ms |
1280 KB |
Output is correct |
5 |
Correct |
11 ms |
1280 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
99 ms |
9272 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
156 ms |
12472 KB |
Output is correct |
2 |
Correct |
266 ms |
14272 KB |
Output is correct |
3 |
Execution timed out |
5080 ms |
241884 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
512 KB |
Output is correct |
2 |
Correct |
57 ms |
7868 KB |
Output is correct |
3 |
Correct |
106 ms |
7868 KB |
Output is correct |
4 |
Correct |
28 ms |
2480 KB |
Output is correct |
5 |
Correct |
17 ms |
2480 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
768 KB |
Output is correct |
2 |
Correct |
6 ms |
512 KB |
Output is correct |
3 |
Correct |
70 ms |
5128 KB |
Output is correct |
4 |
Correct |
285 ms |
14920 KB |
Output is correct |
5 |
Correct |
138 ms |
14732 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
71 ms |
6408 KB |
Output is correct |
2 |
Execution timed out |
5067 ms |
249044 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
4368 KB |
Output is correct |
2 |
Correct |
1025 ms |
64340 KB |
Output is correct |
3 |
Correct |
1964 ms |
64340 KB |
Output is correct |
4 |
Execution timed out |
5077 ms |
166032 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
109 ms |
8592 KB |
Output is correct |
2 |
Execution timed out |
5081 ms |
241964 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
137 ms |
8468 KB |
Output is correct |
2 |
Correct |
55 ms |
4104 KB |
Output is correct |
3 |
Correct |
3383 ms |
84948 KB |
Output is correct |
4 |
Execution timed out |
5072 ms |
177652 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |