Submission #1143229

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143229		Gtudor	Walk (POI13_spa)	C++20	24 / 100	216 ms	162312 KiB

spa

#include <iostream>


using namespace std;

string s;
int n, x, y;

bool viz[4194305];

void dfs(int nod) {
  viz[nod] = 1;
  if ( viz[y] == 1)
    return;
  for(int i = 0; i < n; i++) {
    int vecin = (nod ^ (1<<i));
    if(viz[vecin] == 0) {
      dfs(vecin);
    }
  }
}

signed main() {
  int m, k, z, nr;
  cin>>n>>m;
  cin>>s;
  nr = 0;
  for(int i = 0; i < s.size(); i++) {
    nr = nr * 2 + (s[i] - '0') ;
  }
  x = nr;
  cin>>s;
  nr = 0;
  for(int i = 0; i < s.size(); i++) {
    nr = nr * 2 + (s[i] - '0') ;
  }
  y = nr;
  if(x == y) {
    cout<<"TAK";
    return 0;
  }
  for(int i = 1; i <= m; i++) {
    cin>>s;
    nr = 0;
    for(int i = 0; i < s.size(); i++) {
      nr = nr * 2 + (s[i] - '0') ;
    }
    z = nr;
    viz[z] = 1;
  }
  dfs(x);
  if(viz[y] == 1)
    cout<<"TAK";
  else
    cout<<"NIE";
  return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 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