Submission #1143297

#TimeUsernameProblemLanguageResultExecution timeMemory
1143297Stormtrooper007Walk (POI13_spa)C++20
12 / 100
5105 ms327680 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,m; cin>>n>>m; string s; string f; cin>>s>>f; map<string,bool>mp; for(int i=0;i<m;i++) { string str; cin>>str; mp[str]=1; } queue<string>q; mp[s]=1; q.push(s); while(!q.empty()) { string aux=q.front(); q.pop(); for(int i=0;i<n;i++) { if(aux[i]=='0') { aux[i]='1'; if(mp.find(aux)==mp.end()) { mp[aux]=1; q.push(aux); } aux[i]='0'; } else { aux[i]='0'; if(mp.find(aux)==mp.end()) { mp[aux]=1; q.push(aux); } aux[i]='1'; } } } if(mp.find(f)==mp.end()) { cout<<"NIE"; } else { cout<<"TAK"; } return 0; }
#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...