Submission #1145857

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145857		idonoam	Table Tennis (info1cup20_tabletennis)	C++20	20 / 100	45 ms	4168 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
using ll  = long long;

int main() {
	ll n, k; cin >> n >> k;
    vector<ll> vec(n+k);
    for(int i = 0; i < n+k; i++){
        cin >> vec[i];
    }
    bool cnt = true;
    ll sum;
    if(n == 2){
        cout << vec[0] << ' ' <<  vec[1];
        cnt = false;
    }
    if(vec[0] + vec[n+k-1] == vec[1] + vec[n+k-2] || vec[0] + vec[n+k-1] == vec[2] + vec[n+k-3]){
        sum = vec[0] + vec[n+k-1];
    }
    else if(vec[1] + vec[n+k-1] == vec[2] + vec[n+k-2]){
        for(int i = 1; i < n+k; i++){
            cout << vec[i] << ' ';
        }
        cnt = false;
    }
    else{
        for(int i = 0; i < n+k-1; i++){
            cout << vec[i] << ' ';
        }
        cnt = false;
    }
    vector<ll> op(n);
    int m = 0, p = n-1;
    for(int i = 0, j = n+k-1; i < j && cnt;){
        if(vec[i] + vec[j] == sum){
            op[m] = vec[i];
            op[p] = vec[j];
            m++,i++,j--, p--;
        }
        else if(vec[i] + vec[j] > sum){j--;}
        else{i++;}
    }
    for(int i = 0; i < n && cnt; i++){cout << op[i] << ' ';}
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 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