| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346700 | fatime_aslan_156 | Table Tennis (info1cup20_tabletennis) | C++20 | 172 ms | 4280 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,k;
cin>>n>>k;
vector<ll>v(n+k);
for(int i=0; i<n+k; i++)
{
cin>>v[i];
}
set<ll>s;
for(int i=0; i<=k; i++)
{
for(int j=n-1; j<n+k; j++)
{
if(i<j)
{
deque<ll>f,q;
ll l=i,r=j,e=0;
while(l<r && e<=k)
{
if(v[l]+v[r]==v[i]+v[j])
{
f.push_back(v[l]);
q.push_front(v[r]);
l++;
r--;
}
else if(v[l]+v[r]<v[i]+v[j])
{
l++;
e++;
}
else
{
r--;
e++;
}
}
if(f.size()*2<n)
{
continue;
}
while(f.size()*2>n)
{
f.pop_back();
q.pop_back();
}
for(int ji:f)
cout<<ji<<' ';
for(int ji:q)
cout<<ji<<' ';
return 0;
}
}
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
