제출 #854106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
854106		denniskim	Copy and Paste 3 (JOI22_copypaste3)	C++17	30 / 100	2060 ms	193640 KiB

copypaste3

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

ll n;
char s[2510];
ll A, B, C;
ll dp[2510][2510];
ll je[2510];
ll num[2510][2510];
ll nu[2510];
ll hs = 31;
ll ss = 1000000007;
ll L[6300010], R[6300010];
ll GO[6300010];
map<ll, vector<ll> > mp;
ll cc;
ll minn[2510];
ll gaet[2510];
vector<ll> vv[2510];

ll sqrmtp(ll X, ll Y)
{
	ll ret = 1;
	
	while(Y)
	{
		if(Y & 1)
			ret = ret * X % ss;
		
		X = X * X % ss;
		Y >>= 1;
	}
	
	return ret;
}

ll f(ll L, ll R)
{
	ll ret = (nu[R] - nu[L - 1]) % ss * sqrmtp(je[L], ss - 2) % ss;
	return (ret % ss + ss) % ss;
}

ll comp(ll L1, ll R1, ll L2, ll R2)
{
	return f(L1, R1) == f(L2, R2);
}

int main(void)
{
	fastio
	
	cin >> n;
	
	for(ll i = 1 ; i <= n ; i++)
		cin >> s[i];
	
	cin >> A;
	cin >> B;
	cin >> C;
	
	je[0] = 1;
	
	for(ll i = 1 ; i <= n ; i++)
		je[i] = je[i - 1] * hs % ss;
	
	for(ll i = 1 ; i <= n ; i++)
		nu[i] = (nu[i - 1] + je[i] * (s[i] - 'a' + 1) % ss) % ss;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		for(ll j = i ; j <= n ; j++)
		{
			num[i][j] = ++cc;
			mp[f(i, j)].push_back(cc);
			L[cc] = i, R[cc] = j;
		}
	}
	
	for(auto &i : mp)
	{
		vector<ll> tmp = i.se;
		ll siz = (ll)tmp.size();
		
		for(ll j = 1 ; j < siz ; j++)
		{
			ll l = 0, r = j - 1;
			
			while(l <= r)
			{
				ll mid = (l + r) >> 1;
				
				if(R[tmp[mid]] < L[tmp[j]])
					l = mid + 1;
				else
					r = mid - 1;
			}
			
			if(r == -1)
				continue;
			
			GO[tmp[j]] = tmp[r];
		}
	}
	
	for(ll i = 1 ; i <= n ; i++)
	{
		for(ll j = 1 ; j <= n + 1 ; j++)
		{
			minn[j] = INF;
			vv[j].clear();
			gaet[j] = 0;
		}
		
		ll minn = INF;
		
		for(ll j = i ; j >= 1 ; j--)
		{
			ll X = num[j][i];
			
			while(X)
			{
				vv[L[X]].push_back(j);
				X = GO[X];
			}
		}
		
		for(ll j = i ; j >= 1 ; j--)
		{
			dp[j][i] = (i - j + 1) * A;
			dp[j][i] = min(dp[j][i], dp[j][i - 1] + A);
			
			for(auto &k : vv[j])
			{
				gaet[k]++;
				minn = min(minn, B + dp[k][i] + gaet[k] * (C - A * (i - k + 1)));
			}
			
			dp[j][i] = min(dp[j][i], minn + A * (i - j + 1));
		}
	}
	
	cout << dp[1][n];
	return 0;
}

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