oj.uz

Submission #965198

# Submission time Handle Problem Language Result Execution time Memory
965198 2024-04-18T08:12:56 Z vjudge1 Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 3000 ms 107024 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=1e13;  
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;

const int L=3;

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[L];

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

struct segtree{
  int t[4*MAX];

  int p[MAX];

  void build(int v,int tl,int tr){
    t[v]=inf;
    if(tl==tr){
      p[tl]=v;
      return;
    }
    int tm=(tl+tr)/2;
    build(2*v,tl,tm);
    build(2*v+1,tm+1,tr);
  }

  void update(int pos,int x){
    int v=p[pos];
    t[v]=x;  
    
    v/=2;   

    while(v){

      t[v]=min(t[2*v],t[2*v+1]);

      v/=2;  
    }
  }
}t;

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)}]=R;
      }

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

    }
  }

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

  for(int r=2;r<=n;r++){
    t.build(1,1,r);
    vector<int> upd[r];
    vector<int> cnt(r,0),cost(r,0);
    // multiset<int> st;
    for(int l=r-1;l>=1;l--){
      cost[r-l]=dp[l+1][r]+c-a*(r-l);
      
      t.update(r-l,cost[r-l]);

      if(last[l+1][r]-(r-l)+1>0)upd[last[l+1][r]-(r-l)+1].pb(r-l);
      
      for(int zs:upd[l]){
        
        cost[zs]+=(c-a*zs);
        
        t.update(zs,cost[zs]);
        
        if(last[l][l+zs-1]-zs+1>0)upd[last[l][l+zs-1]-zs+1].pb(zs);
      }

      // cout<<t.t[1]<<" "<<*st.begin()<<"\n";

      dp[l][r]=min(dp[l][r-1]+a,t.t[1]+(r-l+1)*a+b);
    }
  }

  // for(int zs=1;zs<=n;zs++){
  //   for(int l=1;l+zs-1<=n;l++){
  //     cout<<dp[l][l+zs-1]<<" ";
  //   }
  //   cout<<"\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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 476 KB Output is correct
3 Correct 742 ms 35200 KB Output is correct
4 Correct 902 ms 39616 KB Output is correct
5 Correct 1093 ms 45148 KB Output is correct
6 Correct 1256 ms 50520 KB Output is correct
7 Correct 1543 ms 56924 KB Output is correct
8 Correct 1470 ms 56900 KB Output is correct
9 Correct 1618 ms 56836 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 344 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 472 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 472 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 2 ms 1116 KB Output is correct
41 Correct 6 ms 2396 KB Output is correct
42 Correct 7 ms 2776 KB Output is correct
43 Correct 6 ms 2908 KB Output is correct
44 Correct 6 ms 2908 KB Output is correct
45 Correct 6 ms 2908 KB Output is correct
46 Correct 6 ms 2652 KB Output is correct
47 Correct 6 ms 2396 KB Output is correct
48 Correct 7 ms 2652 KB Output is correct
49 Correct 6 ms 2652 KB Output is correct
50 Correct 7 ms 2652 KB Output is correct
51 Correct 6 ms 2396 KB Output is correct
52 Correct 9 ms 2636 KB Output is correct
53 Correct 6 ms 2652 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 472 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 2 ms 1116 KB Output is correct
41 Correct 6 ms 2396 KB Output is correct
42 Correct 7 ms 2776 KB Output is correct
43 Correct 6 ms 2908 KB Output is correct
44 Correct 6 ms 2908 KB Output is correct
45 Correct 6 ms 2908 KB Output is correct
46 Correct 6 ms 2652 KB Output is correct
47 Correct 6 ms 2396 KB Output is correct
48 Correct 7 ms 2652 KB Output is correct
49 Correct 6 ms 2652 KB Output is correct
50 Correct 7 ms 2652 KB Output is correct
51 Correct 6 ms 2396 KB Output is correct
52 Correct 9 ms 2636 KB Output is correct
53 Correct 6 ms 2652 KB Output is correct
54 Correct 46 ms 7920 KB Output is correct
55 Correct 208 ms 14448 KB Output is correct
56 Correct 328 ms 27792 KB Output is correct
57 Correct 308 ms 27820 KB Output is correct
58 Correct 318 ms 28020 KB Output is correct
59 Correct 278 ms 27936 KB Output is correct
60 Correct 282 ms 27960 KB Output is correct
61 Correct 203 ms 20552 KB Output is correct
62 Correct 183 ms 14512 KB Output is correct
63 Correct 227 ms 22756 KB Output is correct
64 Correct 227 ms 22488 KB Output is correct
65 Correct 251 ms 19640 KB Output is correct
66 Correct 244 ms 19692 KB Output is correct
67 Correct 297 ms 27984 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 476 KB Output is correct
13 Correct 742 ms 35200 KB Output is correct
14 Correct 902 ms 39616 KB Output is correct
15 Correct 1093 ms 45148 KB Output is correct
16 Correct 1256 ms 50520 KB Output is correct
17 Correct 1543 ms 56924 KB Output is correct
18 Correct 1470 ms 56900 KB Output is correct
19 Correct 1618 ms 56836 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 856 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 468 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 472 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 856 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 2 ms 1116 KB Output is correct
58 Correct 6 ms 2396 KB Output is correct
59 Correct 7 ms 2776 KB Output is correct
60 Correct 6 ms 2908 KB Output is correct
61 Correct 6 ms 2908 KB Output is correct
62 Correct 6 ms 2908 KB Output is correct
63 Correct 6 ms 2652 KB Output is correct
64 Correct 6 ms 2396 KB Output is correct
65 Correct 7 ms 2652 KB Output is correct
66 Correct 6 ms 2652 KB Output is correct
67 Correct 7 ms 2652 KB Output is correct
68 Correct 6 ms 2396 KB Output is correct
69 Correct 9 ms 2636 KB Output is correct
70 Correct 6 ms 2652 KB Output is correct
71 Correct 46 ms 7920 KB Output is correct
72 Correct 208 ms 14448 KB Output is correct
73 Correct 328 ms 27792 KB Output is correct
74 Correct 308 ms 27820 KB Output is correct
75 Correct 318 ms 28020 KB Output is correct
76 Correct 278 ms 27936 KB Output is correct
77 Correct 282 ms 27960 KB Output is correct
78 Correct 203 ms 20552 KB Output is correct
79 Correct 183 ms 14512 KB Output is correct
80 Correct 227 ms 22756 KB Output is correct
81 Correct 227 ms 22488 KB Output is correct
82 Correct 251 ms 19640 KB Output is correct
83 Correct 244 ms 19692 KB Output is correct
84 Correct 297 ms 27984 KB Output is correct
85 Correct 1243 ms 61420 KB Output is correct
86 Execution timed out 3061 ms 107024 KB Time limit exceeded
87 Halted 0 ms 0 KB -