# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717381 | 2023-04-01T22:04:14 Z | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 508748 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; } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 724 KB | Output is correct |
2 | Correct | 1 ms | 596 KB | Output is correct |
3 | Correct | 1 ms | 596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 2256 KB | Output is correct |
2 | Correct | 120 ms | 32588 KB | Output is correct |
3 | Correct | 91 ms | 23120 KB | Output is correct |
4 | Correct | 92 ms | 23116 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 160 ms | 48392 KB | Output is correct |
2 | Correct | 129 ms | 32468 KB | Output is correct |
3 | Correct | 208 ms | 64544 KB | Output is correct |
4 | Correct | 120 ms | 32416 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 852 KB | Output is correct |
2 | Correct | 341 ms | 34612 KB | Output is correct |
3 | Correct | 2 ms | 1236 KB | Output is correct |
4 | Correct | 121 ms | 32736 KB | Output is correct |
5 | Correct | 3 ms | 1284 KB | Output is correct |
# | 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 44 ms | 13780 KB | Output is correct |
3 | Correct | 6 ms | 3028 KB | Output is correct |
4 | Correct | 40 ms | 19088 KB | Output is correct |
5 | Correct | 6 ms | 3028 KB | Output is correct |
6 | Correct | 9 ms | 1620 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Execution timed out | 3093 ms | 508748 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 5972 KB | Output is correct |
2 | Execution timed out | 3087 ms | 447540 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |