# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365981 | 2021-02-12T15:51:22 Z | ahmedfouadnew | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 249924 KB |
#include<bits/stdc++.h> using namespace std; #define s second #define f first #define pb push_back //#define int long long int n,a[200001],k; unordered_map<int,int>mp; void fun(int bal) { vector<int>v; for(int i=0;i<n+k;i++) { if(mp[bal-a[i]]) { v.pb(a[i]); } } if(v.size()!=n) return; for(int i=0;i<v.size();i++) { if(i) printf(" "); printf("%d",v[i]); } exit(0); } signed main() { scanf("%d%d",&n,&k); for(int i=0;i<n+k;i++) { scanf("%d",a+i); mp[a[i]]=1; } for(int i=0;i<=k+1;i++) { int cnt=70; while(cnt--) { int drgn=rand()%(k+1); fun(a[i]+a[n+k-1-drgn]); } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 620 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 1692 KB | Output is correct |
2 | Correct | 941 ms | 22204 KB | Output is correct |
3 | Correct | 91 ms | 10676 KB | Output is correct |
4 | Correct | 95 ms | 10676 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1103 ms | 37860 KB | Output is correct |
2 | Correct | 259 ms | 22236 KB | Output is correct |
3 | Correct | 1957 ms | 59248 KB | Output is correct |
4 | Correct | 253 ms | 22236 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 620 KB | Output is correct |
2 | Correct | 136 ms | 16732 KB | Output is correct |
3 | Correct | 2 ms | 748 KB | Output is correct |
4 | Correct | 125 ms | 15584 KB | Output is correct |
5 | Correct | 2 ms | 748 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 0 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 | 43 ms | 8884 KB | Output is correct |
3 | Correct | 4 ms | 1132 KB | Output is correct |
4 | Correct | 110 ms | 14388 KB | Output is correct |
5 | Correct | 4 ms | 1132 KB | Output is correct |
6 | Correct | 9 ms | 1260 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Execution timed out | 3080 ms | 240808 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3046 ms | 249924 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |