Submission #1143131

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143131		andreifilimon	Walk (POI13_spa)	C++20	24 / 100	3942 ms	327680 KiB

spa

#include <bits/stdc++.h>

using namespace std;

#define ull long long

int main()
{
    int n, k;
    string sx, sy;
    cin >> n >> k >> sx >> sy;
    auto str_to_nr = [&](const string &s) -> ull
    {
        ull nr = 0;
        for(char c : s)
            nr = (nr << 1) | (c - '0');
        return nr;
    };

    ull x = str_to_nr(sx), y = str_to_nr(sy);
    unordered_set<ull> blk;
    string s;
    int i;
    for(i = 0; i < k; i++)
    {
        cin >> s;
        blk.insert(str_to_nr(s));
    }

    if(x == y){cout << "TAK"; return 0;}
    if(blk.find(x) != blk.end() || blk.find(y) != blk.end()){cout << "NIE"; return 0;}
    queue<ull> q;
    unordered_set<ull> viz;
    q.push(x);
    viz.insert(x);
    while(!q.empty())
    {
        ull curr = q.front();
        q.pop();
        for(i = 0; i < n; i++)
        {
            ull vec = curr ^ (1ULL << (n - 1 - i));
            if(vec == y){cout << "TAK"; return 0;}
            if(blk.find(vec) == blk.end() && viz.find(vec) == viz.end())
            {
                viz.insert(vec);
                q.push(vec);
            }
        }
    }
    cout << "NIE";
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 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