제출 #1116420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116420		biximo	새로운 문제 (POI13_spa)	C++17	0 / 100	100 ms	17224 KiB

spa

#include <bits/stdc++.h>
using namespace std;
const int N = 300005, INF = 1000000000;
int n, k;
long long x, y;
set<long long> nt;
long long getNum(string s) {
	long long v = 0;
	for(char i: s) {
		v = v*2+i-'0';
	}
	return v;
}
int getSz(long long st) {
	queue<long long> que;
	unordered_set<long long> vs;
	que.push(st);
	vs.insert(st);
	while(que.size() && vs.size() <= 5000000) {
		long long c =que.front(); que.pop();
		for(int i = 0; i < n; i ++) {
			if(c&1LL<<i) continue;
			if(vs.count(c|1LL<<i)) continue;
			if(nt.count(c|1LL<<i)) continue;
			vs.insert(c|1LL<<i);
			que.push(c|1LL<<i);
		}
	}
	return vs.size();
}
bool contains(long long st, long long gl) {
	queue<long long> que;
	unordered_set<long long> vs;
	que.push(st);
	vs.insert(st);
	while(que.size() && vs.size() <= 5000000) {
		long long c =que.front(); que.pop();
		for(int i = 0; i < n; i ++) {
			if(c&1LL<<i) continue;
			if(vs.count(c|1LL<<i)) continue;
			if(nt.count(c|1LL<<i)) continue;
			vs.insert(c|1LL<<i);
			que.push(c|1LL<<i);
		}
	}
	return vs.count(gl);
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    string a, b;
    cin >> a >> b; x = getNum(a); y = getNum(b);
    while(k--) {
    	cin >> a;
    	nt.insert(getNum(a));
    }
    if(getSz(x) >= 5000000 && getSz(y) >= 5000000 || contains(x,y)) {
    	cout << "TAK\n";
    } else {
    	cout << "NIE\n";
    }
}

컴파일 시 표준 에러 (stderr) 메시지

spa.cpp: In function 'int main()':
spa.cpp:57:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   57 |     if(getSz(x) >= 5000000 && getSz(y) >= 5000000 || contains(x,y)) {
      |        ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• 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