oj.uz

Submission #717384

# Submission time Handle Problem Language Result Execution time Memory
717384 2023-04-01T22:07:01 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
58 / 100
 3000 ms 251560 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<1000000001> in;
    for (int i = 0; i < n + k; ++i) {
        cin >> arr[i];
        in[arr[i]] = true;
    }
    
    assert(n >= 2);
    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];

            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);
            }
        }
    }
}
// 1 2 1 2 3

Compilation message

tabletennis.cpp: In function 'int32_t main()':
tabletennis.cpp:34: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]
   34 |             if (nums.size() >= n) {
      |                 ~~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 122652 KB Output is correct
2 Correct 58 ms 122612 KB Output is correct
3 Correct 59 ms 122572 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 123220 KB Output is correct
2 Correct 101 ms 126564 KB Output is correct
3 Correct 96 ms 126484 KB Output is correct
4 Correct 98 ms 126532 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 126516 KB Output is correct
2 Correct 96 ms 126556 KB Output is correct
3 Correct 104 ms 126596 KB Output is correct
4 Correct 97 ms 126532 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 122576 KB Output is correct
2 Correct 64 ms 122544 KB Output is correct
3 Correct 58 ms 122644 KB Output is correct
4 Correct 60 ms 122612 KB Output is correct
5 Correct 57 ms 122544 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 122604 KB Output is correct
2 Correct 57 ms 122596 KB Output is correct
3 Correct 58 ms 122628 KB Output is correct

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 122580 KB Output is correct
2 Correct 59 ms 122672 KB Output is correct
3 Correct 61 ms 122608 KB Output is correct
4 Correct 64 ms 122612 KB Output is correct
5 Correct 61 ms 122572 KB Output is correct
6 Runtime error 162 ms 248392 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 122488 KB Output is correct
2 Correct 478 ms 126604 KB Output is correct
3 Correct 116 ms 127580 KB Output is correct
4 Correct 330 ms 127668 KB Output is correct
5 Correct 108 ms 127300 KB Output is correct
6 Runtime error 179 ms 251560 KB Execution killed with signal 11
7 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 122640 KB Output is correct
2 Execution timed out 3096 ms 123876 KB Time limit exceeded
3 Halted 0 ms 0 KB -