/*input
4 2
1 2 3 4 5 6
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_sett;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memsett(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e17;
const int INF=0x3f3f3f3f;
const ll MOD2=3006703054056749LL;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
ll mult(ll a,ll b){
return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
ll res=1;
while(b){
if(b&1) res=mult(res,a);
a=mult(a,a);
b/=2;
}
return res;
}
int arr[maxn];
int ar[maxn];
int32_t main(){
ios::sync_with_stdio(false),cin.tie(0);
int n,k;
cin>>n>>k;
REP(i,n+k) cin>>arr[i];
REP(i,k+1){
for(int j=n+k-1;j>=n+i-1;j--){
int pp=0;
int s=arr[i]+arr[j],ans=0;
for(int a=i;a<=j;a++){
while(pp and ar[pp]+arr[a]>s) --pp;
if(pp and ar[pp]+arr[a]==s) ++ans;
else ar[++pp]=arr[a];
}
if(ans==(n/2)){
pp=0;
vector<int> v;
for(int a=i;a<=j;a++){
while(pp and ar[pp]+arr[a]>s) --pp;
if(pp and ar[pp]+arr[a]==s) v.pb(arr[a]),v.pb(s-arr[a]);
else ar[++pp]=arr[a];
}
sort(ALL(v));
for(auto x:v) cout<<x<<' ';
return 0;
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
844 KB |
Output is correct |
2 |
Correct |
51 ms |
3328 KB |
Output is correct |
3 |
Correct |
44 ms |
3648 KB |
Output is correct |
4 |
Correct |
45 ms |
3648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
3528 KB |
Output is correct |
2 |
Correct |
45 ms |
3380 KB |
Output is correct |
3 |
Correct |
56 ms |
3352 KB |
Output is correct |
4 |
Correct |
46 ms |
3664 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
3 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
3 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
3 ms |
356 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
2 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
254 ms |
3580 KB |
Output is correct |
3 |
Correct |
52 ms |
3648 KB |
Output is correct |
4 |
Correct |
106 ms |
3524 KB |
Output is correct |
5 |
Correct |
48 ms |
3616 KB |
Output is correct |
6 |
Correct |
83 ms |
3708 KB |
Output is correct |
7 |
Correct |
99 ms |
3412 KB |
Output is correct |
8 |
Correct |
59 ms |
3452 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Execution timed out |
3044 ms |
1352 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |