#include <bits/stdc++.h>
#define int long long
/**
|||||||||| ||||| ||||| ||||||||||
||||||||||||| ||||| ||||| |||||
|||| |||||| ||||| ||||| |||||
||||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| ||||||||||
AHMED;HASSAN;SAEED;
*/
using namespace std;
vector<pair<int,int> >vls;
vector<int>v;
map<int,pair<int,pair<int,int> > >dp[150000];
bool comp(pair<int,int>a,pair<int,int>b){
if(a.first==b.first)
return a.second<b.second;
return a.first<b.first;
}
int mp(int key){
vector<pair<int,int> >::iterator it=lower_bound(vls.begin(),vls.end(),make_pair(key,-1),comp);
if(it==vls.end()||((it->first)!=key))
return 0;
return it->second;
}
int n,k;
int slv(int l,int r){
if(dp[l][r].first)
return dp[l][r].first;
int ret=1;
for(int i=l+1;i<r&&(i-l)<=k+5;i++){
int mpvl=mp(v[r]-(v[i]-v[l]));
if(mpvl>i+1){
int ret2=1+slv(i,mpvl-1);
///cout<<'#'<<i<<' '<<mp(v[r]-(v[i]-v[l]))-1<<'\n';
if(ret2>ret){
ret=ret2;
dp[l][r].second={i,mpvl-1};
}
}
}
return dp[l][r].first=ret;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n>>k;
n+=k;
vls=vector<pair<int,int> >(n*k+5);
int cr=0;
v=vector<int>(n);
for(int i=0;i<n;i++){
cin>>v[i];
for(int j=0;j<k;j++)
vls[cr++]={v[i],i+1};
}
sort(vls.begin(),vls.end(),comp);
int ans=0;
int l,r;
for(int i=0;i<=k;i++){
for(int j=n-1;j>=n-k-1&&(i+n-1-j)<=k;j--){
int ret=slv(i,j);
if(ret>ans){
ans=ret;
l=i,r=j;
}
}
}
vector<int>v2(n-k);
int cnt=0;
int tol=0,tor=n-k-1;
while(cnt<n-k){
v2[tol]=v[l],v2[tor]=v[r];
int nl=dp[l][r].second.first,nr=dp[l][r].second.second;
l=nl,r=nr;
cnt+=2;
tol++; tor--;
}
for(int i=0;i<n-k;i++)
cout<<v2[i]<<' ';
return 0;
}
Compilation message
tabletennis.cpp: In function 'int32_t main()':
tabletennis.cpp:85:20: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
85 | v2[tol]=v[l],v2[tor]=v[r];
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
7660 KB |
Output is correct |
2 |
Correct |
7 ms |
7660 KB |
Output is correct |
3 |
Correct |
7 ms |
7660 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
12012 KB |
Output is correct |
2 |
Correct |
126 ms |
30164 KB |
Output is correct |
3 |
Correct |
120 ms |
30188 KB |
Output is correct |
4 |
Correct |
122 ms |
30188 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
167 ms |
32620 KB |
Output is correct |
2 |
Correct |
190 ms |
32492 KB |
Output is correct |
3 |
Correct |
170 ms |
32492 KB |
Output is correct |
4 |
Correct |
179 ms |
32436 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
25 ms |
8044 KB |
Output is correct |
2 |
Correct |
29 ms |
8056 KB |
Output is correct |
3 |
Correct |
32 ms |
8044 KB |
Output is correct |
4 |
Correct |
29 ms |
8044 KB |
Output is correct |
5 |
Correct |
30 ms |
8044 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
7404 KB |
Output is correct |
2 |
Correct |
6 ms |
7404 KB |
Output is correct |
3 |
Correct |
5 ms |
7404 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
7404 KB |
Output is correct |
2 |
Correct |
17 ms |
8300 KB |
Output is correct |
3 |
Correct |
17 ms |
8300 KB |
Output is correct |
4 |
Correct |
18 ms |
8300 KB |
Output is correct |
5 |
Correct |
17 ms |
8300 KB |
Output is correct |
6 |
Correct |
88 ms |
10604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
7404 KB |
Output is correct |
2 |
Correct |
1183 ms |
74860 KB |
Output is correct |
3 |
Correct |
1168 ms |
74732 KB |
Output is correct |
4 |
Correct |
1430 ms |
81448 KB |
Output is correct |
5 |
Correct |
1232 ms |
74860 KB |
Output is correct |
6 |
Execution timed out |
3056 ms |
124840 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
962 ms |
16512 KB |
Output is correct |
2 |
Execution timed out |
3137 ms |
950380 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |