# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
342625 | ogibogi2004 | Table Tennis (info1cup20_tabletennis) | C++14 | 3057 ms | 4716 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];
bool found=0;
map<int,int> mp;
void check(int s)
{
vector<int>v1,v2;
int l=1,r=n;
while(l<r)
{
if(v1.size()+v2.size()==n)break;
if(a[l]+a[r]==s)
{
v1.push_back(a[l]);
v2.push_back(a[r]);
l++;r--;
}
else
{
if(a[l]+a[r]>s)
{
r--;
}
else l++;
}
}
if(v1.size()+v2.size()<n)return;
reverse(v2.begin(),v2.end());
found=1;
for(auto xd:v1)cout<<xd<<" ";
for(auto xd:v2)cout<<xd<<" ";
cout<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
cin>>n>>k;
for(int i=1;i<=n+k;i++)
{
cin>>a[i];
}
for(int i=1;i<=k;i++)
{
for(int j=n;j<=n+k;j++)
{
mp[a[i]+a[j]]++;
}
}
for(auto xd:mp)
{
if(xd.second<k)continue;
check(xd.first);
if(found)return 0;
}
for(auto xd:mp)
{
check(xd.first);
if(found)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... |