제출 #872268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
872268		Ludissey	메기 농장 (IOI22_fish)	C++17	0 / 100	1092 ms	54104 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
map<pair<int,int>, int> a;
vector<vector<int>> fsh;
 
map<pair<int,pair<int,int>>, int> memo;
int N,M;
int dp(int x, int last, int big){
  if(memo.find({x,{last,big}})!=memo.end()) return memo[{x,{last,big}}];
  if(x==N) return 0;
 
  memo[{x,{last,big}}] = 0;
  for (auto i:fsh[x])
  {
    int asc=big;
    int c=0;
    if(i>last) {
      if(big==0) break;
      c=dp(x+1, i, 1);
      asc=true;
    }else if(i<last){
      asc=false;
      c=dp(x+1, i, 0);
    }else if(i==last) {
      c=max(dp(x+1, i, big),dp(x+1, i, 1-big));
    }
    if(x>0) {
      if(asc) for (int y = last; y < i; y++) c+=a[{x-1,y}];
      else for (int y = i; y < last; y++) c+=a[{x,y}];
    }
    memo[{x,{last,big}}]=max(c, memo[{x,{last,big}}]);
  }
  return memo[{x,{last,big}}];
}
 
long long max_weights(signed n, signed m, std::vector<signed> X, std::vector<signed> Y, std::vector<signed> W) {
  N=n; M=m; 
  fsh.resize(N+1, vector<int>(1,0));
  for (int i = 0; i < M; i++){
    a[{X[i],Y[i]}] = W[i];
    fsh[X[i]+1].push_back(Y[i]+1);
    if(X[i]>0) fsh[X[i]-1].push_back(Y[i]+1);
  }
  for (int i = 0; i < N; i++) sort(fsh[i].begin(),fsh[i].end());
  
  int p=dp(0,0,1);
  return p;
}

• 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