oj.uz

Submission #679728

# Submission time Handle Problem Language Result Execution time Memory
679728 2023-01-09T03:22:16 Z DP_196 Visiting Singapore (NOI20_visitingsingapore) C++14
42 / 100
 134 ms 98280 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) (int)x.size()
#define MASK(i) ((1LL) << (i))
#define all(x) x.begin(), x.end()
#define BIT(x, i) ((x) >> (i) & (1LL))
#define dbg(...) cerr << "#" << __LINE__ << ":[" << #__VA_ARGS__ \
<< "] = [" ,DBG(__VA_ARGS__)

string to_string(const string& s) { return '"' + s + '"'; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
        cerr << to_string(h); if(sizeof...(t)) cerr << ", "; DBG(t...);
}

template <class T>
inline bool maximize(T &a, const T &b) { return (a < b ? (a = b) : 0); }
template <class T>
inline bool minimize(T &a, const T &b) { return (a > b ? (a = b) : 0); }

const int MAXN = 1e5 + 6;
const int INF = 1e9;
const int MOD = 1e9 + 7;

int k, n, m, a, b, v[5005], s[5005], t[5005];
int g[5005][5005], f[105][105], dp[1005][1005][2][2];

void sub1() {
	if (m <= n) return (void) (cout << (v[1] * m));
	cout << v[1] * n + (a + (m - n) * b);
}

void sub2() {
	int res = m * b;

	for (int j = 0; j <= m; j++) g[0][j] = j * b;
	for (int i = 1; i <= n; i++) 
		for (int j = 1; j <= m; j++) {
			g[i][j] = max(g[i - 1][j], g[i][j - 1]) + b;
			if (s[i] == t[j]) maximize(g[i][j], g[i - 1][j - 1] + v[s[i]]);
			maximize(res, g[i][j] + (m - j) * b);
		}
	
	cout << res;
}

void sub6() {	
	int res = a + m * b;
	for (int j = 0; j <= m; j++) f[0][j] = j * b;
	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (s[i] != t[j]) continue;
			f[i][j] = v[s[i]] + (j > 1 ? a + (j - 1) * b : 0);
			for (int x = 1; x < i; x++)
				for (int y = 1; y < j; y++)
					if (s[x] == t[y]) maximize(f[i][j], v[s[i]] + f[x][y] + 
						(j - y >= 2 ? a + (j - y - 1) * b : 0) + (i - x >= 2 ? a + (i - x - 1) * b : 0));
			maximize(res, f[i][j] + (m != j ? a + (m - j) * b : 0));
		}
	}
	
	cout << res;
}     

void sub4() {
	int res = a;
	
	memset(dp, -0x3f, sizeof (dp));
	dp[0][0][0][0] = 0;
 	for (int i = 0; i <= m; i++) {
		dp[0][i][0][1] = a;
		dp[0][i][0][0] = a;
	}
	
	for (int i = 1; i <= n; i++) 
		for (int j = 1; j <= m; j++) { 
			dp[i][j][0][0] = max({dp[i - 1][j][0][0], dp[i][j - 1][0][0], dp[i - 1][j - 1][1][1]});
			dp[i][j][0][1] = max(dp[i - 1][j][0][1], dp[i - 1][j][1][1]);
			dp[i][j][1][0] = max(dp[i][j - 1][1][0], dp[i][j - 1][1][1]);
			
			if (s[i] == t[j]) {
				dp[i][j][1][1] = v[s[i]] + (j > 1 ? a : 0);
				maximize(dp[i][j][1][1], dp[i - 1][j - 1][0][0] + 2 * a + v[s[i]]);
				maximize(dp[i][j][1][1], dp[i - 1][j - 1][0][1] + a + v[s[i]]);
				maximize(dp[i][j][1][1], dp[i - 1][j - 1][1][0] + a + v[s[i]]);
				maximize(dp[i][j][1][1], dp[i - 1][j - 1][1][1] + v[s[i]]);
			}
			
			maximize(res, dp[i][j][1][1] + (m - j >= 1 ? a : 0));
		}
	
	cout << res;
}                     

void solve() {
	cin >> k >> n >> m >> a >> b;
	
	for (int i = 1; i <= k; i++) cin >> v[i];
	for (int i = 1; i <= n; i++) cin >> s[i];
	for (int i = 1; i <= m; i++) cin >> t[i];
	
	if (k == 1) sub1();
	else if (a == 0) sub2();
	else if (b == 0) sub4();
	else if (n <= 100 && m <= 100) sub6();
}

