Submission #1143211

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143211		yusyboss	Walk (POI13_spa)	C++20	12 / 100	248 ms	181096 KiB

spa

#include <bits/stdc++.h>

using namespace std;

const int VALMAX = (1 << 22) + 100;

bool sol;
int n, k, y;
bool f[VALMAX + 1];


void dfs(int node) {
  int bit;

  if (sol)
    return;

  f[node] = 1;

  if (node == y)
    sol = 1;

  for (bit = 0; bit < n; bit++) {
    int newnode = (node ^ (1 << bit));
    if (f[newnode] == 0)
      dfs(newnode);
  }
}

int main() {
  int i, j, x;
  cin >> n >> k;

  string s1, s2;

  cin >> s1 >> s2;

  x = y = 0;
  for (i = n - 1; i >= 0; i--) {
    x = 2 * x + (s1[i] - '0');
    y = 2 * y + (s2[i] - '0');
  }

  for (i = 0; i < k; i++) {
    string s;
    cin >> s;
    int val = 0;

    for (j = n - 1; j >= 0; j--)
      val = val * 2 + (s[j] - '0');
    f[val] = 1;
  }

  if (x == y) {
    cout << "TAK";
    return 0;
  }

  dfs(x);
  if (sol)
    cout << "TAK";
  else
    cout << "NIE";
  return 0;
}

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