Submission #1043185

#TimeUsernameProblemLanguageResultExecution timeMemory
1043185ezzzayCatfish Farm (IOI22_fish)C++17
12 / 100
57 ms13700 KiB
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#include <vector>
#define ll long long
const int MN=1e6;
ll a[MN];
ll dp[MN][2][2];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    for(int i=0;i<M;i++){
        a[X[i]]+=W[i];
    }
    dp[1][1][0]=a[0];
    dp[1][0][1]=a[1];
    for(int i=2;i<N;i++){
        dp[i][1][1]=max(dp[i-1][1][0],dp[i-1][1][1]);
		dp[i][1][0]=max(dp[i-1][0][1],dp[i-1][0][0]+a[i-1]);
		dp[i][0][1]=max(dp[i-1][1][0],dp[i-1][1][1])+a[i];
		dp[i][0][0]=max(dp[i-1][0][1],dp[i-1][0][0]);
    }
    return max({dp[N-1][0][0],dp[N-1][0][1],dp[N-1][1][0],dp[N-1][1][1]});
}
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...