제출 #1143205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143205		Gtudor	Walk (POI13_spa)	C++20	12 / 100	235 ms	109980 KiB

spa

#include <iostream>

#define int long long

using namespace std;

string s;

bool viz[4194305];

int transformToInt() {
  int put = 1, nr = 0;
  for(int i = 0; i < s.size(); i++) {
    nr = nr * 2 + (s[i] - '0') ;
  }
  return nr;
}

void dfs(int p, int nod, int n) {
  int put;
  viz[nod] = 1;
  put = 1;
  for(int i = 0; i < n; i++) {
    int vecin = (nod ^ put);
    put *= 2;
    if(viz[vecin])
      continue;
    dfs(nod, vecin, n);
  }
}

signed main() {
  int n, m, k, x, y, z;
  cin>>n>>m;
  cin>>s;
  x = transformToInt();
  cin>>s;
  y = transformToInt();
  if(x == y) {
    cout<<"TAK";
    return 0;
  }
  for(int i = 1; i <= m; i++) {
    cin>>s;
    z = transformToInt();
    viz[z] = 1;
  }
  dfs(0, x, n);
  if(viz[y] == 1)
    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