# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
756479 | 2023-06-11T17:44:51 Z | Alkarat | Table Tennis (info1cup20_tabletennis) | C++14 | 130 ms | 4664 KB |
#include <bits/stdc++.h> using namespace std; const int N=2e5+5; int n,k,a[N]; map<int,int>ck; bool check(int l,int r) { int sum=a[l]+a[r],eli=0; vector<int>g; while(l<r) { if(a[l]+a[r]==sum) { g.push_back(a[l]); g.push_back(a[r]); l++; r--; } else if(a[l]+a[r]>sum) { r--; eli++; } else { l++; eli++; } if(eli>k) return 0; if(g.size()==n) { sort(g.begin(),g.end()); for(int e:g) cout<<e<<" "; return 1; } } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n>>k; for(int i=1; i<=n+k; i++) cin>>a[i]; for(int i=1; i<=k+1; i++) for(int j=n+k; j>=i+n-1; j--) if(check(i,j)) return 0; }
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 | 2 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 956 KB | Output is correct |
2 | Correct | 33 ms | 4520 KB | Output is correct |
3 | Correct | 43 ms | 4664 KB | Output is correct |
4 | Correct | 33 ms | 4440 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 4548 KB | Output is correct |
2 | Correct | 35 ms | 4524 KB | Output is correct |
3 | Correct | 32 ms | 4596 KB | Output is correct |
4 | Correct | 33 ms | 4552 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 2 ms | 336 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 2 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 | 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 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 468 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 36 ms | 4616 KB | Output is correct |
3 | Correct | 35 ms | 4480 KB | Output is correct |
4 | Correct | 42 ms | 4552 KB | Output is correct |
5 | Correct | 33 ms | 4464 KB | Output is correct |
6 | Correct | 34 ms | 4508 KB | Output is correct |
7 | Correct | 35 ms | 4544 KB | Output is correct |
8 | Correct | 35 ms | 4500 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 130 ms | 4532 KB | Output is correct |
3 | Correct | 37 ms | 4496 KB | Output is correct |
4 | Correct | 72 ms | 4548 KB | Output is correct |
5 | Correct | 33 ms | 4436 KB | Output is correct |
6 | Correct | 34 ms | 4576 KB | Output is correct |
7 | Correct | 102 ms | 4552 KB | Output is correct |
8 | Correct | 34 ms | 4548 KB | Output is correct |