#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[30000005];
int ba[30000005];
uint __hash(int x){
x^=(x<<17);
x^=(x>>13);
x+=35094808;
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])%30000000;
cnt[hh]++;
ba[hh]=arr[x]+arr[y];
}
}
int val;
rep(x,0,30000000) 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:79:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
79 | for (auto &it:ans) cout<<it<<" "; cout<<endl;
| ^~~
tabletennis.cpp:79:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
79 | for (auto &it:ans) cout<<it<<" "; cout<<endl;
| ^~~~
tabletennis.cpp:67:23: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
67 | while (arr[x]+arr[r]>val) r--;
| ~~~~~~~~~~~~~^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
844 KB |
Output is correct |
| 2 |
Correct |
36 ms |
680 KB |
Output is correct |
| 3 |
Correct |
58 ms |
992 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
1096 KB |
Output is correct |
| 2 |
Correct |
109 ms |
94980 KB |
Output is correct |
| 3 |
Correct |
94 ms |
69068 KB |
Output is correct |
| 4 |
Correct |
131 ms |
96064 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
88 ms |
4136 KB |
Output is correct |
| 2 |
Correct |
129 ms |
49088 KB |
Output is correct |
| 3 |
Correct |
104 ms |
4780 KB |
Output is correct |
| 4 |
Correct |
99 ms |
50912 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
73 ms |
63404 KB |
Output is correct |
| 2 |
Correct |
69 ms |
77640 KB |
Output is correct |
| 3 |
Correct |
62 ms |
88396 KB |
Output is correct |
| 4 |
Correct |
49 ms |
74052 KB |
Output is correct |
| 5 |
Correct |
95 ms |
88344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
972 KB |
Output is correct |
| 2 |
Correct |
21 ms |
1696 KB |
Output is correct |
| 3 |
Correct |
39 ms |
2104 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
34 ms |
4264 KB |
Output is correct |
| 2 |
Correct |
10 ms |
5324 KB |
Output is correct |
| 3 |
Correct |
113 ms |
174488 KB |
Output is correct |
| 4 |
Correct |
31 ms |
29856 KB |
Output is correct |
| 5 |
Correct |
23 ms |
6628 KB |
Output is correct |
| 6 |
Correct |
4 ms |
2636 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
4172 KB |
Output is correct |
| 2 |
Correct |
294 ms |
282208 KB |
Output is correct |
| 3 |
Correct |
236 ms |
284224 KB |
Output is correct |
| 4 |
Correct |
123 ms |
27320 KB |
Output is correct |
| 5 |
Correct |
229 ms |
269124 KB |
Output is correct |
| 6 |
Correct |
74 ms |
5120 KB |
Output is correct |
| 7 |
Correct |
105 ms |
44864 KB |
Output is correct |
| 8 |
Correct |
156 ms |
27624 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
143 ms |
298720 KB |
Output is correct |
| 2 |
Correct |
2883 ms |
354872 KB |
Output is correct |
| 3 |
Correct |
2807 ms |
355296 KB |
Output is correct |
| 4 |
Correct |
2461 ms |
355308 KB |
Output is correct |
| 5 |
Correct |
1356 ms |
355224 KB |
Output is correct |
| 6 |
Correct |
1261 ms |
34116 KB |
Output is correct |
| 7 |
Correct |
2449 ms |
355288 KB |
Output is correct |
| 8 |
Correct |
2388 ms |
355284 KB |
Output is correct |
