oj.uz

Submission #717893

# Submission time Handle Problem Language Result Execution time Memory
717893 2023-04-02T19:36:43 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 17416 KB 
#include "bits/stdc++.h"
#define ll long long
using namespace std;
const ll mod = 1000000007;

int b[150001];

signed main () {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("cowland.in","r",stdin);
    // freopen("cowland.out","w",stdout);

    int n, k;
    cin >> n >> k;
    vector<int> v;
    for(int i = 0; i < n + k; i++) {
        int x;
        cin >> x;
        v.push_back(x);
    }
    sort(v.begin(), v.end());
    set<int> s;
    for(int i = 0; i <= k; i++) {
        int j = n + k - 1;
        while(i < j && i + ((n + k) - j - 1) <= k)
            s.insert(v[i] + v[j--]);
    }
    for(int x : s) {
        int y = 0;
        for(int i = 0; i < n + k && y < n; i++) {
            int o = lower_bound(v.begin(), v.end(), x - v[i]) - v.begin();
            if(o < i && o < n + k && v[i] + v[o] == x && b[o] == 1) {
                b[i] = b[o] = 2;
                y += 2;
            }
            else
                b[i] = 1;
        }
        if(y >= n) {
            set<int> ans;
            for(int i = 0; i < n + k; i++) {
                if(b[i] == 2)
                    ans.insert(v[i]);
            }
            for(int i : ans)
                cout << i << " ";
            return 0;
        }
        for(int i = 0; i < n + k; i++)
            b[i] = 0;
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1620 KB Output is correct
2 Correct 88 ms 9948 KB Output is correct
3 Correct 72 ms 9896 KB Output is correct
4 Correct 72 ms 9928 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 9956 KB Output is correct
2 Correct 76 ms 9976 KB Output is correct
3 Correct 103 ms 9948 KB Output is correct
4 Correct 72 ms 9928 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 12 ms 572 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 4 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 10 ms 364 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 3 ms 340 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 1347 ms 17416 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4052 KB Output is correct
2 Execution timed out 3061 ms 5172 KB Time limit exceeded
3 Halted 0 ms 0 KB -