Submission #1143346

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143346		lucamiscoci	Walk (POI13_spa)	C++20	0 / 100	5096 ms	4416 KiB

spa

#include <iostream>

using namespace std;
int n, k;

int marked[1000001];
int val[1000001];
int a, b;
  string step;
  string start , finish;
int i, mask;

int conversion (string &s){
  int output = 0;
  int length = s.size();
  for (i = 0; i < length; i++){
    if (s[i] == '1')
      output += (1 << i);
  }
  return output;
}


void dfs (int node){
  marked[node] = true;
  if (node == b){
    cout << "TAK";
    exit(0);
  }

  for (i = 0; i < n; i++){
    if (marked[node ^ (1 << i)] == false && val[node ^ (1 << i)] == false)
        dfs (node ^ (1 << i));
  }
}

int main(){

  cin >> n >> k;

  cin >> start;

  a = conversion(start);

  cin >> finish;
  b = conversion(finish);
  for (i = 0; i < k; i++){
    cin >> step;
    mask = conversion (step);
    val[mask] = true;
  }

  dfs (a);
  cout << "NIE";
  return 0;
}

• 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