oj.uz

Submission #590031

# Submission time Handle Problem Language Result Execution time Memory
590031 2022-07-05T13:31:27 Z Blagojce Ice Hockey World Championship (CEOI15_bobek) C++11
40 / 100
 303 ms 20772 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(ll i = (n); i < (m); i ++)
#define st first
#define nd second
#define pb push_back
#define pq priority_queue
#define all(x) begin(x), end(x)

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

int n;
ll m;

ll a[40];

int main(){
	cin >> n >> m;
	fr(i, 0, n){
		cin >> a[i];
	}
	
	int p1 = n/2;
	int p2 = n-p1;
	
	vector<ll> v1;
	fr(i, 0, (1<<p1)){
		ll sum = 0;
		fr(j, 0, p1){
			if(i&(1<<j)){
				sum += a[j];
			}
		}
		if(sum <= m){
			v1.pb(sum);
		}
	}
	
	vector<ll> v2;
	fr(i, 0, (1<<p2)){
		ll mask = (i<<p1);
		ll sum = 0;
		fr(j, p1, p1+p2){
			if(mask&(1<<j)){
				sum += a[j];
			}
		}
		if(sum <= m){
			v2.pb(sum);
		}
		
	}
	sort(all(v1));
	sort(all(v2));
	
	int pos = 1;
	ll ans = 0;
	for(int i = (int)v1.size()-1; i >= 0; i --){
		while(pos < (int)v2.size() && v2[pos] + v1[i] <= m){
			++pos;
		}
		ans += pos;
	
	}
	cout<<ans<<endl;
	
	
	
	
	
	
	
	
	
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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