# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442684 | 2021-07-08T15:12:45 Z | JovanB | Table Tennis (info1cup20_tabletennis) | C++17 | 51 ms | 4832 KB |
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; const int MAXN = 150000; int a[MAXN+5]; int main(){ ios_base::sync_with_stdio(false), cin.tie(0); cout.precision(10); cout << fixed; int n, k; cin >> n >> k; vector <int> vec; for(int i=1; i<=n+k; i++){ cin >> a[i]; } for(int ls=1; ls<=k+1; ls++){ for(int rs=n+k; rs>=n; rs--){ int sum = a[ls] + a[rs]; vec.clear(); vec.push_back(a[ls]); vec.push_back(a[rs]); int j = rs; for(int i=ls+1; i<=rs; i++){ if(vec.size() + (j-i+1) < n) break; if(a[i] >= sum - a[i]) break; if(vec.size() == n) break; while(j > i && a[i] + a[j] > sum) j--; if(a[i] + a[j] == sum){ vec.push_back(a[i]); vec.push_back(a[j]); } } if(vec.size() == n){ sort(vec.begin(), vec.end()); for(auto c : vec) cout << c << " "; cout << "\n"; return 0; } } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 956 KB | Output is correct |
2 | Correct | 41 ms | 4536 KB | Output is correct |
3 | Correct | 51 ms | 4448 KB | Output is correct |
4 | Correct | 41 ms | 4544 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 4544 KB | Output is correct |
2 | Correct | 41 ms | 4580 KB | Output is correct |
3 | Correct | 42 ms | 4544 KB | Output is correct |
4 | Correct | 41 ms | 4496 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 320 KB | Output is correct |
2 | Correct | 2 ms | 332 KB | Output is correct |
3 | Correct | 1 ms | 332 KB | Output is correct |
4 | Correct | 1 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Runtime error | 42 ms | 4832 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 448 KB | Output is correct |
2 | Runtime error | 20 ms | 3108 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |