제출 #218306

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
218306		alishahali1382	Ice Hockey World Championship (CEOI15_bobek)	C++14	100 / 100	455 ms	8704 KiB

bobek

#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int N=20;

ll n, m, k, u, v, x, y, t, a, b, ans;
ll A[N<<1];
ll B[1<<N];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=0; i<n; i++) cin>>A[i];
	for (int mask=1; mask<(1<<N); mask++){
		int bit=__builtin_ctz(mask);
		B[mask]=B[mask^(1<<bit)] + A[bit];
	}
	sort(B, B+(1<<N));
	for (int mask=0; mask<(1<<N); mask++){
		ll sum=0;
		for (int i=0; i<N; i++) sum+=((mask>>i)&1)*A[N+i];
		ans+=upper_bound(B, B+(1<<N), m-sum)-B;
	}
	ans>>=2*N-n;
	cout<<ans<<'\n';
	
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10