제출 #778635

#제출 시각아이디문제언어결과실행 시간메모리
778635Malix메기 농장 (IOI22_fish)C++17
3 / 100
63 ms8456 KiB
#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 count = 0;
  for(int i = 0; i < M; i++){
    if(X[i]%2 == 0){
      count++;
    }
  }
  long long ans = 0;
  if(count == M){

    for(int i = 0; i < M; i++){
      ans += (long long)W[i];
    }
    return ans;
  }
  
  count = 0;
  for(int i = 0; i < M; i++){
    if(X[i] <= 1){
      count++;
    }
  }
  if(count == M){
    
    long long zeroside = 0;
    long long oneside = 0;
    for(int i = 0; i < M; i++){
        if(X[i] == 0){
          zeroside += (long long)W[i];
        }
        else{
          oneside += (long long)W[i];
        }
    }
    ans = max(oneside, zeroside);

    return ans;

  }




  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...