oj.uz

답안 #366167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366167 2021-02-13T12:13:45 Z Ahmad_Hasan Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 951872 KB 
#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++){
        if(mp(v[r]-(v[i]-v[l]))>i+1){
            int ret2=1+slv(i,mp(v[r]-(v[i]-v[l]))-1);
            ///cout<<'#'<<i<<' '<<mp(v[r]-(v[i]-v[l]))-1<<'\n';
            if(ret2>ret){
                ret=ret2;
                dp[l][r].second={i,mp(v[r]-(v[i]-v[l]))-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:84:20: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]
   84 |         v2[tol]=v[l],v2[tor]=v[r];
      |                    ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7660 KB Output is correct
2 Correct 6 ms 7660 KB Output is correct
3 Correct 7 ms 7660 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 12012 KB Output is correct
2 Correct 126 ms 30060 KB Output is correct
3 Correct 123 ms 30060 KB Output is correct
4 Correct 126 ms 30060 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 32364 KB Output is correct
2 Correct 184 ms 32364 KB Output is correct
3 Correct 174 ms 32364 KB Output is correct
4 Correct 191 ms 32364 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 8044 KB Output is correct
2 Correct 28 ms 8044 KB Output is correct
3 Correct 32 ms 8044 KB Output is correct
4 Correct 27 ms 8044 KB Output is correct
5 Correct 29 ms 8044 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 6 ms 7404 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 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 17 ms 8300 KB Output is correct
5 Correct 23 ms 8300 KB Output is correct
6 Correct 105 ms 10604 KB Output is correct

Subtask #7
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 1207 ms 74788 KB Output is correct
3 Correct 1219 ms 74736 KB Output is correct
4 Correct 1514 ms 81380 KB Output is correct
5 Correct 1276 ms 74920 KB Output is correct
6 Execution timed out 3065 ms 130752 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1059 ms 16344 KB Output is correct
2 Execution timed out 3150 ms 951872 KB Time limit exceeded
3 Halted 0 ms 0 KB -