제출 #316348

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
316348		thecodingwizard	새로운 문제 (POI13_spa)	C++11	0 / 100	5080 ms	221752 KiB

spa

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int n, k; 

ll read() {
    ll num = 0;
    for (int i = n-1; i >= 0; i--) {
        char c; cin >> c;
        if (c == '1') {
            num |= (1 << i);
        }
    }
    return num;
}

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

    cin >> n >> k;
    map<ll, int> deadCt;
    set<ll> dead;
    queue<ll> q;

    ll a, b; a = read(), b = read();
    for (int i = 0; i < k; i++) {
        ll x = read();
        dead.insert(x);
        q.push(x);
    }

    while (!q.empty()) {
        ll x = q.front(); q.pop();
        for (int i = 0; i < n; i++) {
            ll y = x ^ (1 << i);
            deadCt[y]++;
            if (deadCt[y] == n && !dead.count(y)) {
                q.push(y);
                dead.insert(y);
            }
        }
    }

    if (dead.count(a) || dead.count(b)) cout << "NIE" << "\n";
    else cout << "TAK" << "\n";

    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13