oj.uz

Submission #678821

# Submission time Handle Problem Language Result Execution time Memory
678821 2023-01-06T16:12:19 Z DP_196 Visiting Singapore (NOI20_visitingsingapore) C++14
29 / 100
 187 ms 196252 KB 
#include <bits/stdc++.h>

using namespace std;

#define int int64_t
#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 = 1e17;
const int MOD = 1e9 + 7;

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

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

void sub2() {
	int res = -INF;

	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() {	
	memset(f, -0x3f, sizeof (f));
	
	int res = f[0][0];
	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 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 (n <= 100 && m <= 100) sub6();
}

#define TASK "FUNTOUR"
int32_t 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 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 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 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 29964 KB Output is correct
2 Correct 13 ms 18124 KB Output is correct
3 Correct 63 ms 79808 KB Output is correct
4 Correct 148 ms 174216 KB Output is correct
5 Correct 43 ms 51384 KB Output is correct
6 Correct 60 ms 76180 KB Output is correct
7 Correct 109 ms 143400 KB Output is correct
8 Correct 43 ms 54868 KB Output is correct
9 Correct 75 ms 91340 KB Output is correct
10 Correct 162 ms 195996 KB Output is correct
11 Correct 158 ms 195512 KB Output is correct
12 Correct 187 ms 196056 KB Output is correct
13 Correct 165 ms 196044 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 26 ms 29964 KB Output is correct
2 Correct 13 ms 18124 KB Output is correct
3 Correct 63 ms 79808 KB Output is correct
4 Correct 148 ms 174216 KB Output is correct
5 Correct 43 ms 51384 KB Output is correct
6 Correct 60 ms 76180 KB Output is correct
7 Correct 109 ms 143400 KB Output is correct
8 Correct 43 ms 54868 KB Output is correct
9 Correct 75 ms 91340 KB Output is correct
10 Correct 162 ms 195996 KB Output is correct
11 Correct 158 ms 195512 KB Output is correct
12 Correct 187 ms 196056 KB Output is correct
13 Correct 165 ms 196044 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 109 ms 117624 KB Output is correct
17 Correct 113 ms 142336 KB Output is correct
18 Correct 113 ms 129100 KB Output is correct
19 Correct 26 ms 26836 KB Output is correct
20 Correct 77 ms 92920 KB Output is correct
21 Correct 7 ms 9940 KB Output is correct
22 Correct 24 ms 28884 KB Output is correct
23 Correct 51 ms 56876 KB Output is correct
24 Correct 22 ms 29012 KB Output is correct
25 Correct 167 ms 195428 KB Output is correct
26 Correct 167 ms 195624 KB Output is correct
27 Correct 169 ms 196252 KB Output is correct
28 Correct 163 ms 196036 KB Output is correct
29 Correct 1 ms 340 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 26 ms 29964 KB Output is correct
2 Correct 13 ms 18124 KB Output is correct
3 Correct 63 ms 79808 KB Output is correct
4 Correct 148 ms 174216 KB Output is correct
5 Correct 43 ms 51384 KB Output is correct
6 Correct 60 ms 76180 KB Output is correct
7 Correct 109 ms 143400 KB Output is correct
8 Correct 43 ms 54868 KB Output is correct
9 Correct 75 ms 91340 KB Output is correct
10 Correct 162 ms 195996 KB Output is correct
11 Correct 158 ms 195512 KB Output is correct
12 Correct 187 ms 196056 KB Output is correct
13 Correct 165 ms 196044 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Incorrect 1 ms 340 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 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 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Incorrect 1 ms 340 KB Output isn't correct
14 Halted 0 ms 0 KB -

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 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 26 ms 29964 KB Output is correct
22 Correct 13 ms 18124 KB Output is correct
23 Correct 63 ms 79808 KB Output is correct
24 Correct 148 ms 174216 KB Output is correct
25 Correct 43 ms 51384 KB Output is correct
26 Correct 60 ms 76180 KB Output is correct
27 Correct 109 ms 143400 KB Output is correct
28 Correct 43 ms 54868 KB Output is correct
29 Correct 75 ms 91340 KB Output is correct
30 Correct 162 ms 195996 KB Output is correct
31 Correct 158 ms 195512 KB Output is correct
32 Correct 187 ms 196056 KB Output is correct
33 Correct 165 ms 196044 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 109 ms 117624 KB Output is correct
37 Correct 113 ms 142336 KB Output is correct
38 Correct 113 ms 129100 KB Output is correct
39 Correct 26 ms 26836 KB Output is correct
40 Correct 77 ms 92920 KB Output is correct
41 Correct 7 ms 9940 KB Output is correct
42 Correct 24 ms 28884 KB Output is correct
43 Correct 51 ms 56876 KB Output is correct
44 Correct 22 ms 29012 KB Output is correct
45 Correct 167 ms 195428 KB Output is correct
46 Correct 167 ms 195624 KB Output is correct
47 Correct 169 ms 196252 KB Output is correct
48 Correct 163 ms 196036 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Incorrect 1 ms 340 KB Output isn't correct
52 Halted 0 ms 0 KB -