Submission #295801

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
295801	2020-09-10T00:38:57 Z	eggag32	Ice Hockey World Championship (CEOI15_bobek)	C++17	90 / 100	526 ms	8788 KB

bobek

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n;
	ll m;
	cin >> n >> m;
	if(n == 1){
		ll x;
		cin >> x;
		cout << (x <= m ? 1 : 0) << endl;
	}
	else{
		ll ans = 0LL;
		vector<ll> a(n / 2), b((n + 1) / 2);
		rep(i, n / 2) cin >> a[i];
		rep(i, (n + 1) / 2) cin >> b[i];
		vector<ll> pos;
		rep(i, (1 << (n / 2))){
			ll sum = 0LL;
			rep(j, n / 2) if(i & (1 << j)) sum += a[j];
			if(sum <= m) pos.pb(sum);
		}
		sort(all(pos));
		rep(i, (1 << ((n + 1) / 2))){
			ll sum = 0LL;
			rep(j, (n + 1) / 2) if(i & (1 << j)) sum += b[j];
			if(sum <= m){
				auto it = ub(all(pos), m - sum);
				ans += (ll)(it - pos.begin());
			}
		}
		cout << ans << endl;
	}
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	384 KB	Output isn't correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	308 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	1024 KB	Output is correct
2	Correct	107 ms	2552 KB	Output is correct
3	Correct	514 ms	8676 KB	Output is correct
4	Correct	104 ms	2552 KB	Output is correct
5	Correct	17 ms	1056 KB	Output is correct
6	Correct	8 ms	768 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	1532 KB	Output is correct
2	Correct	36 ms	1024 KB	Output is correct
3	Correct	212 ms	4704 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	8 ms	768 KB	Output is correct
6	Correct	15 ms	1024 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	77 ms	1648 KB	Output is correct
2	Correct	173 ms	2552 KB	Output is correct
3	Correct	158 ms	2552 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	101 ms	2552 KB	Output is correct
6	Correct	256 ms	8788 KB	Output is correct
7	Correct	58 ms	384 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	352 ms	4672 KB	Output is correct
2	Correct	32 ms	1024 KB	Output is correct
3	Correct	11 ms	768 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	9 ms	768 KB	Output is correct
6	Correct	184 ms	4632 KB	Output is correct
7	Correct	8 ms	384 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	1024 KB	Output is correct
2	Correct	106 ms	2584 KB	Output is correct
3	Correct	11 ms	768 KB	Output is correct
4	Correct	10 ms	768 KB	Output is correct
5	Correct	125 ms	2584 KB	Output is correct
6	Correct	21 ms	1024 KB	Output is correct
7	Correct	132 ms	384 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	421 ms	8788 KB	Output is correct
2	Correct	36 ms	1024 KB	Output is correct
3	Correct	11 ms	768 KB	Output is correct
4	Correct	526 ms	8680 KB	Output is correct
5	Correct	145 ms	4704 KB	Output is correct
6	Correct	16 ms	1024 KB	Output is correct
7	Correct	17 ms	384 KB	Output is correct

Submission #295801

Compilation message