답안 #678437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678437 2023-01-06T02:10:11 Z DP_196 Visiting Singapore (NOI20_visitingsingapore) C++14
22 / 100
172 ms 196112 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 = 1e9;
const int MOD = 1e9 + 7;

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

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

void sub2() {
	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]);
			if (s[i] == t[j]) maximize(g[i][j], g[i - 1][j - 1] + v[s[i]]);
		}
	
	cout << g[n][m];
}

void sub3() {
	
}

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 && b == 0) sub2();
}

#define TASK ""
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
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 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 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 30004 KB Output is correct
2 Correct 12 ms 18128 KB Output is correct
3 Correct 57 ms 79948 KB Output is correct
4 Correct 129 ms 174244 KB Output is correct
5 Correct 41 ms 51384 KB Output is correct
6 Correct 59 ms 76248 KB Output is correct
7 Correct 105 ms 143356 KB Output is correct
8 Correct 39 ms 54792 KB Output is correct
9 Correct 68 ms 91448 KB Output is correct
10 Correct 151 ms 196044 KB Output is correct
11 Correct 147 ms 195560 KB Output is correct
12 Correct 172 ms 196112 KB Output is correct
13 Correct 151 ms 195924 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 30004 KB Output is correct
2 Correct 12 ms 18128 KB Output is correct
3 Correct 57 ms 79948 KB Output is correct
4 Correct 129 ms 174244 KB Output is correct
5 Correct 41 ms 51384 KB Output is correct
6 Correct 59 ms 76248 KB Output is correct
7 Correct 105 ms 143356 KB Output is correct
8 Correct 39 ms 54792 KB Output is correct
9 Correct 68 ms 91448 KB Output is correct
10 Correct 151 ms 196044 KB Output is correct
11 Correct 147 ms 195560 KB Output is correct
12 Correct 172 ms 196112 KB Output is correct
13 Correct 151 ms 195924 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 -
# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 30004 KB Output is correct
2 Correct 12 ms 18128 KB Output is correct
3 Correct 57 ms 79948 KB Output is correct
4 Correct 129 ms 174244 KB Output is correct
5 Correct 41 ms 51384 KB Output is correct
6 Correct 59 ms 76248 KB Output is correct
7 Correct 105 ms 143356 KB Output is correct
8 Correct 39 ms 54792 KB Output is correct
9 Correct 68 ms 91448 KB Output is correct
10 Correct 151 ms 196044 KB Output is correct
11 Correct 147 ms 195560 KB Output is correct
12 Correct 172 ms 196112 KB Output is correct
13 Correct 151 ms 195924 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 -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 23 ms 30004 KB Output is correct
22 Correct 12 ms 18128 KB Output is correct
23 Correct 57 ms 79948 KB Output is correct
24 Correct 129 ms 174244 KB Output is correct
25 Correct 41 ms 51384 KB Output is correct
26 Correct 59 ms 76248 KB Output is correct
27 Correct 105 ms 143356 KB Output is correct
28 Correct 39 ms 54792 KB Output is correct
29 Correct 68 ms 91448 KB Output is correct
30 Correct 151 ms 196044 KB Output is correct
31 Correct 147 ms 195560 KB Output is correct
32 Correct 172 ms 196112 KB Output is correct
33 Correct 151 ms 195924 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Incorrect 1 ms 340 KB Output isn't correct
37 Halted 0 ms 0 KB -