oj.uz

Submission #965104

# Submission time Handle Problem Language Result Execution time Memory
965104 2024-04-18T06:48:44 Z vjudge1 Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 70620 KB 
#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();
}

Compilation message

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.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2520 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1939 ms 59692 KB Output is correct
4 Correct 2393 ms 63824 KB Output is correct
5 Correct 2678 ms 70620 KB Output is correct
6 Execution timed out 3054 ms 70064 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2520 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 2520 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4440 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2520 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 2520 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4440 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 2 ms 4568 KB Output is correct
41 Correct 14 ms 8796 KB Output is correct
42 Correct 10 ms 9492 KB Output is correct
43 Correct 12 ms 9448 KB Output is correct
44 Correct 8 ms 9308 KB Output is correct
45 Correct 8 ms 9308 KB Output is correct
46 Correct 7 ms 9308 KB Output is correct
47 Correct 12 ms 8792 KB Output is correct
48 Correct 11 ms 9052 KB Output is correct
49 Correct 11 ms 9268 KB Output is correct
50 Correct 9 ms 9052 KB Output is correct
51 Correct 11 ms 9088 KB Output is correct
52 Correct 12 ms 8924 KB Output is correct
53 Correct 9 ms 9308 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2520 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 2520 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4440 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 2 ms 4568 KB Output is correct
41 Correct 14 ms 8796 KB Output is correct
42 Correct 10 ms 9492 KB Output is correct
43 Correct 12 ms 9448 KB Output is correct
44 Correct 8 ms 9308 KB Output is correct
45 Correct 8 ms 9308 KB Output is correct
46 Correct 7 ms 9308 KB Output is correct
47 Correct 12 ms 8792 KB Output is correct
48 Correct 11 ms 9052 KB Output is correct
49 Correct 11 ms 9268 KB Output is correct
50 Correct 9 ms 9052 KB Output is correct
51 Correct 11 ms 9088 KB Output is correct
52 Correct 12 ms 8924 KB Output is correct
53 Correct 9 ms 9308 KB Output is correct
54 Correct 60 ms 24660 KB Output is correct
55 Correct 562 ms 41976 KB Output is correct
56 Correct 396 ms 60632 KB Output is correct
57 Correct 423 ms 60692 KB Output is correct
58 Correct 350 ms 61012 KB Output is correct
59 Correct 434 ms 60948 KB Output is correct
60 Correct 332 ms 61140 KB Output is correct
61 Correct 255 ms 50000 KB Output is correct
62 Correct 487 ms 41944 KB Output is correct
63 Correct 289 ms 53528 KB Output is correct
64 Correct 313 ms 53092 KB Output is correct
65 Correct 444 ms 48268 KB Output is correct
66 Correct 432 ms 48388 KB Output is correct
67 Correct 388 ms 61036 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2520 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1939 ms 59692 KB Output is correct
14 Correct 2393 ms 63824 KB Output is correct
15 Correct 2678 ms 70620 KB Output is correct
16 Execution timed out 3054 ms 70064 KB Time limit exceeded
17 Halted 0 ms 0 KB -