# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728703 | 2023-04-22T21:57:04 Z | MilosMilutinovic | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 3000 KB |
#include <bits/stdc++.h> using namespace std; int n,k,a[305005],id[305005]; bool solve(int x) { int p=n,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; } bool cmp(int i,int j) { return a[i]<a[j]; } signed main() { scanf("%d%d",&n,&k); for(int i=1;i<=n+k;i++) scanf("%d",&a[i]),id[i]=i; sort(id+1,id+n+k+1,cmp); sort(a+1,a+n+k+1); if(n<=k) { for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) if(solve(a[i]+a[j])) exit(0); } else { mt19937 rng(time(0)); while(true) { int x=rng()%n+1; for(int i=max(1,x-k);i<=min(n+k,x+k);i++) if(x!=i&&solve(a[x]+a[i])) exit(0); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3081 ms | 340 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3074 ms | 876 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3068 ms | 3000 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 4 ms | 212 KB | Unexpected end of file - int32 expected |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 308 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 3083 ms | 436 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 3074 ms | 2892 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 3070 ms | 2972 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |