oj.uz

Submission #486853

# Submission time Handle Problem Language Result Execution time Memory
486853 2021-11-13T01:39:54 Z couplefire Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 345 ms 33044 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k, m, arr[200405];

void check(int sum){
    vector<int> res;
    for(int l = 0, r = m-1; l<r;){
        if(arr[l]+arr[r]==sum) res.push_back(arr[l]), res.push_back(arr[r]), ++l, --r;
        else if(arr[l]+arr[r]<sum) ++l;
        else --r;
    }
    while((int)res.size()>n) res.pop_back();
    if((int)res.size()<n) return;
    sort(res.begin(), res.end());
    for(auto x : res)
        cout << x << ' ';
    cout << '\n'; exit(0);
}

int main(){
    // freopen("a.in", "r", stdin);
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k; m = n+k;
    for(int i = 0; i<m; ++i)
        cin >> arr[i];
    sort(arr, arr+m);
    vector<int> todo;
    if(m<4*k){
        for(int i = 0; i<m; ++i)
            for(int j = i+1; j<m; ++j)
                todo.push_back(arr[i]+arr[j]);
        sort(todo.begin(), todo.end());
        todo.erase(unique(todo.begin(), todo.end()), todo.end());
    } else{
        map<int, int> cnt;
        for(int i = 0; i<2*k; ++i)
            for(int j = 0; j<2*k; ++j)
                cnt[arr[i]+arr[m-1-j]]++;
        for(auto [x, y] : cnt)
            if(y>=k) todo.push_back(x);
    }
    for(auto x : todo)
        check(x);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 764 KB Output is correct
2 Correct 33 ms 3016 KB Output is correct
3 Correct 32 ms 3008 KB Output is correct
4 Correct 33 ms 3060 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3000 KB Output is correct
2 Correct 33 ms 3028 KB Output is correct
3 Correct 35 ms 3096 KB Output is correct
4 Correct 32 ms 4556 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 5 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 2 ms 588 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 34 ms 4588 KB Output is correct
3 Correct 34 ms 4540 KB Output is correct
4 Correct 34 ms 4568 KB Output is correct
5 Correct 34 ms 4556 KB Output is correct
6 Correct 34 ms 5388 KB Output is correct
7 Correct 34 ms 4460 KB Output is correct
8 Correct 37 ms 4480 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 976 KB Output is correct
2 Correct 345 ms 29880 KB Output is correct
3 Correct 301 ms 33044 KB Output is correct
4 Correct 202 ms 29008 KB Output is correct
5 Correct 108 ms 10692 KB Output is correct
6 Correct 55 ms 5416 KB Output is correct
7 Correct 187 ms 25800 KB Output is correct
8 Correct 186 ms 27976 KB Output is correct