# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717871 | 2023-04-02T17:18:28 Z | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 8092 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' #define all(x) x.begin(),x.end() const int MOD = 1e9 + 7, SZ = 1e5 + 10, MX = 1e9; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; int arr[n + k]; for(int &i : arr) cin >> i; ll a[k + 1], b[k + 1]; for(int i=0;i<=k;i++) a[i] = arr[i]; reverse(arr, arr + n + k); for(int i=0;i<=k;i++) b[i] = arr[i]; set<ll> vec; for(ll i : a){ for(ll j : b){ if(i == j) continue; vec.insert(i + j); } } reverse(arr, arr + n + k); for(ll i : vec){ vector<int> ans; int l = 0, r = n + k - 1; while(l < r){ ll x = arr[l] + arr[r]; if(ans.size() == n) break; if(x == i){ ans.push_back(arr[l]); ans.push_back(arr[r]); } if(x >= i) r--; if(x <= i) l++; } if(ans.size() == n){ sort(all(ans)); for(int x : ans) cout << x << ' '; break; } } return 0; } // https://www.youtube.com/watch?v=zL32whN6p0A&ab_channel=HeidiAdel-CartoonWorld
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 772 KB | Output is correct |
2 | Correct | 35 ms | 3008 KB | Output is correct |
3 | Correct | 39 ms | 3068 KB | Output is correct |
4 | Correct | 30 ms | 3068 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 31 ms | 2996 KB | Output is correct |
2 | Correct | 33 ms | 3016 KB | Output is correct |
3 | Correct | 32 ms | 3096 KB | Output is correct |
4 | Correct | 31 ms | 3076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 596 KB | Output is correct |
2 | Correct | 4 ms | 724 KB | Output is correct |
3 | Correct | 1 ms | 724 KB | Output is correct |
4 | Correct | 3 ms | 596 KB | Output is correct |
5 | Correct | 1 ms | 724 KB | Output is correct |
# | 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 | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 288 ms | 3072 KB | Output is correct |
3 | Correct | 32 ms | 3012 KB | Output is correct |
4 | Correct | 48 ms | 3060 KB | Output is correct |
5 | Correct | 33 ms | 3060 KB | Output is correct |
6 | Correct | 49 ms | 4040 KB | Output is correct |
7 | Correct | 60 ms | 3056 KB | Output is correct |
8 | Correct | 56 ms | 3052 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 4620 KB | Output is correct |
2 | Execution timed out | 3029 ms | 8092 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |