| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 342594 | ogibogi2004 | Table Tennis (info1cup20_tabletennis) | C++14 | 3076 ms | 2412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int MAXN=150002;
int n,k;
int a[MAXN];
int main()
{
cin>>n>>k;
for(int i=1;i<=n+k;i++)
{
cin>>a[i];
}
sort(a,a+n);
for(int i=1;i<=k&&i<=n+k;i++)
{
for(int j=n+k;i-1+(n+k-j)<=k;j--)
{
int sum=a[i]+a[j];
int l=i,r=j,cnt=0;
for(;;)
{
if(l==r||l>r)break;
if(a[l]+a[r]==sum)
{
cnt++;l++;r--;
}
else
{
if(a[l]+a[r]>sum)r--;
else l++;
}
}
if(cnt>=n/2)
{
vector<int>v;
l=i,r=j;
for(;;)
{
//l++;r--;
if(l==r||l>r)break;
if(v.size()==n)break;
if(a[l]+a[r]==sum)
{
v.push_back(a[l]);
v.push_back(a[r]);
l++;
r--;
}
else
{
if(a[l]+a[r]>sum)r--;
else l++;
}
}
sort(v.begin(),v.end());
for(int xd=0;xd<n;xd++)cout<<v[xd]<<" ";
cout<<endl;
return 0;
}
}
}
return 0;
}
Compilation message (stderr)
| # | 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... | ||||
