oj.uz

Submission #366172

# Submission time Handle Problem Language Result Execution time Memory
366172 2021-02-13T12:31:20 Z Ahmad_Hasan Table Tennis (info1cup20_tabletennis) C++17
78 / 100
 2995 ms 1048580 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++){
        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};
            }
            break;
        }

    }

    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};
    }
    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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7660 KB Output is correct
2 Correct 6 ms 7660 KB Output is correct
3 Correct 6 ms 7660 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 11756 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 31212 KB Output is correct
2 Correct 62 ms 31212 KB Output is correct
3 Correct 67 ms 31212 KB Output is correct
4 Correct 64 ms 31212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 8044 KB Output is correct
2 Correct 22 ms 8044 KB Output is correct
3 Correct 24 ms 8044 KB Output is correct
4 Correct 22 ms 8064 KB Output is correct
5 Correct 24 ms 8044 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 5 ms 7404 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 7 ms 8300 KB Output is correct
3 Correct 7 ms 8320 KB Output is correct
4 Correct 6 ms 8300 KB Output is correct
5 Correct 6 ms 8300 KB Output is correct
6 Correct 14 ms 10604 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 98 ms 73452 KB Output is correct
3 Correct 98 ms 73452 KB Output is correct
4 Correct 122 ms 80236 KB Output is correct
5 Correct 99 ms 73580 KB Output is correct
6 Correct 821 ms 237988 KB Output is correct
7 Correct 127 ms 82028 KB Output is correct
8 Correct 131 ms 83820 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 846 ms 16544 KB Output is correct
2 Correct 2995 ms 975292 KB Output is correct
3 Correct 2261 ms 976020 KB Output is correct
4 Correct 2455 ms 976492 KB Output is correct
5 Runtime error 1521 ms 1048580 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -