Kolikot

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:91:19: warning: unused variable 's' [-Wunused-variable]
     long long int s = b.size();
                   ^

#include <iostream>
#include <vector>
#include <algorithm>    // std::reverse
#include <math.h>


using namespace std;

long long int bsearch(long long int a, long long int b, long long int v, const vector<long long int> coins, bool orig){
    if(coins[a] == v){
        return a;
    }else if(coins[b] == v){
        return b;
    }else if(coins[b] < v && orig){
        return b;
    }else if(b-a == 1){
        if (coins[a] < v && coins[b] > v){
            return a;
        }else{
            return -1;
        }
    }else{
        long long int middle = (a + b)/2;
        if(coins[middle] > v){
            return bsearch(a, middle, v, coins, false);
        }else if(coins[middle] < v){
            return bsearch(middle, b, v, coins, false);
        }else{
            return middle;
        }
    }
}

bool findSum(long long int money, const vector<long long int> coins, const vector<long long int> st){
    /*long long int s = 0;
    long long int previousIndex = coins.size()-1;
    while(previousIndex > -1){
        long long int index = bsearch(0, previousIndex, money-s, coins, true);
        if(index != -1){
            s = s + coins[index];
            if(s == money){
                return true;
            }
            previousIndex = index-1;
        }else{
            return false;
        }
    }*/
    int index = bsearch(0, coins.size()-1, money, coins, true);
    if(index == -1)
        return false;
    if(st[index] < money){
        return false;
    }
    return true;
}

long long int binarize(const vector<long long int> coins){
    long long int x = 1;
    while(std::binary_search(coins.begin(), coins.end(), pow(2, x))){
        x++;
    }
    return pow(2,x);
}

int main(int argc, char *argv[])
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    long long int qty = 0;
    std::cin >> qty;
    std::vector<long long int> b(0,0);
    for(long long int i = 0; i < qty; i++){
        long long int z = 0;
        std::cin >> z;
        b.push_back(z);
    }


    std::sort(b.begin(), b.end());

    vector<long long int> st;
    int q = 0;
    for(long long int i = 0; i < qty; i++){
        q = q + b[i];
        st.push_back(q);
    }


    long long int s = b.size();

    if(b[0] > 1){
        std::cout << "1" << std::endl;
    }else{
        long long int i = binarize(b);
        while(true){
            if(!findSum(i, b, st)){
                break;
            }
            i++;
        }
        std::cout << i << std::endl;
    }

    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED