#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[177013];
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])%177013].pub(arr[x]+arr[y]);
}
}
int val;
rep(x,0,177013){
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 |
4 ms |
4428 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4428 KB |
Output is correct |
| 3 |
Correct |
4 ms |
4428 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
5068 KB |
Output is correct |
| 2 |
Correct |
59 ms |
8732 KB |
Output is correct |
| 3 |
Correct |
59 ms |
8756 KB |
Output is correct |
| 4 |
Correct |
65 ms |
8688 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
58 ms |
9068 KB |
Output is correct |
| 2 |
Correct |
62 ms |
9424 KB |
Output is correct |
| 3 |
Correct |
59 ms |
9200 KB |
Output is correct |
| 4 |
Correct |
59 ms |
9384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
4684 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4812 KB |
Output is correct |
| 3 |
Correct |
6 ms |
4812 KB |
Output is correct |
| 4 |
Correct |
5 ms |
4812 KB |
Output is correct |
| 5 |
Correct |
5 ms |
4860 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4428 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4428 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4428 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4428 KB |
Output is correct |
| 2 |
Correct |
5 ms |
4684 KB |
Output is correct |
| 3 |
Correct |
9 ms |
5580 KB |
Output is correct |
| 4 |
Correct |
5 ms |
4856 KB |
Output is correct |
| 5 |
Correct |
5 ms |
4684 KB |
Output is correct |
| 6 |
Correct |
6 ms |
4684 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4428 KB |
Output is correct |
| 2 |
Correct |
485 ms |
30100 KB |
Output is correct |
| 3 |
Correct |
252 ms |
27340 KB |
Output is correct |
| 4 |
Correct |
158 ms |
22720 KB |
Output is correct |
| 5 |
Correct |
212 ms |
27376 KB |
Output is correct |
| 6 |
Correct |
171 ms |
20632 KB |
Output is correct |
| 7 |
Correct |
157 ms |
22780 KB |
Output is correct |
| 8 |
Correct |
156 ms |
21972 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
6604 KB |
Output is correct |
| 2 |
Execution timed out |
3084 ms |
202500 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
