제출 #1168060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168060		Rafiullah	Walk (POI13_spa)	C++20	0 / 100	68 ms	8264 KiB

spa

#include <bits/stdc++.h>
#define fi first
#define se second
#define bupo __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define int long long
const int LOG = 16, MAXB = 1<<LOG, SQR = 1<<10;
const ll MOD = 1e9+7;
const int mod = 998244353;
const int N = 1e6 + 5;
int is_[N], n , k;
int is[N];
int t(string S){
    int E = 0;
    for(int i = n - 1 ; i >= 0 ; i --)E += (1LL << i) * (S[i] == '1');
    return E;
}
void f(int num){
    if(is_[num])return;
    is[num] = 1;
    for(int i = 0 ; i < n ; i ++)
        if(!is[(num ^ (1LL << i))])
            f((num ^ (1LL << i)));
}

void solve()
{
    cin >> n >> k;
    string a,b;cin >> a >> b;
    int A = t(a);int B = t(b);
    for(int i = 0 ; i < k ; i ++){
        cin >> a;
        is_[t(a)] = 1;
    }
    f(A);
    if(is[B])cout << "TAK" << '\n';
    else cout << "NIE" << '\n';
    
}
signed main(){
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
}

• 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