oj.uz

Submission #718292

# Submission time Handle Problem Language Result Execution time Memory
718292 2023-04-03T19:47:36 Z haxorman Table Tennis (info1cup20_tabletennis) C++14
34 / 100
 265 ms 69960 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;
    
    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 - k - 1; --j) {
            int sum = arr[i] + arr[j];
            freq[sum]++;
        }
    }

    for (auto p : freq) {
        if (p.second >= k) {
            int 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]);
                }
            }

            if (nums.size() >= n) {
                for (int l = 0; l < n; ++l) {
                    cout << nums[l] << ' ';
                }
                cout << "\n";
                exit(0);
            }
        }
    }
    assert(false);
}
// 1 2 1 2 3

Compilation message

tabletennis.cpp: In function 'int32_t main()':
tabletennis.cpp:40:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   40 |             if (nums.size() >= n) {
      |                 ~~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2320 KB Output is correct
2 Correct 265 ms 69960 KB Output is correct
3 Correct 115 ms 22980 KB Output is correct
4 Correct 93 ms 22968 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 27612 KB Output is correct
2 Correct 92 ms 23008 KB Output is correct
3 Correct 177 ms 38040 KB Output is correct
4 Correct 91 ms 22988 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 4 ms 1876 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Runtime error 1 ms 468 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 59 ms 17568 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -