oj.uz

Submission #414110

# Submission time Handle Problem Language Result Execution time Memory
414110 2021-05-30T04:12:44 Z Pichon5 Ice Hockey World Championship (CEOI15_bobek) C++17
10 / 100
 296 ms 20808 KB 
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
using namespace std;

vll A;
vll B;
ll m,x,res=1,sum;
vll SA,SB;
int n;
int main()
{
    cin>>n;
    cin>>m;
    for(int i=0;i<n/2;i++){
        cin>>x;
        A.pb(x);
    }
    for(int i=0;i<(n+1)/2;i++){
        cin>>x;
        B.pb(x);
    }
    n=A.size();
    for(int i=0;i<(1<<n);i++){
        sum=0;
        for(int l=0;l<n;l++){
            if((1<<l)&i){
                sum+=A[l];
            }
        }
        if(sum<=m && sum>0){
            res++;
            SA.pb(sum);
        }
    }
    n=B.size();
    for(int i=0;i<(1<<n);i++){
        sum=0;
        for(int l=0;l<n;l++){
            if((1<<l)&i){
                sum+=B[l];
            }
        }
        if(sum<=m && sum>0){
            res++;
            SB.pb(sum);
        }
    }
    sort(SA.begin(),SA.end());
    for(int i=0;i<SB.size();i++){
        int b=0,e=SA.size();e--;
        int pos=-1;
        while(b<=e){
            int mid=(b+e)/2;
            if(SB[i]+SB[mid]<=m){
                pos=mid;
                e=mid-1;
            }else{
                b=mid+1;
            }
        }
        res+=pos+1;
    }
    cout<<res<<endl;


    return 0;
}

Compilation message

bobek.cpp: In function 'int main()':
bobek.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i=0;i<SB.size();i++){
      |                 ~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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