oj.uz

Submission #563192

# Submission time Handle Problem Language Result Execution time Memory
563192 2022-05-16T13:17:44 Z zaneyu Ice Hockey World Championship (CEOI15_bobek) C++14
100 / 100
 337 ms 21020 KB 
/*input
8
3 2 1 2 3 3 2 4
*/
#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;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
} 
int main(){
    int n;
    ll m;
    cin>>n>>m;
    vector<ll> v1,v2,v3,v4;
	REP(i,n/2){
		ll x;
		cin>>x;
		v1.pb(x);
	}
	REP(i,(n+1)/2){
		ll x;cin>>x;
		v2.pb(x);
	}
	REP(i,(1<<(sz(v1)))){
		ll sum=0;
		REP(j,sz(v1)) if(i&(1<<j)) sum+=v1[j];
		v3.pb(sum);
	}
	sort(ALL(v3));
	REP(i,(1<<(sz(v2)))){
		ll sum=0;
		REP(j,sz(v2)) if(i&(1<<j)) sum+=v2[j];
		v4.pb(sum);
	}
	sort(ALL(v4));
	ll ans=0;
	REP(i,sz(v3)) ans+=(upper_bound(ALL(v4),m-v3[i])-v4.begin());
	cout<<ans;
	
}

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 1 ms 296 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 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 0 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 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 340 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1948 KB Output is correct
2 Correct 75 ms 5312 KB Output is correct
3 Correct 337 ms 20752 KB Output is correct
4 Correct 73 ms 5424 KB Output is correct
5 Correct 12 ms 1484 KB Output is correct
6 Correct 10 ms 852 KB Output is correct
7 Correct 15 ms 1560 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2840 KB Output is correct
2 Correct 25 ms 1872 KB Output is correct
3 Correct 133 ms 10500 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 15 ms 1520 KB Output is correct
7 Correct 15 ms 1584 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 3480 KB Output is correct
2 Correct 114 ms 6592 KB Output is correct
3 Correct 109 ms 6576 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 69 ms 6588 KB Output is correct
6 Correct 260 ms 21020 KB Output is correct
7 Correct 99 ms 6508 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 12644 KB Output is correct
2 Correct 25 ms 1872 KB Output is correct
3 Correct 8 ms 960 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 852 KB Output is correct
6 Correct 208 ms 12720 KB Output is correct
7 Correct 15 ms 1484 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1872 KB Output is correct
2 Correct 81 ms 5344 KB Output is correct
3 Correct 8 ms 956 KB Output is correct
4 Correct 8 ms 912 KB Output is correct
5 Correct 70 ms 6552 KB Output is correct
6 Correct 28 ms 2000 KB Output is correct
7 Correct 293 ms 20792 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 20832 KB Output is correct
2 Correct 25 ms 1988 KB Output is correct
3 Correct 10 ms 852 KB Output is correct
4 Correct 316 ms 20808 KB Output is correct
5 Correct 103 ms 10548 KB Output is correct
6 Correct 16 ms 1600 KB Output is correct
7 Correct 31 ms 2884 KB Output is correct