Submission #856647

#	Time	Username	Problem	Language	Result	Execution time	Memory
856647		8pete8	Collecting Stamps 3 (JOI20_ho_t3)	C++14	100 / 100	124 ms	172376 KiB

ho_t3

#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
//#include "combo.h"
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
const int inf=1e18,mxn=222;
int dp[mxn][mxn][mxn][2],n,m;
int memo[mxn][mxn];
//at l r taken ,min time
vector<pii>v(mxn);
int caldist(int a,int b){
    //dist u->v;
    if(a>b)swap(a,b);
    int t1=a,t2=b;
    a=v[a].f,b=v[b].f;
    if(memo[t1][t2]!=-1)return memo[t1][t2];
    return memo[t1][t2]=min((b-a),m-b+a);
}
int32_t main(){
    cin>>n>>m;
    n++;
    v[0].f=0,v[0].s=0;
    for(int i=1;i<n;i++)cin>>v[i].f;
    for(int i=1;i<n;i++)cin>>v[i].s;
    for(int i=0;i<mxn;i++)for(int j=0;j<mxn;j++){
        memo[i][j]=-1;
        for(int k=0;k<mxn;k++)dp[i][j][k][0]=dp[i][j][k][1]=inf;
    }
    dp[0][0][0][0]=dp[0][0][0][1]=0;
    for(int sz=0;sz<n-1;sz++){
        int l,r=0,nr,nl;
        l=(n-sz)%n;
        bool yes=true;
        while(yes){
            if(l==0)yes=false;
            nr=(r+1)%n;
            nl=(l-1+n)%n;
            for(int t=0;t<=n;t++){
                if(dp[l][r][t][0]+caldist(nr,l)<=v[nr].s)dp[l][nr][t+1][1]=min(dp[l][nr][t+1][1],dp[l][r][t][0]+caldist(nr,l));
                else dp[l][nr][t][1]=min(dp[l][nr][t][1],dp[l][r][t][0]+caldist(nr,l));//l to nr
                if(dp[l][r][t][0]+caldist(l,nl)<=v[nl].s)dp[nl][r][t+1][0]=min(dp[nl][r][t+1][0],dp[l][r][t][0]+caldist(l,nl));
                else dp[nl][r][t][0]=min(dp[nl][r][t][0],dp[l][r][t][0]+caldist(l,nl));
                if(dp[l][r][t][1]+caldist(r,nl)<=v[nl].s)dp[nl][r][t+1][0]=min(dp[nl][r][t+1][0],dp[l][r][t][1]+caldist(r,nl));
                else dp[nl][r][t][0]=min(dp[nl][r][t][0],dp[l][r][t][1]+caldist(r,nl));
                if(dp[l][r][t][1]+caldist(nr,r)<=v[nr].s)dp[l][nr][t+1][1]=min(dp[l][nr][t+1][1],dp[l][r][t][1]+caldist(nr,r));
                else dp[l][nr][t][1]=min(dp[l][nr][t][1],dp[l][r][t][1]+caldist(nr,r));
            }
            r=nr;
            l=(l+1)%n;
        }
    }
    int ans=0;
    for(int i=0;i<mxn;i++)for(int j=0;j<mxn;j++)for(int k=0;k<mxn;k++)for(int g=0;g<2;g++)if(dp[i][j][k][g]<inf)ans=max(ans,k);
    cout<<ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 75 / 75