oj.uz

Submission #717338

# Submission time Handle Problem Language Result Execution time Memory
717338 2023-04-01T21:02:26 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
0 / 100
 77 ms 13168 KB 
#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 + m; i++) {
        cin >> v[i];
        mp[v[i]] = i + 1;
    }
    sort(all(v));
    vector<int>ans;
    vector<int>a, b;
    for (int i = 0; i < n / 2; i++) {
        if (i % 2 == 0)a.push_back(v[i]);
        else b.push_back(v[i]);
    }
    for (int i = n / 2; i < n; i++) {
        if (i % 2 == 1)a.push_back(v[i]);
        else b.push_back(v[i]);
    }
    int sum1 = 0, sum2 = 0;
    for (auto i : a) {
        sum1 += i;
    }
    for (auto i : b) {
        sum2 += i;
    }
    if (sum1 == sum2) {
        for (int i = 0; i < n; i++)cout << mp[v[i]] << ' ';
    }
    else {
        int x = sum1 - sum2;
        for (int i = 0; i < n / 2;i++) {
            if (v[n] - a[i] == -x) {
                a[i] = v[n];
                x = 0;
                break;
            }
        }
        for (int i = 0; i < n / 2; i++) {
            if (v[n] - b[i] == -x) {
                b[i] = v[n];
                x = 0;
                break;
            }
        }
        for (auto i : a)cout << mp[i] << ' ';
        for (auto i : b)cout << mp[i] << ' ';

    }
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2132 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 13168 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output not sorted
2 Halted 0 ms 0 KB -