oj.uz

답안 #854127

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854127 2023-09-26T07:49:29 Z denniskim Copy and Paste 3 (JOI22_copypaste3) C++17
57 / 100
 3000 ms 211584 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];
vector< pair<pll, ll> > sad;
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;
			sad.push_back({{f(i, j), f2(i, j)}, cc});
			L[cc] = i, R[cc] = j;
		}
	}
	
	vector<ll> tmp;
	
	sort(sad.begin(), sad.end());
	
	tmp.push_back(sad[0].se);
	
	for(ll i = 1 ; i <= (ll)sad.size() ; i++)
	{
		if(i == (ll)sad.size() || sad[i].fi != sad[i - 1].fi)
		{
			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];
			}
			
			tmp.clear();
			
			if(i < (ll)sad.size())
				tmp.push_back(sad[i].se);
		}
		
		else
			tmp.push_back(sad[i].se);
	}
	
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 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 6696 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1817 ms 143764 KB Output is correct
4 Correct 2105 ms 163740 KB Output is correct
5 Correct 2510 ms 183428 KB Output is correct
6 Correct 2956 ms 211584 KB Output is correct
7 Execution timed out 3043 ms 202964 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 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 6696 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 3 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6696 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 6916 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 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 1 ms 6744 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 6944 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 6492 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 2 ms 6944 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 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 6696 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 3 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6696 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 6916 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 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 1 ms 6744 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 6944 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 6492 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 2 ms 6944 KB Output is correct
40 Correct 4 ms 9304 KB Output is correct
41 Correct 21 ms 14292 KB Output is correct
42 Correct 20 ms 14280 KB Output is correct
43 Correct 20 ms 14336 KB Output is correct
44 Correct 20 ms 14288 KB Output is correct
45 Correct 20 ms 14292 KB Output is correct
46 Correct 20 ms 14420 KB Output is correct
47 Correct 20 ms 14292 KB Output is correct
48 Correct 20 ms 14396 KB Output is correct
49 Correct 20 ms 14292 KB Output is correct
50 Correct 21 ms 14352 KB Output is correct
51 Correct 20 ms 14376 KB Output is correct
52 Correct 21 ms 14292 KB Output is correct
53 Correct 20 ms 14284 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 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 6696 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 2 ms 6744 KB Output is correct
12 Correct 3 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 3 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6696 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 6916 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 6748 KB Output is correct
29 Correct 2 ms 6748 KB Output is correct
30 Correct 1 ms 6744 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 6944 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 6492 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 2 ms 6944 KB Output is correct
40 Correct 4 ms 9304 KB Output is correct
41 Correct 21 ms 14292 KB Output is correct
42 Correct 20 ms 14280 KB Output is correct
43 Correct 20 ms 14336 KB Output is correct
44 Correct 20 ms 14288 KB Output is correct
45 Correct 20 ms 14292 KB Output is correct
46 Correct 20 ms 14420 KB Output is correct
47 Correct 20 ms 14292 KB Output is correct
48 Correct 20 ms 14396 KB Output is correct
49 Correct 20 ms 14292 KB Output is correct
50 Correct 21 ms 14352 KB Output is correct
51 Correct 20 ms 14376 KB Output is correct
52 Correct 21 ms 14292 KB Output is correct
53 Correct 20 ms 14284 KB Output is correct
54 Correct 94 ms 24768 KB Output is correct
55 Correct 516 ms 55820 KB Output is correct
56 Correct 461 ms 55176 KB Output is correct
57 Correct 463 ms 55664 KB Output is correct
58 Correct 462 ms 55240 KB Output is correct
59 Correct 458 ms 55468 KB Output is correct
60 Correct 455 ms 55468 KB Output is correct
61 Correct 465 ms 55296 KB Output is correct
62 Correct 505 ms 55496 KB Output is correct
63 Correct 461 ms 55152 KB Output is correct
64 Correct 468 ms 55212 KB Output is correct
65 Correct 490 ms 55264 KB Output is correct
66 Correct 482 ms 55212 KB Output is correct
67 Correct 456 ms 55176 KB Output is correct

Subtask #6
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 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 6696 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 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 1817 ms 143764 KB Output is correct
14 Correct 2105 ms 163740 KB Output is correct
15 Correct 2510 ms 183428 KB Output is correct
16 Correct 2956 ms 211584 KB Output is correct
17 Execution timed out 3043 ms 202964 KB Time limit exceeded
18 Halted 0 ms 0 KB -