제출 #555833

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
555833		colossal_pepe	Table Tennis (info1cup20_tabletennis)	C++17	100 / 100	301 ms	2976 KiB

tabletennis

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int n, m;
vector<int> v;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    v.resize(n + m);
    for (int i = 0; i < n + m; i++) {
        cin >> v[i];
    }
    vector<int> ans(n);
    for (int i = (n / 2) - 1; i <= (n / 2) - 1 + m; i++) {
        int s = v[i] + v[i + 1], l = 0, r = n + m - 1, j = 0;
        while (l < r and j < n / 2) {
            while (r > l and v[l] + v[r] > s) r--;
            if (l < r and v[l] + v[r] == s) {
                ans[j] = v[l], ans[n - j - 1] = v[r];
                j++;
            }
            l++;
        }
        if (j < n / 2) continue;
        for (int x : ans) {
            cout << x << ' ';
        }
        cout << '\n';
        break;
    }
    return 0;
}

• 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: 13 / 13