Submission #1216142

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216142		Mousa_Aboubaker	Catfish Farm (IOI22_fish)	C++20	0 / 100	17 ms	7756 KiB

fish

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

using ll = long long;

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W)
{
  auto n = N, m = M;
  auto x = X, y = Y, w = W;
  if(n == 1)
    return 0;
  vector<int> ord(m);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](int l, int r)
  {
    return x[l] < x[r];
  });
  vector dp(m + 1, vector<ll>(2, 0));
  // dp[i][j] = the max score I can get if I built a pier in i, or if I didn't
  for(int i = 0; i < m; i++)
  {
    if(i == 0 and x[ord[0]] == 0)
      continue;
    dp[i + 1][0] = max(dp[i][0], dp[i][1] + w[ord[i]]);
    dp[i + 1][1] = max(dp[i][1], dp[i][0]);
    if(i)
      dp[i + 1][1] = max(dp[i + 1][1], max(dp[i - 1][0], dp[i - 1][1]) + w[ord[i - 1]]);
  }
  ll res = max(dp.back()[0], dp.back()[1]);
  if(x[ord[m - 1]] != n - 1)
  {
    res = max(res, max(dp.end()[-2][0], dp.end()[-2][1]) + w[ord[m - 1]]);
  }

  return res;
}

• 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