Submission #778608

#	Time	Username	Problem	Language	Result	Execution time	Memory
778608		Malix	Catfish Farm (IOI22_fish)	C++17	3 / 100	101 ms	7252 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];
    }


    long long temp = 0;
    for(int i = 0; i <= 1; i++){
      for(int j = 0; j < N; j++){
        temp += grid[i][j];
      }
      ans = max(ans, temp);
    }
    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