제출 #717364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
717364		vjudge1	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3030 ms	10828 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
#define int long long
const int sz = 4e5 + 5;
const int mod = 1e9 + 7;
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int>v(n + m);
    map<int, int>mp;
    for (int i = 0; i <= n; i++) {
        cin >> v[i];
        mp[v[i]] = i + 1;
    }
    sort(all(v));
    int sum1 = 0, sum2 = 0;
    int l = 0, r = n - 1;
    while (l < r) {
        if (l % 2 == 0) {
            sum1 += v[l] + v[r];
        }
        else sum2 += v[l] + v[r];
        l++;
        r--;
    }
    if (sum1 == sum2) {
        for (int i = 0; i < n; i++) {
            cout << mp[v[i]] << ' ';
        }
        return 0;
    }
    for (int i = 0; i < n; i++) {
        swap(v[i], v[n]);
        sort(v.begin(), v.begin() + n);
        sum1 = 0, sum2 = 0;
        l = 0, r = n - 1;
        while (l < r) {
            if (l % 2 == 0) {
                sum1 += v[l] + v[r];
            }
            else sum2 += v[l] + v[r];
            l++;
            r--;
        }
        if (sum1 == sum2) {
            for (int i = 0; i < n; i++) {
                cout << mp[v[i]] << ' ';
            }
            return 0;
        }
    }
    return 0;
}

• 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