Submission #1168049

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168049		Muhammad_Aneeq	새로운 문제 (POI13_spa)	C++20	0 / 100	171 ms	27760 KiB

spa

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <map>
#warning check the output
using namespace std;
map<string,int>vis;
string x,y;
bool ans=0;
int n,k;
int const N=65;
bool seen[N];
void dfs()
{
    if (vis[x])
        return;
    if (ans)
        return;
    if (x==y)
    {
        ans=1;
        return;
    }
    vis[x]=1;
    for (int i=0;i<n;i++)
    {
        if (!seen[i])
        {
            seen[i]=1;
            x[i]=(x[i]=='0'?'1':'0');
            dfs();
            x[i]=(x[i]=='0'?'1':'0');
            seen[i]=0;
        }
    }
}
inline void solve()
{
    cin>>n>>k;
    cin>>x>>y;
    for (int i=0;i<k;i++)
    {
        string z;
        cin>>z;
        vis[z]=1;
    }
    dfs();
    if (ans)
        cout<<"TAK";
    else
        cout<<"NIE";
    cout<<endl;
}
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

Compilation message (stderr)

spa.cpp:9:2: warning: #warning check the output [-Wcpp]
    9 | #warning check the output
      |  ^~~~~~~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13