Submission #481907

#	Time	Username	Problem	Language	Result	Execution time	Memory
481907		Yazan_Alattar	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	28 ms	2312 KiB

tabletennis

#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

vector <int> v;
int n, k, a[M];

int solve(int sum)
{
    v.clear();
    int l = 1, r = n + k;
    while(l < r){
        if(v.size() == n) break;
        if(a[l] + a[r] == sum){
            v.pb(l);
            v.pb(r);
            ++l;
            --r;
        }
        else if(a[l] + a[r] > sum) --r;
        else ++l;
    }
    return ((int)v.size() == n);
}

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n + k; ++i) cin >> a[i];
    sort(a + 1, a + n + k + 1);
    int res = solve(a[1] + a[n + k]);
    if(res == -1) res = solve(a[2] + a[n + k]);
    if(res == -1) res = solve(a[1] + a[n + k - 1]);
    if(res == -1) res = solve(a[2] + a[n + k - 1]);
    for(int i = 1; i <= n + k; ++i) if(i != res) cout << a[i] << " ";
    cout << endl;
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

Compilation message (stderr)

tabletennis.cpp: In function 'int solve(int)':
tabletennis.cpp:34:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |         if(v.size() == n) break;
      |            ~~~~~~~~~^~~~

• 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