# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
691386 | 2023-01-31T06:31:00 Z | Aiperiii | Table Tennis (info1cup20_tabletennis) | C++14 | 71 ms | 5724 KB |
#include <bits/stdc++.h> using namespace std; int n,k; long long a[150401]; void check(int begin,int end){ vector <long long> ans; int l=begin+1; int r=end-1; int bad=begin+n+k+1-end; long long t=a[r]+a[l]; while(l<r){ long long c=a[r]+a[l]; if(c==t){ ans.push_back(a[r]); ans.push_back(a[l]); l++; r--; if(ans.size()==n){ sort(ans.begin(),ans.end()); for(int i=0;i<ans.size();i++){ cout<<ans[i]<<" "; } exit(0); } } else if(c<t){ l++; bad++; } else{ r--; bad++; } if(bad>k){ return; } } } int main(){ cin.tie(0); ios_base::sync_with_stdio(0); cin>>n>>k; for(int i=1;i<=n+k;i++){ cin>>a[i]; } for(int i=0;i<=k;i++){ for(int j=0;j<=k-i;j++){ check(i,n+k+1-j); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 984 KB | Output is correct |
2 | Correct | 33 ms | 4260 KB | Output is correct |
3 | Correct | 30 ms | 4236 KB | Output is correct |
4 | Correct | 32 ms | 4224 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 31 ms | 4208 KB | Output is correct |
2 | Correct | 30 ms | 4292 KB | Output is correct |
3 | Correct | 31 ms | 4276 KB | Output is correct |
4 | Correct | 29 ms | 4260 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 2 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 31 ms | 4284 KB | Output is correct |
3 | Correct | 34 ms | 5660 KB | Output is correct |
4 | Correct | 33 ms | 5648 KB | Output is correct |
5 | Correct | 32 ms | 5724 KB | Output is correct |
6 | Correct | 32 ms | 5716 KB | Output is correct |
7 | Correct | 32 ms | 5700 KB | Output is correct |
8 | Correct | 39 ms | 5628 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 46 ms | 4176 KB | Output is correct |
3 | Correct | 32 ms | 5652 KB | Output is correct |
4 | Correct | 54 ms | 5636 KB | Output is correct |
5 | Correct | 31 ms | 5604 KB | Output is correct |
6 | Correct | 32 ms | 5684 KB | Output is correct |
7 | Correct | 71 ms | 5684 KB | Output is correct |
8 | Correct | 35 ms | 5708 KB | Output is correct |