Submission #910879

#	Time	Username	Problem	Language	Result	Execution time	Memory
910879		vjudge1	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	44 ms	4940 KiB

tabletennis

#include <iostream>
#include <vector>
#include <set>
#include <deque>

using namespace std;
const int NMAX = 150002;

int v[NMAX], sum = 0, n, k;
vector < int > p, im;

int lb(int x){
    int st = 1, dr = n + k;
    while(st < dr){
        int mid = (st + dr) / 2;
        if(v[mid] >= x)
            dr = mid;
        else
            st = mid + 1;
    }
    return dr;
}

bool check(int a){
    deque < int > d;
    int SUMA = (sum - a) / 2;
    int nr = 0, s1 = 0;


    for(int i = 1; i <= n + k; i++){
        while(s1 >= SUMA){
            s1 -= d.front();
            nr--;
            d.pop_front();
        }
        if(s1 < SUMA){
            s1 += v[i];
            nr++;
            d.push_back(v[i]);
        }
        if(s1 == SUMA && nr == n / 2)
            return true;
    }


    /*int st = 1, dr = n + k;
    if(n % 4 == 0){ ///nr par in feicare gr
        while(nr < n / 2){
            nr += 2;
            if(v[st] == a)
                st++;
            if(v[dr] == a)
                dr--;
            s1 += (v[st] + v[dr]);
            st++, dr--;
        }
        if(s1 == SUMA)
            return true;
        cout << "s1 ii " << s1 << '\n';
    }
    else{
        while(nr < n / 2 - 1){
            nr += 2;
            if(v[st] == a)
                st++;
            if(v[dr] == a)
                dr--;
            s1 += (v[st] + v[dr]);
            st++, dr--;
        }
        if(v[lb(SUMA - s1)] == SUMA - s1 && st <= lb(SUMA - s1) && lb(SUMA - s1) <= dr)
            return true;
        cout << "s1 ii " << s1 << '\n';
    }
    return false;*/
}

int solve(vector < int > a){
    for(int i = 0; i < a.size(); i++){
        if(check(a[i]) == true)
            return a[i];
        cout << a[i] << '\n';
    }
    return -1;
}
int main()
{
    int remov;
    cin >> n >> k;
    for(int i = 1; i <= n + k; i++){
        cin >> v[i];
        sum += v[i];
        if(v[i] % 2 == 0)
            p.push_back(v[i]);
        else
            im.push_back(v[i]);
    }
    if(sum % 2 == 1)
        remov = solve(im);
    else
        remov = solve(p);
    for(int i = 1; i <= n + k; i++){
        if(v[i] != remov)
            cout << v[i] << " ";
    }
    return 0;
}
/*4 1
1 2 3 4 5*/

Compilation message (stderr)

tabletennis.cpp: In function 'int solve(std::vector<int>)':
tabletennis.cpp:79:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(int i = 0; i < a.size(); i++){
      |                    ~~^~~~~~~~~~
tabletennis.cpp: In function 'bool check(int)':
tabletennis.cpp:25:19: warning: control reaches end of non-void function [-Wreturn-type]
   25 |     deque < int > d;
      |                   ^

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13