#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'
#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define rep(x,s,e) for (auto x=s;x!=e;x++)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,k;
int arr[160005];
ll cnt[34000005];
int ba[34000005];
uint __hash(int x){
x^=(x<<17);
x^=(x>>13);
x^=(x<<6);
return x;
}
int main(){
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(false);
cin>>n>>k;
rep(x,0,n+k) cin>>arr[x];
int l=n,r=n+k+k;
rep(x,0,n+k){
l--,r--;
if (r<x) break;
int a=max(x+1,l),b=min(r,n+k)+1;
rep(y,a,b){
int hh=__hash(arr[x]+arr[y])&33554431;
cnt[hh]++;
ba[hh]=arr[x]+arr[y];
}
}
int val;
rep(x,0,33554432) if (cnt[x]>=n/2){
val=ba[x];
break;
}
vector<int> ans;
r=n+k-1;
rep(x,0,n+k){
while (arr[x]+arr[r]>val) r--;
if (arr[x]+arr[r]==val){
ans.pub(arr[x]);
ans.pub(arr[r]);
r--;
if (sz(ans)==n) break;
}
}
sort(all(ans));
for (auto &it:ans) cout<<it<<" "; cout<<endl;
}
Compilation message
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:78:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
78 | for (auto &it:ans) cout<<it<<" "; cout<<endl;
| ^~~
tabletennis.cpp:78:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
78 | for (auto &it:ans) cout<<it<<" "; cout<<endl;
| ^~~~
tabletennis.cpp:66:23: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
66 | while (arr[x]+arr[r]>val) r--;
| ~~~~~~~~~~~~~^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
716 KB |
Output is correct |
| 2 |
Correct |
40 ms |
708 KB |
Output is correct |
| 3 |
Correct |
49 ms |
900 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
47 ms |
1140 KB |
Output is correct |
| 2 |
Correct |
88 ms |
86504 KB |
Output is correct |
| 3 |
Correct |
116 ms |
60144 KB |
Output is correct |
| 4 |
Correct |
134 ms |
87080 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
48 ms |
3924 KB |
Output is correct |
| 2 |
Correct |
104 ms |
47804 KB |
Output is correct |
| 3 |
Correct |
124 ms |
4768 KB |
Output is correct |
| 4 |
Correct |
117 ms |
49204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
64464 KB |
Output is correct |
| 2 |
Correct |
85 ms |
77896 KB |
Output is correct |
| 3 |
Correct |
50 ms |
89836 KB |
Output is correct |
| 4 |
Correct |
85 ms |
75428 KB |
Output is correct |
| 5 |
Correct |
86 ms |
89432 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
1184 KB |
Output is correct |
| 2 |
Correct |
36 ms |
1760 KB |
Output is correct |
| 3 |
Correct |
32 ms |
2152 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
4300 KB |
Output is correct |
| 2 |
Correct |
14 ms |
5324 KB |
Output is correct |
| 3 |
Correct |
121 ms |
185796 KB |
Output is correct |
| 4 |
Correct |
66 ms |
30208 KB |
Output is correct |
| 5 |
Correct |
40 ms |
6700 KB |
Output is correct |
| 6 |
Correct |
5 ms |
2636 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
45 ms |
4332 KB |
Output is correct |
| 2 |
Correct |
374 ms |
327520 KB |
Output is correct |
| 3 |
Correct |
221 ms |
330492 KB |
Output is correct |
| 4 |
Correct |
104 ms |
28996 KB |
Output is correct |
| 5 |
Correct |
227 ms |
314432 KB |
Output is correct |
| 6 |
Correct |
60 ms |
6660 KB |
Output is correct |
| 7 |
Correct |
122 ms |
46664 KB |
Output is correct |
| 8 |
Correct |
76 ms |
29376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
176 ms |
322060 KB |
Output is correct |
| 2 |
Correct |
2622 ms |
397068 KB |
Output is correct |
| 3 |
Correct |
2649 ms |
398496 KB |
Output is correct |
| 4 |
Correct |
2241 ms |
398448 KB |
Output is correct |
| 5 |
Correct |
1522 ms |
398428 KB |
Output is correct |
| 6 |
Correct |
1117 ms |
35924 KB |
Output is correct |
| 7 |
Correct |
2273 ms |
398508 KB |
Output is correct |
| 8 |
Correct |
2255 ms |
398468 KB |
Output is correct |
