oj.uz

Submission #1005001

# Submission time Handle Problem Language Result Execution time Memory
1005001 2024-06-22T06:01:46 Z Muaath_5 Ice Hockey World Championship (CEOI15_bobek) C++17
10 / 100
 286 ms 8912 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;

const int N = 2e5+1;

int n;
ll m, a[N];

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; cin >> a[i++]);
	vector<ll> sums;
	for (int msk = 0; msk < (1 << (n/2)); msk++) {
		ll sum = 0;
		for (int i = 0; i < n/2; i++) {
			if (msk>>i&1) {
				sum += a[i];
			}
		}
		sums.push_back(sum);
	}
	sort(sums.begin(), sums.end());
	ll sol = 0;
	for (int msk = 0; msk < (1 << (n/2 + n%2)); msk++) {
		ll sum = 0;
		for (int i = 0; i < n/2+n%2; i++) {
			if (msk>>i&1) {
				sum += a[n/2+n%2+i];
			}
		}
		if (sum >= m) continue;
		int idx = upper_bound(sums.begin(), sums.end(), m-sum)-sums.begin();
		assert(sum + sums[idx - 1] <= m);
		sol += idx;
	}
	cout << sol;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 356 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1496 KB Output is correct
2 Incorrect 25 ms 988 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 1500 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 244 ms 4996 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 8912 KB Output is correct
2 Incorrect 23 ms 988 KB Output isn't correct
3 Halted 0 ms 0 KB -