Submission #32010

#	Time	Username	Problem	Language	Result	Execution time	Memory
32010		kdh9949	Walk (POI13_spa)	C++14	12 / 100	5000 ms	262144 KiB

spa

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n, k;
ll s, e;
unordered_set<ll> fb, ss;
queue<ll> q;
const int lim = 5000005;

ll get(){
	char buf[62]; scanf("%s", buf);
	ll ret = 0;
	for(int i = n - 1, j = 0; i >= 0; i--, j++){
		ret += (buf[i] - '0') * (1LL << j);
	}
	return ret;
}

int main(){
	scanf("%d%d", &n, &k);
	s = get(); e = get();
	for(int i = 0; i < k; i++) fb.insert(get());
    q.push(s); ss.insert(s);
    while(!q.empty() && ss.size() < lim){
        ll cur = q.front(); q.pop();
        for(int i = 0; i < n; i++){
			ll t = cur ^ (1LL << i);
			if(ss.find(t) == ss.end() && fb.find(t) == fb.end()){
				ss.insert(t);
				q.push(t);
			}
        }
    }
    if(ss.find(e) != ss.end()){ puts("TAK"); return 0; }
    if(ss.size() < lim){ puts("NIE"); return 0; }
    ss.clear();
    queue<ll>().swap(q);
    q.push(e); ss.insert(e);
	while(!q.empty() && ss.size() < lim){
        ll cur = q.front(); q.pop();
        for(int i = 0; i < n; i++){
			ll t = cur ^ (1LL << i);
			if(ss.find(t) == ss.end() && fb.find(t) == fb.end()){
				ss.insert(t);
				q.push(t);
			}
        }
    }
    puts(ss.size() == lim ? "TAK" : "NIE");
}

Compilation message (stderr)

spa.cpp: In function 'll get()':
spa.cpp:12:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  char buf[62]; scanf("%s", buf);
                                ^
spa.cpp: In function 'int main()':
spa.cpp:21:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
                       ^

• 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