Submission #11200749

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n,k,a[5010],b[5010];
vector<int> G[5010];

vector<int> get_dp(vector<int> &v){
    int s=v.size();
    vector<vector<vector<vector<int>>>> dp(s+1,vector<vector<vector<int>>>(s+3,vector<vector<int>>(2,vector<int>(2,-mod))));
    dp[0][0][0][0]=0;
    rep(i,s-1){
        rep(j,s+1){
            rep(flagX,2){
                //cout << flagX << " " << (!flagX) << endl;
                rep(flagY,2){
                    dp[i+1][j+1][1][flagY]=max(dp[i+1][j+1][1][flagY],dp[i][j][flagX][flagY]+v[i+1]);
                    dp[i+1][j+(!flagX)][0][flagY || (i==0)]=max(dp[i+1][j+(!flagX)][0][flagY || (i==0)],dp[i][j][flagX][flagY]+v[i]);
                }
            }
        }
    }
    rep(j,s+1){
        rep(flagX,2){
            rep(flagY,2){
                dp[s][j+(!flagY)][1][flagY]=max(dp[s][j+(!flagY)][1][flagY],dp[s-1][j][flagX][flagY]+v[0]);
                dp[s][j+(!flagX)][0][flagY]=max(dp[s][j+(!flagX)][0][flagY],dp[s-1][j][flagX][flagY]+v[s-1]);
            }
        }
    }
    vector<int> res(s+1);
    rep(j,s+1){
        res[j]=max(max(dp[s][j][0][0],dp[s][j][0][1]),max(dp[s][j][1][0],dp[s][j][1][1]));
        //cout << j << " " << res[j] << endl;
    }
    return res;
}

bool visited[5010];

void solve(){
    cin >> n >> k;
    rep(i,n){
        cin >> a[i];
    }
    rep(i,n){
        cin >> b[i];
    }
    rep(i,n){
        G[a[i]].push_back(b[i]);
        G[b[i]].push_back(a[i]);
    }
    vector<vector<int>> DP(2,vector<int>(n+1,-mod));
    DP[0][0]=0;
    int m=0;
    Rep(i,1,n+1){
        if(visited[i]) continue;
        visited[i]=true;
        int par=i,nex=G[i][0];
        vector<int> v={i};
        while(!visited[nex]){
            //cout << par << " " << nex << endl;
            v.push_back(nex);
            visited[nex]=true;
            for(int t:G[nex]){
                if(t==par) continue;
                par=nex;
                nex=t;
                break;
            }
        }
        // for(int v_:v){
        //     cout << v_ << " ";
        // }
        //cout << "" << endl;
        vector<int> dp=get_dp(v);
        int l=dp.size();
        rep(j,n+1){
            DP[(m+1)%2][j]=-mod;
        }
        rep(j,n+1){
            rep(p,l){
                if(j+p>n) continue;
                DP[(m+1)%2][j+p]=max(DP[(m+1)%2][j+p],DP[m%2][j]+dp[p]);
            }
        }
        m+=1;
    }
    
    // rep(i,m+1){
    //     rep(j,n+1){
    //         cout << i << " " << j << " " << DP[i][j] << endl;
    //     }
    // }
    int ans=0;
    Rep(j,k,n+1){
        ans=max(ans,DP[m%2][j]);
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}

Submission Info

Judge Result