oj.uz

답안 #448637

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448637 2021-07-31T10:06:59 Z Khizri Ice Hockey World Championship (CEOI15_bobek) C++17
50 / 100
 500 ms 8648 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
ll t=1,n,N,arr[56],dp[mxn],k,ans;
void solve(){
	cin>>N>>k;
	for(int i=0;i<N;i++){
		cin>>arr[i];
	}
	n=N/2;
	vector<ll>vt;
	for(ll mask=1;mask<(1<<n);mask++){
		ll sum=0;
		for(int i=0;i<n;i++){
			if(mask&(1<<i)){
				sum+=arr[i];
			}
		}
		if(sum<=k){
			vt.pb(sum);
		}
	}
	sort(all(vt));
	ans+=vt.size();
	vector<int>v;
	for(int i=n;i<N;i++){
		v.pb(arr[i]);
	}
	n=v.size();
	for(ll mask=1;mask<(1<<n);mask++){
		ll sum=0;
		for(int i=0;i<n;i++){
			if(mask&(1<<i)){
				sum+=v[i];
			}
		}
		if(sum<=k){
			auto it=upper_bound(vt.begin(),vt.end(),k-sum);
			ans+=1+(it-vt.begin());
		}
	}
	cout<<ans+1<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 976 KB Output is correct
2 Correct 108 ms 2504 KB Output is correct
3 Correct 500 ms 8648 KB Output is correct
4 Correct 117 ms 2632 KB Output is correct
5 Correct 17 ms 976 KB Output is correct
6 Correct 8 ms 592 KB Output is correct
7 Correct 9 ms 204 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 1484 KB Output is correct
2 Correct 36 ms 976 KB Output is correct
3 Correct 217 ms 4548 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 9 ms 592 KB Output is correct
6 Correct 16 ms 976 KB Output is correct
7 Correct 10 ms 320 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 1436 KB Output is correct
2 Correct 182 ms 2460 KB Output is correct
3 Correct 161 ms 2504 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 102 ms 2504 KB Output is correct
6 Correct 264 ms 8616 KB Output is correct
7 Correct 54 ms 204 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 177 ms 4556 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 299 ms 8616 KB Output isn't correct
2 Halted 0 ms 0 KB -