Submission #1143385

#TimeUsernameProblemLanguageResultExecution timeMemory
1143385laurentiu_tWalk (POI13_spa)C++20
12 / 100
5103 ms327680 KiB
#include<bits/stdc++.h> using namespace std; string a,b; int main() { int k,n; unordered_map<string,int> mp; cin>>n>>k>>a>>b; for(int i=1;i<=k;i++) { string x; cin>>x; mp[x]=-1; } queue<string> q; q.push(a); while(!q.empty()) { string x=q.front(); string l=x; q.pop(); for(int i=0;i<n;i++) { if(x[i]=='0') l[i]='1'; else l[i]='0'; if(mp[l]==0) { q.push(l); mp[l]=1; if(l==b) { cout<<"TAK"; exit(0); } } l[i]=x[i]; } } 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...