답안 #444077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444077 2021-07-13T05:08:58 Z wind_reaper Ice Hockey World Championship (CEOI15_bobek) C++17
100 / 100
538 ms 8524 KB
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
*/

using namespace std;
// using namespace __gnu_pbds;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************



//***************** GLOBAL VARIABLES *****************



//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

void solve(){
	int N;
	int64_t M;
	cin >> N >> M;

	vector<int64_t> A(N);
	for(int i = 0; i < N; i++)
		cin >> A[i];

	vector<int64_t> X(1 << (N / 2));
	for(int mask = 0; mask < (1 << (N / 2)); mask++){
		for(int i = 0; i < 20; i++)
			if((mask >> i) & 1)
				X[mask] += A[i];
	}

	sort(X.begin(), X.end());

	int64_t ans = 0;

	for(int mask = 0; mask < (1 << (N - N / 2)); mask++){
		int64_t temp = 0;
		for(int i = 0; i < 20; i++)
			if((mask >> i) & 1)
				temp += A[N/2 + i];
		ans += upper_bound(X.begin(), X.end(), M - temp) - X.begin();
	}

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 716 KB Output is correct
2 Correct 105 ms 2252 KB Output is correct
3 Correct 538 ms 8524 KB Output is correct
4 Correct 101 ms 2252 KB Output is correct
5 Correct 18 ms 716 KB Output is correct
6 Correct 8 ms 460 KB Output is correct
7 Correct 15 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 1356 KB Output is correct
2 Correct 35 ms 824 KB Output is correct
3 Correct 202 ms 4300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 8 ms 460 KB Output is correct
6 Correct 15 ms 716 KB Output is correct
7 Correct 15 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 1228 KB Output is correct
2 Correct 187 ms 2380 KB Output is correct
3 Correct 167 ms 2364 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 100 ms 2252 KB Output is correct
6 Correct 256 ms 8524 KB Output is correct
7 Correct 82 ms 2288 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 4480 KB Output is correct
2 Correct 30 ms 716 KB Output is correct
3 Correct 11 ms 564 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 9 ms 564 KB Output is correct
6 Correct 185 ms 4428 KB Output is correct
7 Correct 15 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 820 KB Output is correct
2 Correct 100 ms 2252 KB Output is correct
3 Correct 10 ms 460 KB Output is correct
4 Correct 10 ms 460 KB Output is correct
5 Correct 124 ms 2380 KB Output is correct
6 Correct 21 ms 844 KB Output is correct
7 Correct 261 ms 8524 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 413 ms 8524 KB Output is correct
2 Correct 35 ms 716 KB Output is correct
3 Correct 11 ms 460 KB Output is correct
4 Correct 515 ms 8524 KB Output is correct
5 Correct 147 ms 4428 KB Output is correct
6 Correct 16 ms 716 KB Output is correct
7 Correct 30 ms 1228 KB Output is correct