Submission #1143310

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143310		serifu	Walk (POI13_spa)	C++20	12 / 100	766 ms	327680 KiB

spa

#include <bits/stdc++.h>

using namespace std;

const int maxN=5000007;
int dist[maxN];
int n, k;
string x, y;
int cate[maxN];
unordered_map <string, bool> nuex;
unordered_map <string, bool> luat;

void dfs(string node, string prev)
{
    luat[node]=true;
    for (int i=0; i<n; i++)
    {
        string aux=node;
        if (node[i]=='0') aux[i]='1';
        else aux[i]='0';

        if (!luat[aux] && !nuex[aux]) dfs(aux, node);
    }
}

signed main()
{
    cin>>n>>k;
    cin>>x>>y;
    for (int i=0; i<k; i++)
    {
        string a; cin>>a;
        nuex[a]=true;
    }
    if (!nuex[x] && !nuex[y]) dfs(x, x);

    cout<<(luat[y] ? "TAK" : "NIE");
    return 0;
}

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