Submission #1143373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143373		laurentiu_t	Triumphal arch (POI13_luk)	C++20	0 / 100	52 ms	11192 KiB

luk

#include<bits/stdc++.h>
using namespace std;
int n,k;
string x,y;
unordered_map<string,bool> nuex;
unordered_map<string,bool> luat;

void dfs(string n, string p)
{
    luat[n]=true;
    if(n==y)
    {
        cout<<"TAX";
        exit(0);
    }
    for(int i=0;i<n.size();i++)
    {
        string aux=n;
        if(n[i]=='0')
            aux[i]='1';
        else
            aux[i]='0';
        if(!luat[aux]&&!nuex[aux])
            dfs(aux,n);
    }
}

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,"1");
        cout<<"NIE";
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10