제출 #1144597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1144597		SmuggingSpun	Park (BOI16_park)	C++20	0 / 100	2 ms	832 KiB

park

#include<bits/stdc++.h>
#define taskname "E"
using namespace std;
int LOG, n, q;
string toxic;
namespace sub1{
	void solve(){
		for(int _ = 0; _ < q; _++){
			int ans = 0;
			string s;
			cin >> s;
			reverse(s.begin(), s.end());
			for(int mask = n - 1; mask > -1; mask--){
				ans += toxic[mask];
				for(int i = 0; i < LOG; i++){
					if(s[i] != '?' && bool(1 << i & mask) != bool(s[i] == '1')){
						ans -= toxic[mask];
						break;
					}
				}
			}
			cout << ans << "\n";
		}
	}
}
namespace sub2{
	void solve(){
		vector<int>ans(59050, 0);
		for(int mask = n - 1; mask > -1; mask--){
			for(int sub = n - 1; sub > -1; sub--){
				int id = 0;
				for(int i = 0; i < LOG; i++){
					id *= 3;
					if(1 << i & sub){
						id += (1 << i & mask) ? 2 : 1;
					}
				}
				ans[id] += toxic[mask];
			}
		}
		for(int _ = 0; _ < q; _++){
			string s;
			cin >> s;
			reverse(s.begin(), s.end());
			int id = 0;
			for(char& c : s){
				id *= 3;
				if(c != '?'){
					id += c - 47;
				}
			}
			cout << ans[id] << "\n";
		}
	}
}
namespace sub3{
	void solve(){
		vector<int>pw(14);
		for(int i = pw[0] = 1; i < 14; i++){
			pw[i] = pw[i - 1] * 3;
		}
		vector<int>ans(pw[LOG] + 1, 0), sig(n);
		for(int mask = n - 1; mask > 0; mask--){
			for(int i = LOG - 1; i > -1; i--){
				if(1 << i & mask){
					sig[mask] = i;
					break;
				}
			}
		}
		vector<int>id(n);
		id[0] = 0;
		for(int mask = n - 1; mask > -1; mask--){
			ans[0] += toxic[mask];
			for(int sub = 1; sub < n; sub++){
				ans[id[sub] = id[sub ^ (1 << sig[sub])] + ((1 << sig[sub] & mask) ? (pw[LOG - sig[sub] - 1] << 1) : pw[LOG - sig[sub] - 1])] += toxic[mask];   
			}
		}
		for(int _ = 0; _ < q; _++){
			string s;
			cin >> s;
			reverse(s.begin(), s.end());
			int id = 0;
			for(char& c : s){
				id *= 3;
				if(c != '?'){
					id += c - 47;
				}
			}
			cout << ans[id] << "\n";
		}
	}
}
namespace sub45{
	void solve(){
		vector<int>f0(n), f1(n);
		for(int i = 0; i < n; i++){
			f0[i] = f1[i] = toxic[i];
		}
		for(int i = 0; i < LOG; i++){
			for(int mask = 0; mask < n; mask++){
				if(1 << i & mask){
					f1[mask] += f1[mask ^ (1 << i)];
				}
				else{
					f0[mask] += f0[mask | (1 << i)];
				}
			}
		}
		vector<int>cnt(n);
		for(int i = 0; i < n; i++){
			cnt[i] = __builtin_popcount(i) & 1;
		}
		for(int _ = 0; _ < q; _++){
			string s;
			cin >> s;
			reverse(s.begin(), s.end());
			int c0 = 0, c1 = 0, ca = 0, ans = 0;
			for(int i = 0; i < LOG; i++){
				if(s[i] == '0'){
					c0 |= 1 << i;
				}
				else if(s[i] == '1'){
					c1 |= 1 << i;
				}
				else{
					ca |= 1 << i;
				}
			}
			if(cnt[c0] < cnt[c1] && cnt[c0] < cnt[ca]){
				for(int mask = c0; true; mask = (mask - 1) & c0){
					if(cnt[mask] & 1){
						ans += f1[(n - 1) ^ (mask | c1)];
					}
					else{
						ans -= f1[(n - 1) ^ (mask | c1)];
					}
					if(mask == 0){
						break;
					}
				}
			}
			else if(cnt[c1] < cnt[c0] && cnt[c1] < cnt[ca]){
				for(int mask = c1; true; mask = (mask - 1) & c1){
					if(cnt[mask] & 1){
						ans += f0[mask | c0];
					}
					else{
						ans -= f0[mask | c0];
					}
					if(mask == 0){
						break;
					}
				}
			}
			else{
				for(int mask = ca; true; mask = (mask - 1) & ca){
					ans += toxic[c1 | mask];
					if(mask == 0){
						break;
					}
				}
			}
			cout << ans << "\n";
		}
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	cin >> LOG >> q >> toxic;
	for(char& c : toxic){
		c -= 48;
	}
	if((n = 1 << LOG) <= 1024 && q <= 1000){
		sub1::solve();
	}
	else if(n <= 1024){
		sub2::solve();
	}
	else if(n <= 8192){
		sub3::solve();
	}
	else{
		sub45::solve();
	}
}

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

park.cpp: In function 'int main()':
park.cpp:171:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  171 |                 freopen(taskname".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 27
• Subtask 2: 0 / 31
• Subtask 3: 0 / 42