oj.uz

Submission #548248

# Submission time Handle Problem Language Result Execution time Memory
548248 2022-04-12T19:15:28 Z inksamurai Copy and Paste 3 (JOI22_copypaste3) C++17
100 / 100
 613 ms 123516 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3rfKJyA ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
 
//snuke's mod int
template <ll mod>
struct modint{
	ll x; // typedef long long ll;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint operator+(const modint a)const{modint res(*this); return res+=a;}
	modint operator-(const modint a)const{modint res(*this); return res-=a;}
	modint operator*(const modint a)const{modint res(*this); return res*=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
};
 
// include mint here
using hshmint=modint<1000000007>;
using hshmint1=modint<998244353>;
using magicpair=pair<hshmint,hshmint1>;
hshmint _p=9973; // base
hshmint1 _p1=257; // base1
hshmint pw[3011],invpw[3011];
hshmint1 pw1[3011],invpw1[3011];
magicpair hsh[3011];
 
struct rollhsh{		
	rollhsh(string s=""){
		init(s);
	}
	void init(string s){
		// put this out in global if multiple testcases
		hsh[0]={1,1};
		pw[0]=1;
		pw1[0]=1;
		invpw[0]=1;
		invpw1[0]=1;		
		hshmint _invbase=_p.x;
		hshmint1 _invbase1=_p1.x;
		_invbase=_invbase.inv(); _invbase1=_invbase1.inv();
		rep(i,sz(s)){
			pw[i+1]=pw[i]*_p;
			pw1[i+1]=pw1[i]*_p1;
			invpw[i+1]=invpw[i]*_invbase;
			invpw1[i+1]=invpw1[i]*_invbase1;
			hshmint x=(int)(s[i]-'a'+1);
			hshmint1 x1=(int)(s[i]-'a'+1);
			hsh[i+1]={hsh[i].fi+pw[i]*x,hsh[i].se+pw1[i]*x1};
		}
	}
	pair<ll,ll> get(int l,int r){ 
		// from - to , inclusive
		hshmint _f=invpw[l]*(hsh[r+1].fi-hsh[l].fi);
		hshmint1 _s=invpw1[l]*(hsh[r+1].se-hsh[l].se);
		return {_f.x,_s.x};	
	}
};

ll f[3011][3011],g[3011][3011];

int nxt[3011][3011];

signed main(){
_3rfKJyA;
	int n;
	cin>>n;
	
	string s;
	cin>>s;
	
	ll c0,c1,c2;
	cin>>c0>>c1>>c2;
 
	rep(i,n){
		rep(j,n){
			nxt[i][j]=-1;
		}
	}
 
	using pll=pair<ll,ll>;
	rollhsh nahsh(s);
	std::map<pll,int> mp;
	for(int len=1;len<=n;len++){
		mp.clear();
		for(int i=n-1;i>=0;i--){
			if(i-len+1>=0){
				pll p=nahsh.get(i-len+1,i);
				if(mp.find(p)!=mp.end()){
					nxt[i-len+1][i]=mp[p];
				}
			}else{
				break;
			}
			if(i+len-1<n){
				pll p=nahsh.get(i,i+len-1);
				mp[p]=i;
			}
		}
	}
 
 	rep(i,n+1)rep(j,n+1){
 		f[i][j]=8e18;
 	}

	for(int len=1;len<=n;len++){
		for(int i=0;i<n;i++){
			if(i+len-1>=n){
				break;
			}
			int j=i+len-1;
			if(len>1){
				g[i][j]=min({g[i][j],g[i+1][j],g[i][j-1]});
			}

			f[i][j]=min(f[i][j],1ll*len*c0+g[i][j]);
 
			ll cnt=1;
			int nj=i;
			while(1){
				g[i][nj+len-1]=min(g[i][nj+len-1],-1ll*len*c0*cnt+1ll*cnt*c2+f[i][i+len-1]+c1);
				nj=nxt[nj][nj+len-1];
				if(nj==-1) break;
				cnt+=1;
			}
		}
	}
	print(f[0][n-1]);
//	
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 472 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 265 ms 74804 KB Output is correct
4 Correct 324 ms 85444 KB Output is correct
5 Correct 392 ms 96516 KB Output is correct
6 Correct 475 ms 109056 KB Output is correct
7 Correct 583 ms 123360 KB Output is correct
8 Correct 613 ms 123340 KB Output is correct
9 Correct 591 ms 123356 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 0 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 472 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 596 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 852 KB Output is correct
25 Correct 1 ms 852 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 852 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 1 ms 852 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 852 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 476 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 1620 KB Output is correct
41 Correct 3 ms 3412 KB Output is correct
42 Correct 4 ms 3540 KB Output is correct
43 Correct 4 ms 3540 KB Output is correct
44 Correct 4 ms 3540 KB Output is correct
45 Correct 4 ms 3412 KB Output is correct
46 Correct 4 ms 3540 KB Output is correct
47 Correct 3 ms 3412 KB Output is correct
48 Correct 3 ms 3412 KB Output is correct
49 Correct 3 ms 3540 KB Output is correct
50 Correct 4 ms 3540 KB Output is correct
51 Correct 3 ms 3412 KB Output is correct
52 Correct 3 ms 3540 KB Output is correct
53 Correct 3 ms 3492 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 472 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 0 ms 596 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 1 ms 852 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 1 ms 852 KB Output is correct
25 Correct 1 ms 852 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 852 KB Output is correct
28 Correct 1 ms 852 KB Output is correct
29 Correct 1 ms 852 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 852 KB Output is correct
32 Correct 1 ms 852 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 476 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 1620 KB Output is correct
41 Correct 3 ms 3412 KB Output is correct
42 Correct 4 ms 3540 KB Output is correct
43 Correct 4 ms 3540 KB Output is correct
44 Correct 4 ms 3540 KB Output is correct
45 Correct 4 ms 3412 KB Output is correct
46 Correct 4 ms 3540 KB Output is correct
47 Correct 3 ms 3412 KB Output is correct
48 Correct 3 ms 3412 KB Output is correct
49 Correct 3 ms 3540 KB Output is correct
50 Correct 4 ms 3540 KB Output is correct
51 Correct 3 ms 3412 KB Output is correct
52 Correct 3 ms 3540 KB Output is correct
53 Correct 3 ms 3492 KB Output is correct
54 Correct 14 ms 9044 KB Output is correct
55 Correct 59 ms 28204 KB Output is correct
56 Correct 82 ms 28172 KB Output is correct
57 Correct 74 ms 28160 KB Output is correct
58 Correct 80 ms 28160 KB Output is correct
59 Correct 71 ms 28156 KB Output is correct
60 Correct 73 ms 28220 KB Output is correct
61 Correct 71 ms 28116 KB Output is correct
62 Correct 54 ms 28116 KB Output is correct
63 Correct 73 ms 28236 KB Output is correct
64 Correct 74 ms 28120 KB Output is correct
65 Correct 72 ms 28104 KB Output is correct
66 Correct 70 ms 28104 KB Output is correct
67 Correct 76 ms 28156 KB Output is correct

Subtask #6
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 472 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 265 ms 74804 KB Output is correct
14 Correct 324 ms 85444 KB Output is correct
15 Correct 392 ms 96516 KB Output is correct
16 Correct 475 ms 109056 KB Output is correct
17 Correct 583 ms 123360 KB Output is correct
18 Correct 613 ms 123340 KB Output is correct
19 Correct 591 ms 123356 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 0 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 852 KB Output is correct
27 Correct 0 ms 468 KB Output is correct
28 Correct 1 ms 596 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 0 ms 468 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 596 KB Output is correct
37 Correct 0 ms 468 KB Output is correct
38 Correct 1 ms 852 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 1 ms 852 KB Output is correct
42 Correct 1 ms 852 KB Output is correct
43 Correct 1 ms 724 KB Output is correct
44 Correct 1 ms 852 KB Output is correct
45 Correct 1 ms 852 KB Output is correct
46 Correct 1 ms 852 KB Output is correct
47 Correct 1 ms 724 KB Output is correct
48 Correct 1 ms 852 KB Output is correct
49 Correct 1 ms 852 KB Output is correct
50 Correct 1 ms 852 KB Output is correct
51 Correct 1 ms 476 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 0 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 1 ms 724 KB Output is correct
57 Correct 1 ms 1620 KB Output is correct
58 Correct 3 ms 3412 KB Output is correct
59 Correct 4 ms 3540 KB Output is correct
60 Correct 4 ms 3540 KB Output is correct
61 Correct 4 ms 3540 KB Output is correct
62 Correct 4 ms 3412 KB Output is correct
63 Correct 4 ms 3540 KB Output is correct
64 Correct 3 ms 3412 KB Output is correct
65 Correct 3 ms 3412 KB Output is correct
66 Correct 3 ms 3540 KB Output is correct
67 Correct 4 ms 3540 KB Output is correct
68 Correct 3 ms 3412 KB Output is correct
69 Correct 3 ms 3540 KB Output is correct
70 Correct 3 ms 3492 KB Output is correct
71 Correct 14 ms 9044 KB Output is correct
72 Correct 59 ms 28204 KB Output is correct
73 Correct 82 ms 28172 KB Output is correct
74 Correct 74 ms 28160 KB Output is correct
75 Correct 80 ms 28160 KB Output is correct
76 Correct 71 ms 28156 KB Output is correct
77 Correct 73 ms 28220 KB Output is correct
78 Correct 71 ms 28116 KB Output is correct
79 Correct 54 ms 28116 KB Output is correct
80 Correct 73 ms 28236 KB Output is correct
81 Correct 74 ms 28120 KB Output is correct
82 Correct 72 ms 28104 KB Output is correct
83 Correct 70 ms 28104 KB Output is correct
84 Correct 76 ms 28156 KB Output is correct
85 Correct 201 ms 58640 KB Output is correct
86 Correct 534 ms 123504 KB Output is correct
87 Correct 507 ms 123484 KB Output is correct
88 Correct 492 ms 123452 KB Output is correct
89 Correct 487 ms 123508 KB Output is correct
90 Correct 479 ms 123516 KB Output is correct
91 Correct 406 ms 123364 KB Output is correct
92 Correct 478 ms 123356 KB Output is correct
93 Correct 506 ms 123404 KB Output is correct
94 Correct 502 ms 123380 KB Output is correct
95 Correct 594 ms 123400 KB Output is correct
96 Correct 584 ms 123492 KB Output is correct
97 Correct 479 ms 123468 KB Output is correct