Submission #1072418

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072418		Boas	Catfish Farm (IOI22_fish)	C++17	0 / 100	794 ms	914120 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template <typename T1, typename T2>
using indexed_map = tree<T1, T2, less<T1>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using indexed_set = indexed_map<T, null_type>;

#define loop(x, i) for (int i = 0; i < (x); i++)
#define loop1(x, i) for (int i = 1; i <= (x); i++)
#define rev(x, i) for (int i = (int)(x) - 1; i >= 0; i--)
#define itloop(x) for (auto it = begin(x); x != end(x); it++)
#define itrev(x) for (auto it = rbegin(x); x != rend(x); it++)
#define int long long
#define INF ((int64_t)(4e18 + 1))
#define INF32 ((int32_t)(2e9 + 1))
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define removeIn(x, l) l.erase(find(ALL(l), x))
#define pb push_back
#define sz(x) (int)(x).size()
#define F first
#define S second
#define var const auto &
#define foreach(l) for (var e : l)

typedef int8_t i8;
typedef int16_t i16;
typedef int32_t i32;
typedef int64_t i64;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<i32> vi32;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vii> vvii;
typedef vector<viii> vviii;
typedef set<int> si;
typedef set<ii> sii;
typedef set<iii> siii;
typedef vector<si> vsi;
typedef vector<sii> vsii;
typedef vector<vsi> vvsi;
typedef vector<string> vstr;
typedef vector<vector<string>> vvstr;
typedef vector<bool> vb;
typedef vector<vb> vvb;

int max_weights(i32 N, i32 M, vi32 X, vi32 Y, vi32 W)
{
  int yCount = 9;
  vvi wsAtX(N, vi(yCount));
  vvi wSum(N, vi(yCount));
  loop(M, i)
  {
    wsAtX[X[i]][Y[i]] = W[i];
  }
  loop(N, x)
  {
    loop(yCount, y)
    {
      wSum[x][y] = (y == 0 ? 0 : wSum[x][y - 1]) + wsAtX[x][y];
    }
  }
  vvvvi dp(N, vvvi(yCount, vvi(yCount, vi(3)))); // 0: adjacentL, 1: adjacentR
  vi maxAll(N);
  vvi maxOfHeight(N, vi(yCount));
  loop(N, x)
  {
    loop(yCount, j)
    {
      int prevMax = 0;
      if (x != 0)
      {
        loop(yCount, i)
        {
          prevMax = max(prevMax, dp[x - 1][j][i][0]);
        }
      }
      loop(yCount, i) // hoogte van deze steiger
      {
        if (j <= i)
        {
          dp[x][i][j][0] = dp[x][i][j][1] = (x == 0) ? 0 : maxOfHeight[x - 1][i];
        }
        else
        {
          int sum = wSum[x][j] - wSum[x][i];
          if (x == 0)
          {
            dp[x][i][j][0] = -1;
            dp[x][i][j][1] = sum;
          }
          else
          {
            dp[x][i][j][0] = max(dp[x - 1][j][i][1], prevMax) + sum;
            dp[x][i][j][1] = max(dp[x - 1][j][i][1], maxAll[x - 1]) + sum;
          }
        }
        maxAll[x] = max({maxAll[x], dp[x][i][j][0]});
        maxOfHeight[x][j] = max({maxOfHeight[x][j], dp[x][i][j][0], dp[x][i][j][1]});
      }
    }
  }
  return maxAll.back();
}

• 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