제출 #871895

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
871895		Ludissey	메기 농장 (IOI22_fish)	C++17	0 / 100	1057 ms	50332 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 lastlast){
  if(memo.find({x,{last,lastlast}})!=memo.end()) return memo[{x,{last,lastlast}}];
  if(x==N) return 0;
 
  memo[{x,{last,lastlast}}] = 0;
  for (auto i:fsh[x])
  {
    int c=dp(x+1, i, last);
    for (int j=0; j<fsh[x].size(); j++) {
      if(fsh[x][j]<=max(i,lastlast)&&fsh[x][j]>last) {
        c+=a[{x-1,fsh[x][j]-1}];
      }
    }
    if(x==N-1) {
      for (int j=0; j<fsh[N].size(); j++) {
        if(fsh[N][j]<=last&&fsh[N][j]>i) {
          c+=a[{x,fsh[N][j]-1}];
        }
      }
    }
    memo[{x,{last,lastlast}}]=max(c, memo[{x,{last,lastlast}}]);
  }
  return memo[{x,{last,lastlast}}];
}
 
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);
  }

  int p=dp(0,0,0);
  return p;
}

컴파일 시 표준 에러 (stderr) 메시지

fish.cpp: In function 'long long int dp(long long int, long long int, long long int)':
fish.cpp:18:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int j=0; j<fsh[x].size(); j++) {
      |                   ~^~~~~~~~~~~~~~
fish.cpp:24:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |       for (int j=0; j<fsh[N].size(); j++) {
      |                     ~^~~~~~~~~~~~~~

• 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