#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-(s>e);x!=e-(s>e);s<e?x++: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];
vector<int> v[1770136];
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;
rep(y,max(x+1,l),min(r,n+k)+1){
//cout<<x<<" "<<y<<endl;
v[(arr[x]+arr[y])%1770136].pub(arr[x]+arr[y]);
}
}
int val;
rep(x,0,1770136){
sort(all(v[x]));
while (!v[x].empty()){
int temp=v[x].back();
int cnt=0;
while (!v[x].empty() && v[x].back()==temp){
v[x].pob();
cnt++;
}
if (cnt>=n/2){
val=temp;
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:80:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
80 | for (auto &it:ans) cout<<it<<" "; cout<<endl;
| ^~~
tabletennis.cpp:80:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
80 | for (auto &it:ans) cout<<it<<" "; cout<<endl;
| ^~~~
tabletennis.cpp:69:3: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
69 | if (arr[x]+arr[r]==val){
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
41952 KB |
Output is correct |
| 2 |
Correct |
31 ms |
41928 KB |
Output is correct |
| 3 |
Correct |
31 ms |
41928 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
37 ms |
42416 KB |
Output is correct |
| 2 |
Correct |
89 ms |
46152 KB |
Output is correct |
| 3 |
Correct |
84 ms |
46096 KB |
Output is correct |
| 4 |
Correct |
83 ms |
46156 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
84 ms |
46452 KB |
Output is correct |
| 2 |
Correct |
89 ms |
46840 KB |
Output is correct |
| 3 |
Correct |
86 ms |
46536 KB |
Output is correct |
| 4 |
Correct |
83 ms |
46808 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
42084 KB |
Output is correct |
| 2 |
Correct |
38 ms |
42196 KB |
Output is correct |
| 3 |
Correct |
36 ms |
42188 KB |
Output is correct |
| 4 |
Correct |
34 ms |
42160 KB |
Output is correct |
| 5 |
Correct |
34 ms |
42188 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
41804 KB |
Output is correct |
| 2 |
Correct |
30 ms |
41804 KB |
Output is correct |
| 3 |
Correct |
31 ms |
41804 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
31 ms |
41836 KB |
Output is correct |
| 2 |
Correct |
32 ms |
42152 KB |
Output is correct |
| 3 |
Correct |
39 ms |
43012 KB |
Output is correct |
| 4 |
Correct |
35 ms |
42232 KB |
Output is correct |
| 5 |
Correct |
34 ms |
42032 KB |
Output is correct |
| 6 |
Correct |
32 ms |
42108 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
30 ms |
41804 KB |
Output is correct |
| 2 |
Correct |
497 ms |
68012 KB |
Output is correct |
| 3 |
Correct |
260 ms |
65208 KB |
Output is correct |
| 4 |
Correct |
187 ms |
60204 KB |
Output is correct |
| 5 |
Correct |
255 ms |
65144 KB |
Output is correct |
| 6 |
Correct |
186 ms |
57968 KB |
Output is correct |
| 7 |
Correct |
178 ms |
60328 KB |
Output is correct |
| 8 |
Correct |
202 ms |
59336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
44640 KB |
Output is correct |
| 2 |
Execution timed out |
3046 ms |
153916 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
