oj.uz

Submission #113124

# Submission time Handle Problem Language Result Execution time Memory
113124 2019-05-23T20:19:11 Z ioilolcom Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 286 ms 20960 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(s) s.begin(),s.end()
typedef long long int ll;
vector<ll> v1,v2,v;
vector<ll>d1,d2;
ll n,m;
void solve(int idx,ll s,int t){
	if(t==1) {
		if(idx==(int)v1.size()) {
			if(s<=m) d1.push_back(s);
			return;
		}
		solve(idx+1,s+v1[idx],t);
		solve(idx+1,s,t);
	}
	else{
		if(idx==(int)v2.size()) {
			if(s<=m) d2.push_back(s);
			return;
		}
		solve(idx+1,s+v2[idx],t);
		solve(idx+1,s,t);
	}

}


ll l=0;
void solv(int idx,ll s){
	if(idx==n) {
		if(s<=m) {
			l++;
		}
		return;
	}
	solv(idx+1,s+v[idx]);
	solv(idx+1,s);
}

int main()
{

	ios_base:: sync_with_stdio(false); cin.tie(0);
	cin>>n>>m;
	for(int i=1; i<=n; i++) {
		ll a; cin>>a;
		v.push_back(a);
		if(i&1) v1.push_back(a);
		else v2.push_back(a);
	}

	solve(0,0,1);
	solve(0,0,2);
	ll ans=0;
	//solv(0,0);
/*
   cout<<"one"<<endl;
        for(int v:v1) {
                cout<<v<<" ";
        }
        cout<<endl;
        cout<<"two"<<endl;
        for(int v:v2) {
                cout<<v<<" ";
        }
        cout<<endl;
 */

	sort(all(d2));
	sort(all(d1));
	//cout<<"set 1"<<endl;
	for(ll v:d1) {
		//	cout<<v<<endl;
		int l=0;
		int r=(int)d2.size()-1;
		int an=-1;
		while(l<=r) {
			int mid=(l+r)/2;
			if(d2[mid]+v<=m) {
				an=mid;
				l=mid+1;
			}
			else{
				r=mid-1;
			}
		}

		//cout<<"max "<<an<<endl;
		if(an!=-1) ans+=(an+1);
	}
	cout<<ans<<endl;
//	solv(0,0);
	//cout<<l<<endl;
/*
        cout<<"set 2"<<endl;
        for(int v:d2) {
                cout<<v<<endl;
                //	auto it=lower_bound(all(d2),m-v);
                //cout<<(distance(d2.begin(),it))<<endl;
        }
 */
	//cout<<ans<<endl;

	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2424 KB Output is correct
2 Correct 68 ms 5492 KB Output is correct
3 Correct 283 ms 20844 KB Output is correct
4 Correct 70 ms 5492 KB Output is correct
5 Correct 12 ms 1660 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 3 ms 384 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2936 KB Output is correct
2 Correct 27 ms 2424 KB Output is correct
3 Correct 104 ms 10608 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 6 ms 1024 KB Output is correct
6 Correct 14 ms 1660 KB Output is correct
7 Correct 2 ms 384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 4468 KB Output is correct
2 Correct 106 ms 8672 KB Output is correct
3 Correct 108 ms 8560 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 57 ms 8560 KB Output is correct
6 Correct 212 ms 20872 KB Output is correct
7 Correct 6 ms 256 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 16740 KB Output is correct
2 Correct 29 ms 2424 KB Output is correct
3 Correct 10 ms 1024 KB Output is correct
4 Correct 23 ms 384 KB Output is correct
5 Correct 7 ms 1024 KB Output is correct
6 Correct 208 ms 16808 KB Output is correct
7 Correct 3 ms 384 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2424 KB Output is correct
2 Correct 66 ms 5492 KB Output is correct
3 Correct 9 ms 1024 KB Output is correct
4 Correct 9 ms 1024 KB Output is correct
5 Correct 63 ms 8560 KB Output is correct
6 Correct 22 ms 2424 KB Output is correct
7 Correct 13 ms 384 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 20960 KB Output is correct
2 Correct 26 ms 2424 KB Output is correct
3 Correct 9 ms 1024 KB Output is correct
4 Correct 286 ms 20844 KB Output is correct
5 Correct 75 ms 10608 KB Output is correct
6 Correct 15 ms 1660 KB Output is correct
7 Correct 3 ms 384 KB Output is correct