제출 #965104

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965104		vjudge1	Copy and Paste 3 (JOI22_copypaste3)	C++17	57 / 100	3054 ms	70620 KiB

copypaste3

#include <bits/stdc++.h>

#pragma optimize("Ofast")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll
#define ull unsigned ll

const int MAX=2500+15;
const int B=331;
const int maxB=1000;
const int N=104;
const int block=450;
const int inf=1e9;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;

int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1)%mod;
  int k=binpow(a,n/2);
  return k*k%mod;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,a,b,c;
string s;

struct hash{
  int mod,C;
  int h[MAX],p[MAX];

  void init(int module,int constant,string s){
    mod=module;
    C=constant;
    p[0]=1;
    for(int i=1;i<sz(s);i++){
      h[i]=(h[i-1]*C+s[i])%mod;
      p[i]=p[i-1]*C%mod;
    }
  }

  int get(int l,int r){
    return (h[r]-h[l-1]*p[r-l+1]%mod+mod)%mod;
  }

}H[3];

bool isEqual(int l,int r,int L,int R){
  for(int i=0;i<3;i++){
    if(H[i].get(l,r)!=H[i].get(L,R))return 0;
  }
  return 1;
}

int dp[MAX][MAX];
int last[MAX][MAX];
map<pair<pii,int>,int> was;

void solve(){
  cin>>n>>s; 
  cin>>a>>b>>c;
  s="#"+s;
  H[0].init(1e9+7,331,s);
  H[1].init(1e9+9,331,s);
  H[2].init(998244353,331,s);

  for(int zs=1;zs<=n;zs++){
    for(int r=zs;r<=n;r++){
      int R=r-zs;
      int L=R-zs+1;
      if(1<=L){
        was[{{H[0].get(L,R),H[1].get(L,R)},H[2].get(L,R)}]=R;
      }

      int l=r-zs+1;
      if(was.count({{H[0].get(l,r),H[1].get(l,r)},H[2].get(l,r)})){
        last[l][r]=was[{{H[0].get(l,r),H[1].get(l,r)},H[2].get(l,r)}];
      }

    }
  }

  for(int i=1;i<=n;i++)dp[i][i]=a;

  for(int r=2;r<=n;r++){
    vector<int> upd[r];
    vector<int> cnt(r,0),cost(r,0);
    multiset<int> st;
    for(int l=r-1;l>=1;l--){
      cnt[r-l]=1;
      cost[r-l]=dp[l+1][r]+b+cnt[r-l]*c-a*(r-l)*cnt[r-l];
      // cout<<l<<" "<<r<<" "<<dp[l+1][r]<<" "<<b<<" "<<cnt[r-l]*c<<" "<<a*(r-l+1-(r-l)*cnt[r-l])<<"\n";
      st.in(cost[r-l]);
      if(last[l+1][r]-(r-l)+1>0)upd[last[l+1][r]-(r-l)+1].pb(r-l);
      // cout<<l+1<<" "<<r<<" "<<last[l+1][r]<<"\n";
      for(int zs:upd[l]){
        cnt[zs]++;
        st.erase(st.find(cost[zs]));
        cost[zs]=dp[r-zs+1][r]+b+cnt[zs]*c-a*zs*cnt[zs];
        // cout<<r<<" "<<dp[r-zs+1][r]<<" "<<b<<" "<<cnt[zs]*c<<" "<<a*(r-l+1-zs*cnt[zs])<<"\n";
        st.in(cost[zs]);
        if(last[l][l+zs-1]-zs+1>0)upd[last[l][l+zs-1]-zs+1].pb(zs);
      }
      dp[l][r]=min(dp[l][r-1]+a,*st.begin()+(r-l+1)*a);
      // cout<<l<<" "<<r<<" "<<dp[l][r]<<" "<<*st.begin()+(r-l+1)*a<<"\n";
    }
  }

  cout<<dp[1][n]<<"\n";

}

signed main(){
  // freopen("triangles.in","r",stdin);
  // freopen("triangles.out","w",stdout);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--)solve();
}

컴파일 시 표준 에러 (stderr) 메시지

copypaste3.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
copypaste3.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

• Subtask 1: 1 / 1
• Subtask 2: 0 / 5
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 32 / 32
• Subtask 6: 0 / 38