제출 #1143264

#제출 시각아이디문제언어결과실행 시간메모리
1143264calisovradu새로운 문제 (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...