Submission #1145867

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145867		idonoam	Table Tennis (info1cup20_tabletennis)	C++20	87 / 100	3095 ms	4272 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;
    vector<ll> ps((k+1)*(k+1));
    for (int i = 0; i < k+1; i++){
        for(int j = 0; j < k+1; j++){
            ps[i*(k+1)+j] = vec[i] + vec[n+k-1-j];
        }
    }
//    for(int i = 0; i < ps.size(); i++){cout << ps[i] << ' ';}
    for(int t = 0; t < (k+1)*(k+1) && cnt; t++){
        ll sum = ps[t];
        vector<ll> op(n);
        int m = 0, p = n-1;
        bool asd = true;
        for(int i = 0, j = n+k-1; i < j&&asd;){
            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++;}
            if(j-i < p-m){asd = false;}
        }
        if(m == p+1){
            cnt = false;
            for(int i = 0; i < n; i++){cout << op[i] << ' ';}
            cout << '\n';
        }
    }
}

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