Submission #550136

#TimeUsernameProblemLanguageResultExecution timeMemory
550136tabrFriend (IOI14_friend)C++17
100 / 100
32 ms8080 KiB
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

int findSample(int n, int c[], int h[], int p[]) {
    vector<vector<int>> dp(n, vector<int>(2));
    for (int i = 0; i < n; i++) {
        dp[i][1] = c[i];
    }
    for (int i = n - 1; i >= 1; i--) {
        if (p[i] == 0) {
            dp[h[i]][1] += dp[i][0];
            dp[h[i]][0] += max(dp[i][0], dp[i][1]);
        } else if (p[i] == 1) {
            dp[h[i]][1] = max({dp[h[i]][1] + dp[i][0], dp[h[i]][0] + dp[i][1], dp[h[i]][1] + dp[i][1]});
            dp[h[i]][0] += dp[i][0];
        } else {
            dp[h[i]][1] = max(dp[h[i]][1] + dp[i][0], dp[h[i]][0] + dp[i][1]);
            dp[h[i]][0] += dp[i][0];
        }
    }
    return max(dp[0][0], dp[0][1]);
}

#ifdef tabr
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    return 0;
}
#endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...