#define TASK "FUNTOUR"
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
   	//freopen(TASK".inp", "r", stdin);
   	//freopen(TASK".out", "w", stdout);

    int ntest = 1;
    //cin >> ntest;
    while (ntest--) solve();

    return 0;
}
//612

Subtask #1
4.0 / 4.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 20392 KB Output is correct
2 Correct 11 ms 14264 KB Output is correct
3 Correct 51 ms 47640 KB Output is correct
4 Correct 107 ms 88344 KB Output is correct
5 Correct 34 ms 28664 KB Output is correct
6 Correct 58 ms 43024 KB Output is correct
7 Correct 103 ms 81332 KB Output is correct
8 Correct 35 ms 34508 KB Output is correct
9 Correct 60 ms 51764 KB Output is correct
10 Correct 127 ms 98180 KB Output is correct
11 Correct 134 ms 97988 KB Output is correct
12 Correct 130 ms 98216 KB Output is correct
13 Correct 131 ms 98192 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 20392 KB Output is correct
2 Correct 11 ms 14264 KB Output is correct
3 Correct 51 ms 47640 KB Output is correct
4 Correct 107 ms 88344 KB Output is correct
5 Correct 34 ms 28664 KB Output is correct
6 Correct 58 ms 43024 KB Output is correct
7 Correct 103 ms 81332 KB Output is correct
8 Correct 35 ms 34508 KB Output is correct
9 Correct 60 ms 51764 KB Output is correct
10 Correct 127 ms 98180 KB Output is correct
11 Correct 134 ms 97988 KB Output is correct
12 Correct 130 ms 98216 KB Output is correct
13 Correct 131 ms 98192 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 76 ms 66868 KB Output is correct
17 Correct 91 ms 80888 KB Output is correct
18 Correct 82 ms 74564 KB Output is correct
19 Correct 18 ms 15824 KB Output is correct
20 Correct 59 ms 54088 KB Output is correct
21 Correct 7 ms 7764 KB Output is correct
22 Correct 20 ms 16472 KB Output is correct
23 Correct 37 ms 32460 KB Output is correct
24 Correct 19 ms 20244 KB Output is correct
25 Correct 126 ms 97888 KB Output is correct
26 Correct 125 ms 97936 KB Output is correct
27 Correct 126 ms 98280 KB Output is correct
28 Correct 128 ms 98208 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 340 KB Output is correct

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 20392 KB Output is correct
2 Correct 11 ms 14264 KB Output is correct
3 Correct 51 ms 47640 KB Output is correct
4 Correct 107 ms 88344 KB Output is correct
5 Correct 34 ms 28664 KB Output is correct
6 Correct 58 ms 43024 KB Output is correct
7 Correct 103 ms 81332 KB Output is correct
8 Correct 35 ms 34508 KB Output is correct
9 Correct 60 ms 51764 KB Output is correct
10 Correct 127 ms 98180 KB Output is correct
11 Correct 134 ms 97988 KB Output is correct
12 Correct 130 ms 98216 KB Output is correct
13 Correct 131 ms 98192 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Incorrect 119 ms 77100 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 19 ms 20392 KB Output is correct
22 Correct 11 ms 14264 KB Output is correct
23 Correct 51 ms 47640 KB Output is correct
24 Correct 107 ms 88344 KB Output is correct
25 Correct 34 ms 28664 KB Output is correct
26 Correct 58 ms 43024 KB Output is correct
27 Correct 103 ms 81332 KB Output is correct
28 Correct 35 ms 34508 KB Output is correct
29 Correct 60 ms 51764 KB Output is correct
30 Correct 127 ms 98180 KB Output is correct
31 Correct 134 ms 97988 KB Output is correct
32 Correct 130 ms 98216 KB Output is correct
33 Correct 131 ms 98192 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 76 ms 66868 KB Output is correct
37 Correct 91 ms 80888 KB Output is correct
38 Correct 82 ms 74564 KB Output is correct
39 Correct 18 ms 15824 KB Output is correct
40 Correct 59 ms 54088 KB Output is correct
41 Correct 7 ms 7764 KB Output is correct
42 Correct 20 ms 16472 KB Output is correct
43 Correct 37 ms 32460 KB Output is correct
44 Correct 19 ms 20244 KB Output is correct
45 Correct 126 ms 97888 KB Output is correct
46 Correct 125 ms 97936 KB Output is correct
47 Correct 126 ms 98280 KB Output is correct
48 Correct 128 ms 98208 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Incorrect 119 ms 77100 KB Output isn't correct
52 Halted 0 ms 0 KB -