Submission #751082

#	Time	Username	Problem	Language	Result	Execution time	Memory
751082		Stickfish	Table Tennis (info1cup20_tabletennis)	C++17	9 / 100	58 ms	3016 KiB

tabletennis

#include <iostream>
#include <algorithm>
#include <map>
#include <cassert>
#include <vector>
using namespace std;

const int MAXN = 157000;
int a[MAXN];

void solve_slow(int n, int k) {
    map<int, int> mp;
    for (int i = 0; i * 2 < n + k; ++i) {
        int ctr = n + k - i - 1;
        for (int t = -k; t <= k; ++t) {
            if (ctr + t <= i || ctr + t >= n)
                continue;
            int val = a[i] + a[ctr + t];
            ++mp[val];
        }
    }
    int mxval = 0;
    int mxcnt = 0;
    for (auto [val, cnt] : mp) {
        if (mxcnt < cnt) {
            mxval = val;
            mxcnt = cnt;
        }
    }
    assert(mxcnt >= n / 2);
    vector<int> ans;
    for (int i = 0; i * 2 < n + k; ++i) {
        int ctr = n + k - i - 1;
        for (int t = -k; t <= k; ++t) {
            if (ctr + t <= i || ctr + t >= n)
                continue;
            int val = a[i] + a[ctr + t];
            if (val == mxval) {
                ans.push_back(a[i]);
                ans.push_back(a[ctr + t]);
            }
        }
    }
    while (ans.size() > n)
        ans.pop_back();
    sort(ans.begin(), ans.end());
    for (int i = 0; i < n; ++i) {
        cout << ans[i] << ' ';
    }
    cout << endl;
}

signed main() {
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n + k; ++i) {
        cin >> a[i];
    }
    if (n * k <= 300000) {
        solve_slow(n, k);
        return 0;
    }
}

Compilation message (stderr)

tabletennis.cpp: In function 'void solve_slow(int, int)':
tabletennis.cpp:44:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     while (ans.size() > n)
      |            ~~~~~~~~~~~^~~

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