Submission #778791

#	Time	Username	Problem	Language	Result	Execution time	Memory
778791		YassirSalama	Catfish Farm (IOI22_fish)	C++17	9 / 100	31 ms	10048 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define all(v) v.begin(),v.end()
const int MAXN=1e5+1000;
// long long dp[MAXN][2];//0 last one is not built, 1 last one is built
vector<int> v(MAXN,0);
int n;
int m;
long long max_weights(int N, int M, vector<int> X, vector<int> Y,
                      vector<int> W) {
    for(int i=0;i<M;i++) v[X[i]]+=W[i];
    n=N;
    m=M;
    vector<vector<long long>> dp(MAXN,vector<long long>(2,0));
    for(int i=1;i<=n;i++){
        dp[i][1]=dp[i-1][1];
        if(i>1) dp[i][1]=max(dp[i-1][1],max(dp[i-2][1],dp[i-2][0])+v[i-1]);
        else dp[i][1]=v[i-1];
        dp[i][0]=max(dp[i-1][0],dp[i-1][1]+v[i]);
    }
    // for(int i=1;i<=n;i++) cout<<dp[i]<<" ";
    return *max_element(all(dp[n-1]));
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 9 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16