oj.uz

Submission #316623

# Submission time Handle Problem Language Result Execution time Memory
316623 2020-10-26T23:14:47 Z thecodingwizard Walk (POI13_spa) C++11
74 / 100
 4780 ms 262148 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int n, k; 
unordered_set<ll> dead;

ll read() {
    string s; cin >> s;
    ll num = 0;
    for (int i = n-1; i >= 0; i--) {
        if (s[n-1-i] == '1') {
            num |= (1LL << i);
        }
    }
    return num;
}

ll s[5000001];
// return true if a can reach b or if a can reach at least ct nodes
bool solve(ll a, ll b, int ct) {
    unordered_set<ll> vis;

    int idx = 0;
    s[idx] = a;
    vis.insert(a);
    --ct;

    while (idx >= 0) {
        ll u = s[idx--];
        for (int i = 0; i < n; i++) {
            ll v = u ^ (1LL << i);
            if (vis.count(v) || dead.count(v)) continue;
            --ct;
            if (ct == 0 || v == b) return true;
            vis.insert(v);
            s[++idx] = v;
        }
    }
    return false;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> k;

    ll a, b; a = read(), b = read();
    if (a == b) {
        cout << "TAK\n";
        return 0;
    }
    for (int i = 0; i < k; i++) {
        ll x = read();
        dead.insert(x);
    }

    cout << (solve(a, b, n*k+1) && solve(b, a, n*k+1) ? "TAK" : "NIE") << endl;

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 13 ms 1072 KB Output is correct
5 Correct 7 ms 1024 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 108 ms 9404 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 10640 KB Output is correct
2 Correct 476 ms 12732 KB Output is correct
3 Correct 4102 ms 184596 KB Output is correct
4 Correct 4758 ms 96940 KB Output is correct
5 Correct 4553 ms 96832 KB Output is correct
6 Correct 50 ms 4648 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 47 ms 8476 KB Output is correct
3 Correct 88 ms 8584 KB Output is correct
4 Correct 18 ms 2596 KB Output is correct
5 Correct 9 ms 2444 KB Output is correct
6 Correct 1 ms 416 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 51 ms 5568 KB Output is correct
4 Correct 280 ms 17828 KB Output is correct
5 Correct 139 ms 16712 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 5276 KB Output is correct
2 Runtime error 2629 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 4504 KB Output is correct
2 Correct 896 ms 67580 KB Output is correct
3 Correct 1671 ms 74124 KB Output is correct
4 Correct 4780 ms 187996 KB Output is correct
5 Correct 2647 ms 170172 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 8896 KB Output is correct
2 Runtime error 2534 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 8640 KB Output is correct
2 Correct 72 ms 4380 KB Output is correct
3 Correct 1973 ms 93472 KB Output is correct
4 Correct 4327 ms 177752 KB Output is correct
5 Correct 2408 ms 177508 KB Output is correct