oj.uz

답안 #680898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680898 2023-01-12T01:48:43 Z DennisTran Visiting Singapore (NOI20_visitingsingapore) C++17
4 / 100
 94 ms 196428 KB 
#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define file(name)  if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }

using namespace std;

const int MAXN = 5005;
const int INF = 0x3f3f3f3f;

int K, N, M, A, B, v[MAXN], s[MAXN], t[MAXN];
int dp[MAXN][MAXN], Max[MAXN][MAXN], Ord[MAXN];

signed main(void) {
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    //file("TASK");
    cin >> K >> N >> M >> A >> B;
    FOR(i, 1, K) cin >> v[i];
    FOR(i, 1, N) cin >> s[i];
    FOR(i, 1, M) cin >> t[i];

    memset(dp, -INF, sizeof dp);
    memset(Max, -INF, sizeof Max);
    memset(Ord, -INF, sizeof Ord);
    FOR(i, 1, N) {
        int cur = -INF;
        FOR(j, 1, M) {
            if (s[i] == t[j]) {
                dp[i][j] = dp[i - 1][j - 1] + v[t[j]];
                if (i >= 2 && j >= 2)
                    dp[i][j] = max(dp[i][j], Max[i - 2][j - 2] + v[t[j]] + B * (i + j) + 2 * (A - B));
                if (j >= 2)
                    dp[i][j] = max(dp[i][j], cur + v[t[j]] + B * j + A - B);
                if (i >= 2)
                    dp[i][j] = max(dp[i][j], Ord[j - 1] + v[t[j]] + B * i + A - B);
                 dp[i][j] = max(dp[i][j], v[t[j]] + (j > 1) * A + (j - 1) * B);
            }

            Max[i][j] = dp[i][j] - B *(i + j);
            Max[i][j] = max(Max[i][j], Max[i - 1][j]);
            Max[i][j] = max(Max[i][j], Max[i][j - 1]);
            if (j >= 1) cur = max(cur, dp[i][j - 1] + (j - 1) * B);
        }
        if (i >= 1) {
            int Max = -INF;
            FOR(j, 1, M) {
                Max = max(Max, dp[i - 1][j]);
                Ord[j] = max(Ord[j], Max);
            }
        }
    }
    int ans = -INF;
    FOR(i, 0, N) FOR(j, 0, M) if (dp[i][j] != -INF)
        ans = max(ans, dp[i][j] + (M > j) * A + (M - j) * B);
    cout << ans;
    cerr << "Time elapsed: " << TIME << " s.\n";
    return (0 ^ 0);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 196428 KB Output is correct
2 Correct 78 ms 196356 KB Output is correct
3 Correct 70 ms 196344 KB Output is correct
4 Correct 77 ms 196376 KB Output is correct
5 Correct 83 ms 196356 KB Output is correct
6 Correct 79 ms 196412 KB Output is correct
7 Correct 75 ms 196420 KB Output is correct
8 Correct 72 ms 196328 KB Output is correct
9 Correct 76 ms 196332 KB Output is correct
10 Correct 94 ms 196392 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 73 ms 196428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 89 ms 196404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 89 ms 196404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 89 ms 196404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 76 ms 196340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 196428 KB Output is correct
2 Correct 78 ms 196356 KB Output is correct
3 Correct 70 ms 196344 KB Output is correct
4 Correct 77 ms 196376 KB Output is correct
5 Correct 83 ms 196356 KB Output is correct
6 Correct 79 ms 196412 KB Output is correct
7 Correct 75 ms 196420 KB Output is correct
8 Correct 72 ms 196328 KB Output is correct
9 Correct 76 ms 196332 KB Output is correct
10 Correct 94 ms 196392 KB Output is correct
11 Incorrect 73 ms 196428 KB Output isn't correct
12 Halted 0 ms 0 KB -