Submission #1037495

#	Time	Username	Problem	Language	Result	Execution time	Memory
1037495		HappyCapybara	메기 농장 (IOI22_fish)	C++17	23 / 100	714 ms	264416 KiB

fish

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

#define ll long long

int n;
//unordered_map<ll,ll> dp;
vector<vector<vector<ll>>> dp;
vector<vector<ll>> v;

ll solve(int c, int p1, int p2){
  //cout << c << " " << p1 << " " << p2 << "\n";
  if (c == n) return 0;
  if (dp[c][p1+1][p2+1] != -1) return dp[c][p1+1][p2+1];
  ll cur = 0, res = 0;
  for (int i=-1; i<min(n, 9); ){
    //if (c == 4 && p1 == -1 && p2 == -1) cout << i << " " << cur << "\n";
    res = max((ll) res, (ll) cur+ (ll) solve(c+1, i, p1));
    i++;
    if ((c > 0) && (p1 < i) && (c == 1 || p2 < i)) cur += v[c-1][i];
    if (c < n-1) cur += v[c+1][i];
    if ((c > 0) && (p1 >= i)) cur -= v[c][i];
  }
  //cout << c << " " << p1 << " " << p2 << " " << res << "\n";
  return dp[c][p1+1][p2+1] = res;
}

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
  n = N;
  v.resize(N, vector<ll>(9, 0));
  for (int i=0; i<M; i++) v[X[i]][Y[i]] = W[i];
  dp.resize(n, vector<vector<ll>>(10, vector<ll>(10, -1)));
  return solve(0, 0, 0);
}

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