제출 #778601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
778601		Malix	메기 농장 (IOI22_fish)	C++17	3 / 100	62 ms	7264 KiB

fish

#include "fish.h"

#include <vector>
using namespace std;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {

  int Xsize = X.size();
  int count = 0;
  for(int i = 0; i < Xsize; i++){
    if(X[i]%2 == 0){
      count++;
    }
  }
  long long ans = 0;
  if(count == Xsize){
    int Wsize = W.size();
    for(int i = 0; i < Wsize; i++){
      ans += W[i];
    }
    return ans;
  }
  
  count = 0;
  for(int i = 0; i < Xsize; i++){
    if(X[i] <= 1){
      count++;
    }
  }
  if(count == Xsize){
    
    vector<vector<long long> > grid(2, vector<long long>(N, 0));

    for(int i = 0; i < M; i++){
        grid[X[i]][Y[i]] = W[i];
    }

    vector<vector<long long> > Sumgrid(2, vector<long long>(N, 0));

    for(int i = 0; i <= 1; i++){
      Sumgrid[i][0] = grid[!i][0] - grid[i][0];
      for(int j = 1; j < N; j++){
        Sumgrid[i][j] = grid[!i][j] - grid[i][j] + Sumgrid[i][j-1];
        ans = max(Sumgrid[i][j], ans);
      }
    }
    return ans;

  }




  return 0;
}

• Subtask 1: 3 / 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