Submission #1223288

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223288		brinton	Catfish Farm (IOI22_fish)	C++20	0 / 100	14 ms	3648 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W) {
  vector<long long> val(N,0);
  for(int i = 0;i < M;i++) val[X[i]] = W[i];
  vector<long long> dp(N,0);
  for(int i = 0;i < M;i++){
    if(i == 0) dp[i] = val[0];
    else if(i == 1) dp[i] = val[0]+val[1];
    else if(i == 2) dp[i] = max({val[0]+val[1],val[1]+val[2],val[0]+val[2]});
    else dp[i] = max({dp[i-1],dp[i-2]+val[i],dp[i-3]+val[i]+val[i-1]});
  }
  return dp[N];
}

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