Submission #72757575

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vvvl=vector<vector<vector<long long>>>;
using pl=pair<long long,long long>;
using vpl=vector<pair<long long,long long>>;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(long long i=(long long)(a);i<(long long)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#include <atcoder/all>
using namespace atcoder;

long long modpow(long long a, long long n, long long mo){long long res=1;while(n>0){if(n&1){res=res*a%mo;}a=a*a%mo;n>>=1;}return res;}
long long Pow(long long a, long long n){long long res=1;while(n>0){if(n&1){res=res*a;}a=a*a;n>>=1;}return res;}

const ll MOD=998244353;
const ll INF=(1ll<<60);
ll N,L;
ll ten(vl P1,vl P2){
  ll ans=0;
  vl Q2(L);
  rep(i,L) Q2[P2[i]]=i;
  vl R(L);
  rep(i,L) R[Q2[P1[i]]]=i;
  rep(i,L)rep(j,i+1,L){
    if(R[i]>R[j]) ans++;
  }
  return ans;
}
int main(){
  cin>>N>>L;
  vl C(N);
  vvl P(N+1,vl(L));
  rep(i,L) P[0][i]=i;
  rep(i,N){
    cin>>C[i];
    rep(j,L){
    cin>>P[i+1][j];
    P[i+1][j]--;
    }
  }
  vl dp(N+1,-INF);
  dp[0]=0;
  ll mat=L*(L-1)/2;
  ll nowma=-INF;
  mat=max(mat,2ll);
  rep(i,1,N+1){
    rep(j,max(0ll,i-mat),i){
      if(ten(P[j],P[i])<=i-j){
        dp[i]=max(dp[i],dp[j]+C[i-1]);
      }
    }
    if(i-mat-1>=0) nowma=max(nowma,dp[i-mat-1]);
    dp[i]=max(dp[i],nowma+C[i-1]);
  }
  ll ans=0;
  rep(i,N+1) ans=max(ans,dp[i]);
  cout<<ans<<endl;
}

Submission Info

Judge Result