oj.uz

Submission #854111

# Submission time Handle Problem Language Result Execution time Memory
854111 2023-09-26T07:25:07 Z denniskim Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 190564 KB 
#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], je2[2510];
ll num[2510][2510];
ll nu[2510];
ll nu2[2510];
ll hs = 79, hs2 = 31;
ll ss = 1000000007;
ll L[6300010], R[6300010];
ll GO[6300010];
map<pll, 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 f2(ll L, ll R)
{
	ll ret = (nu2[R] - nu2[L - 1]) % ss * sqrmtp(je2[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) && f2(L1, R1) == f2(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;
	je2[0] = 1;
	
	for(ll i = 1 ; i <= n ; i++)
	{
		je[i] = je[i - 1] * hs % ss;
		je2[i] = je2[i - 1] * hs2 % ss;
	}
	
	for(ll i = 1 ; i <= n ; i++)
	{
		nu[i] = (nu[i - 1] + je[i] * (s[i] - 'a' + 1) % ss) % ss;
		nu2[i] = (nu2[i - 1] + je2[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), f2(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.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1600 ms 122272 KB Output is correct
4 Correct 1864 ms 137216 KB Output is correct
5 Correct 2274 ms 152816 KB Output is correct
6 Correct 2642 ms 177328 KB Output is correct
7 Execution timed out 3024 ms 190564 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6744 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6772 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6692 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 1 ms 6748 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6744 KB Output is correct
29 Correct 1 ms 6748 KB Output is correct
30 Correct 2 ms 6744 KB Output is correct
31 Correct 2 ms 6748 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6488 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 1 ms 6748 KB Output is correct
40 Correct 5 ms 9308 KB Output is correct
41 Correct 19 ms 14140 KB Output is correct
42 Correct 22 ms 15888 KB Output is correct
43 Correct 22 ms 15964 KB Output is correct
44 Correct 26 ms 16076 KB Output is correct
45 Correct 22 ms 15960 KB Output is correct
46 Correct 22 ms 15964 KB Output is correct
47 Correct 20 ms 14580 KB Output is correct
48 Correct 21 ms 15496 KB Output is correct
49 Correct 22 ms 15412 KB Output is correct
50 Correct 21 ms 15452 KB Output is correct
51 Correct 21 ms 15000 KB Output is correct
52 Correct 22 ms 14932 KB Output is correct
53 Correct 22 ms 15956 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6744 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6772 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6692 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 2 ms 6748 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 1 ms 6748 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6744 KB Output is correct
29 Correct 1 ms 6748 KB Output is correct
30 Correct 2 ms 6744 KB Output is correct
31 Correct 2 ms 6748 KB Output is correct
32 Correct 2 ms 6748 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6488 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 1 ms 6748 KB Output is correct
40 Correct 5 ms 9308 KB Output is correct
41 Correct 19 ms 14140 KB Output is correct
42 Correct 22 ms 15888 KB Output is correct
43 Correct 22 ms 15964 KB Output is correct
44 Correct 26 ms 16076 KB Output is correct
45 Correct 22 ms 15960 KB Output is correct
46 Correct 22 ms 15964 KB Output is correct
47 Correct 20 ms 14580 KB Output is correct
48 Correct 21 ms 15496 KB Output is correct
49 Correct 22 ms 15412 KB Output is correct
50 Correct 21 ms 15452 KB Output is correct
51 Correct 21 ms 15000 KB Output is correct
52 Correct 22 ms 14932 KB Output is correct
53 Correct 22 ms 15956 KB Output is correct
54 Correct 119 ms 32344 KB Output is correct
55 Correct 456 ms 48924 KB Output is correct
56 Correct 806 ms 97408 KB Output is correct
57 Correct 838 ms 97832 KB Output is correct
58 Correct 825 ms 97832 KB Output is correct
59 Correct 849 ms 98004 KB Output is correct
60 Correct 842 ms 98132 KB Output is correct
61 Correct 647 ms 71248 KB Output is correct
62 Correct 452 ms 50060 KB Output is correct
63 Correct 787 ms 84932 KB Output is correct
64 Correct 756 ms 85748 KB Output is correct
65 Correct 682 ms 72588 KB Output is correct
66 Correct 666 ms 72380 KB Output is correct
67 Correct 845 ms 98032 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1600 ms 122272 KB Output is correct
14 Correct 1864 ms 137216 KB Output is correct
15 Correct 2274 ms 152816 KB Output is correct
16 Correct 2642 ms 177328 KB Output is correct
17 Execution timed out 3024 ms 190564 KB Time limit exceeded
18 Halted 0 ms 0 KB -