oj.uz

Submission #717397

# Submission time Handle Problem Language Result Execution time Memory
717397 2023-04-01T22:17:24 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
44 / 100
 80 ms 38856 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mxN = 2e5 + 7;

int arr[mxN];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    int n, k;
    cin >> n >> k;
    
    //bitset<2000000001> in;
    map<int,bool> in;
    for (int i = 0; i < n + k; ++i) {
        cin >> arr[i];
        in[arr[i]] = true;
    }
    
    map<int,int> freq;
    for (int i = 0; i < k + 2;  ++i) {
        for (int j = n + k - 1; j >= n - 1 && j > i; --j) {
            int sum = arr[i] + arr[j];
            freq[sum]++;
        }
    }

    int mx = 0, sum = 0;
    for (auto p : freq) {
        if (p.second > mx) {
            mx = p.second;
            sum = p.first;
        }
    }

    vector<int> nums;
    for (int l = 0; l < n + k; ++l) {
        if (sum - arr[l] >= 0 && in[sum - arr[l]]) {
            nums.push_back(arr[l]);
        }
    }

    for (int l = 0; l < n; ++l) {
        cout << nums[l] << ' ';
    }
    cout << "\n";
}
// 1 2 1 2 3

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2144 KB Output is correct
2 Correct 67 ms 13692 KB Output is correct
3 Correct 72 ms 13652 KB Output is correct
4 Correct 71 ms 13616 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 13652 KB Output is correct
2 Correct 69 ms 13704 KB Output is correct
3 Runtime error 80 ms 38856 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Incorrect 2 ms 852 KB Output not sorted
3 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

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

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 468 KB Output not sorted
3 Halted 0 ms 0 KB -

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 68 ms 13760 KB Output is correct
3 Correct 69 ms 13636 KB Output is correct
4 Correct 70 ms 13600 KB Output is correct
5 Correct 69 ms 13584 KB Output is correct
6 Correct 68 ms 13640 KB Output is correct
7 Correct 68 ms 13636 KB Output is correct
8 Correct 66 ms 13588 KB Output is correct

Subtask #8
0 / 13.0

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