# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890290 | 2023-12-21T00:48:00 Z | activedeltorre | Table Tennis (info1cup20_tabletennis) | C++14 | 115 ms | 10324 KB |
#include <algorithm> #include <iostream> #include <vector> #include <map> using namespace std; map<int,int>fre; int v[155005],m,k,n; vector<int>vec; int calc(int i ,int j) { int useless,st,dr; if(fre[v[i]+v[j]]==1) { return 0; } fre[v[i]+v[j]]=1; useless=i-1+m-j; st=i; dr=j; int grupe=0; while(useless<=k) { if(dr<=st) { break; } if(v[st]+v[dr]==v[i]+v[j]) { vec.push_back(v[st]); vec.push_back(v[dr]); st++; dr--; grupe+=2; } else if(v[st]+v[dr]<v[i]+v[j]) { st++; useless++; } else { dr--; useless++; } if(grupe==n) { break; } } if(grupe>=n) { sort(vec.begin(),vec.end()); for(i=0;i<n;i++) { cout<<vec[i]<<" "; } return 1; } vec.clear(); return 0; } int main() { int i,j,l,z; cin>>n>>k; m=n+k; for(i=1;i<=m;i++) { cin>>v[i]; } int imp=0; for(i=1;i<=k+1;i++) { for(j=0;j<=k;j++) { z=m-j; if(z>i && imp==0) { if(calc(i,z)==1) { imp=1; } } } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 860 KB | Output is correct |
2 | Correct | 63 ms | 3224 KB | Output is correct |
3 | Correct | 62 ms | 3012 KB | Output is correct |
4 | Correct | 77 ms | 3012 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 62 ms | 3020 KB | Output is correct |
2 | Correct | 63 ms | 2996 KB | Output is correct |
3 | Correct | 63 ms | 3012 KB | Output is correct |
4 | Correct | 62 ms | 3152 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 2 ms | 860 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 604 KB | Output is correct |
5 | Correct | 1 ms | 600 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 63 ms | 3012 KB | Output is correct |
3 | Correct | 63 ms | 2996 KB | Output is correct |
4 | Correct | 64 ms | 3164 KB | Output is correct |
5 | Correct | 62 ms | 3016 KB | Output is correct |
6 | Correct | 76 ms | 3188 KB | Output is correct |
7 | Correct | 64 ms | 3096 KB | Output is correct |
8 | Correct | 62 ms | 3132 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 115 ms | 10324 KB | Output is correct |
3 | Correct | 64 ms | 3016 KB | Output is correct |
4 | Correct | 89 ms | 6600 KB | Output is correct |
5 | Correct | 62 ms | 2976 KB | Output is correct |
6 | Correct | 64 ms | 3188 KB | Output is correct |
7 | Correct | 89 ms | 5324 KB | Output is correct |
8 | Correct | 62 ms | 3208 KB | Output is correct |