#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define sz size()
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
fast
int n,k;cin>>n>>k;
vector<int>arr(n+k);
for(auto &i:arr){
cin>>i;
}
for(int i=0;i<=k;i++){
for(int j=n-1;j<n+k;j++){
int s=arr[i]+arr[j];
vector<int>v;
int l=0,r=n+k-1;
int cnt=n;
while(l<r){
if(!cnt || r-l+1<cnt)break;
else if(arr[l]+arr[r]<s){
++l;
}
else if(arr[l]+arr[r]>s){
--r;
}
else{
v.pb(arr[l]);
v.pb(arr[r]);
++l;--r;
cnt-=2;
}
}
if(!cnt){
sort(all(v));
for(int g=0;g<n;g++){
cout<<v[g]<<" ";
}
return 0;
}
}
}
return 0;
}
# |
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 |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
772 KB |
Output is correct |
2 |
Correct |
32 ms |
3036 KB |
Output is correct |
3 |
Correct |
32 ms |
3024 KB |
Output is correct |
4 |
Correct |
34 ms |
3100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
3092 KB |
Output is correct |
2 |
Correct |
34 ms |
3116 KB |
Output is correct |
3 |
Correct |
35 ms |
3016 KB |
Output is correct |
4 |
Correct |
32 ms |
3092 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 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 |
43 ms |
3100 KB |
Output is correct |
3 |
Correct |
32 ms |
3056 KB |
Output is correct |
4 |
Correct |
32 ms |
3048 KB |
Output is correct |
5 |
Correct |
40 ms |
2996 KB |
Output is correct |
6 |
Correct |
33 ms |
3052 KB |
Output is correct |
7 |
Correct |
32 ms |
3044 KB |
Output is correct |
8 |
Correct |
31 ms |
2984 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
129 ms |
3088 KB |
Output is correct |
3 |
Correct |
35 ms |
3016 KB |
Output is correct |
4 |
Correct |
81 ms |
3060 KB |
Output is correct |
5 |
Correct |
105 ms |
3020 KB |
Output is correct |
6 |
Correct |
33 ms |
3056 KB |
Output is correct |
7 |
Correct |
144 ms |
3080 KB |
Output is correct |
8 |
Correct |
32 ms |
3004 KB |
Output is correct |