Submission #230138

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
230138	2020-05-08T16:59:36 Z	xiaowuc1	Walk (POI13_spa)	C++14	36 / 100	5000 ms	249376 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;
}
vector<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)) 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();
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	8 ms	512 KB	Output is correct
4	Correct	19 ms	1208 KB	Output is correct
5	Correct	11 ms	1152 KB	Output is correct
6	Correct	4 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	4 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	68 ms	2296 KB	Output is correct

Subtask #2
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	131 ms	2828 KB	Output is correct
2	Correct	336 ms	8524 KB	Output is correct
3	Execution timed out	5083 ms	235652 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	61 ms	7484 KB	Output is correct
3	Correct	113 ms	7484 KB	Output is correct
4	Correct	28 ms	2388 KB	Output is correct
5	Correct	17 ms	2352 KB	Output is correct
6	Correct	5 ms	512 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	67 ms	5000 KB	Output is correct
4	Correct	273 ms	14536 KB	Output is correct
5	Correct	140 ms	14348 KB	Output is correct

Subtask #5
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	53 ms	1400 KB	Output is correct
2	Correct	4792 ms	244520 KB	Output is correct
3	Execution timed out	5076 ms	249376 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #6
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	50 ms	1152 KB	Output is correct
2	Correct	1038 ms	63572 KB	Output is correct
3	Correct	2000 ms	63808 KB	Output is correct
4	Execution timed out	5061 ms	163984 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #7
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	87 ms	2168 KB	Output is correct
2	Execution timed out	5073 ms	235880 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #8
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	88 ms	2168 KB	Output is correct
2	Correct	73 ms	1792 KB	Output is correct
3	Correct	3156 ms	82400 KB	Output is correct
4	Execution timed out	5063 ms	169356 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Submission #230138

Compilation message