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>
#define endl '\n'
using namespace std;
const int MAXN=150005;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n,k;
long long a[MAXN];
void read()
{
cin>>n>>k;
for(int i=1;i<=n+k;i++)
cin>>a[i];
}
bool check(int idx)
{
int i=1,j=n+k;
if(i==idx)i++;
if(j==idx)j--;
long long sum=a[i]+a[j];
i++;
j--;
while(i<j)
{
if(i==idx)i++;
if(j==idx)j--;
if(a[i]+a[j]!=sum)return false;
i++;
j--;
}
return true;
}
void solve_st1()
{
for(int i=1;i<=n+k;i++)
{
if(check(i)==true)
{
for(int j=1;j<i;j++)
cout<<a[j]<<" ";
for(int j=i+1;j<=n+k;j++)
cout<<a[j]<<" ";
cout<<endl;
}
}
}
int main()
{
speed();
read();
if(k==1&&n<=2000)
{
solve_st1();
}
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... |