# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728705 | 2023-04-22T21:59:41 Z | MilosMilutinovic | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 2328 KB |
#include <bits/stdc++.h> using namespace std; int n,k,a[305005]; bool solve(int x) { int p=n+k,c=0; vector<int> ans; for(int i=1;i<=n+k;i++) { while(p>i&&a[i]+a[p]>x) p--; if(p>i&&a[i]+a[p]==x) { ans.push_back(a[i]); ans.push_back(a[p]); c++,p--; } } if(c>=n/2) { sort(ans.begin(),ans.end()); for(int i=0;i<(int)ans.size();i++) printf("%d ",ans[i]); return true; } return false; } signed main() { scanf("%d%d",&n,&k); for(int i=1;i<=n+k;i++) scanf("%d",&a[i]); sort(a+1,a+n+k+1); if(n<=k) { for(int i=1;i<=n+k;i++) for(int j=i+1;j<=n+k;j++) if(solve(a[i]+a[j])) exit(0); } else { mt19937 rng(time(0)); while(true) { int x=rng()%(n+k)+1; for(int i=max(1,x-k-1);i<=min(n+k,x+k+1);i++) if(x!=i&&solve(a[x]+a[i])) exit(0); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 47 ms | 300 KB | Output is correct |
2 | Correct | 3 ms | 324 KB | Output is correct |
3 | Correct | 3 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1677 ms | 740 KB | Output is correct |
2 | Execution timed out | 3058 ms | 2328 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3059 ms | 936 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 8 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 312 KB | Output is correct |
4 | Correct | 4 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 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 | 6 ms | 340 KB | Output is correct |
3 | Correct | 32 ms | 332 KB | Output is correct |
4 | Correct | 11 ms | 344 KB | Output is correct |
5 | Correct | 21 ms | 348 KB | Output is correct |
6 | Correct | 12 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 3037 ms | 796 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Execution timed out | 3051 ms | 820 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |