/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 1.062 MiB
#2 Wrong Answer 2ms 1.062 MiB
#3 Wrong Answer 2ms 1.02 MiB
#4 Wrong Answer 2ms 1.066 MiB
#5 Wrong Answer 25ms 1.184 MiB
#6 Wrong Answer 37ms 12.086 MiB
#7 Wrong Answer 37ms 12.066 MiB
#8 Wrong Answer 37ms 12.152 MiB
#9 Accepted 35ms 12.062 MiB
#10 Accepted 36ms 12.184 MiB
#11 Accepted 35ms 12.18 MiB
#12 Accepted 35ms 12.219 MiB
#13 Accepted 35ms 12.176 MiB
#14 Accepted 35ms 12.066 MiB
#15 Accepted 35ms 12.066 MiB
#16 Accepted 35ms 12.172 MiB

Code

#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define endl '\n'
#define Endl '\n'

using namespace std;

const int N = 2e5 + 5;
int tc, n, m, a[N], b[N], c[N];
ll dp[N][3];
bool vis[N][3];

ll rec(int idx, int lastTaken) {
    if (idx == n) {
        return 0;
    }
    ll &ret = dp[idx][lastTaken];
    if (vis[idx][lastTaken]) {
        return ret;
    }
    vis[idx][lastTaken] = true;
    ret = 0;
    if (lastTaken != 0) {
        ret = max(ret, a[idx] + rec(idx + 1, 0));
    }
    if (lastTaken != 1) {
        ret = max(ret, b[idx] + rec(idx + 1, 1));
    }
    if (lastTaken != 2) {
        ret = max(ret, c[idx] + rec(idx + 1, 2));
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); // cout.tie(0);
    cin >> tc;
    while (tc--) {
        cin >> n;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        for (int i = 0; i < n; i++) {
            cin >> b[i];
        }
        for (int i = 0; i < n; i++) {
            cin >> c[i];
        }
        memset(vis, 0, sizeof vis);
        cout << rec(0, -1) << endl;
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1046 Maximum sum in 3-array
Contest
TLE_Headquarters - round #1
Language
C++17 (G++ 13.2.0)
Submit At
2024-03-27 17:32:39
Judged At
2024-10-03 13:55:49
Judged By
Score
66
Total Time
37ms
Peak Memory
12.219 MiB