# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339146 | 2020-12-24T16:40:31 Z | cheissmart | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 4712 KB |
#include <bits/stdc++.h> #define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0); #define F first #define S second #define V vector #define PB push_back #define MP make_pair #define EB emplace_back #define ALL(v) (v).begin(), (v).end() #define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << endl using namespace std; typedef long long ll; typedef pair<int, int> pi; typedef V<int> vi; const int INF = 1e9 + 7; signed main() { IO_OP; int n, k; cin >> n >> k; vi a(n + k); for(int i = 0; i < n + k; i++) cin >> a[i]; for(int left = 0; left <= k; left++) { for(int right = 0; right + left <= k; right++) { int l = left, r = n + k - right - 1; int sum = a[l] + a[r]; vi ans; while(l < r && ans.size() < n) { if(a[l] + a[r] == sum) { ans.PB(a[l]); ans.PB(a[r]); l++, r--; } else if(a[l] + a[r] < sum) l++; else r--; } sort(ALL(ans)); if(ans.size() == n) { for(int i:ans) cout << i << " "; cout << endl; return 0; } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 876 KB | Output is correct |
2 | Correct | 41 ms | 4584 KB | Output is correct |
3 | Correct | 44 ms | 4584 KB | Output is correct |
4 | Correct | 40 ms | 4584 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 40 ms | 3432 KB | Output is correct |
2 | Correct | 40 ms | 3432 KB | Output is correct |
3 | Correct | 41 ms | 4584 KB | Output is correct |
4 | Correct | 41 ms | 4584 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 2 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 2 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 2 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 2 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 210 ms | 4712 KB | Output is correct |
3 | Correct | 45 ms | 4584 KB | Output is correct |
4 | Correct | 76 ms | 4584 KB | Output is correct |
5 | Correct | 42 ms | 4584 KB | Output is correct |
6 | Correct | 60 ms | 4584 KB | Output is correct |
7 | Correct | 75 ms | 4712 KB | Output is correct |
8 | Correct | 42 ms | 4584 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Execution timed out | 3065 ms | 2412 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |