Submission #1143289

#TimeUsernameProblemLanguageResultExecution timeMemory
1143289calisovraduWalk (POI13_spa)C++20
12 / 100
721 ms327680 KiB
#include <bits/stdc++.h>
using namespace std;
string b;
unordered_map <string,int> mp;
int n;
void dfs(string a){
    string l=a;
    for(int i=0;i<n;i++){
        if(a[i]=='0')
        l[i]='1';
        else
        l[i]='0';
       
        if(l==b){
            cout<<"TAK";
            exit(0);
        }
        if(mp[l]==0){
        mp[l]=1;
        dfs(l);
        }
        l[i]=a[i];
    }
}
int main() {
	int k;
    string a;
    cin>>n>>k>>a>>b;
    for(int i=1;i<=k;i++){
        string x;
        cin>>x;
        mp[x]=-1;
    }
    dfs(a);
    cout<<"NIE";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...