제출 #1055941

#제출 시각아이디문제언어결과실행 시간메모리
1055941amirhoseinfar1385메기 농장 (IOI22_fish)C++17
3 / 100
57 ms13908 KiB
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;

int n,m;
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    long long sum1=0,sum0=0,res=0,f=0;
    n=N;
    m=(int)X.size();
    for(int i=0;i<m;i++){
        res+=W[i];
        if(X[i]==0){
            sum0+=W[i];
        }else if(X[i]==1){
            sum1+=W[i];
        }
        if(X[i]&1){
            f=1;
        }
    }
    if(f==1){
        return max(sum1,sum0);
    }
  return res;
}
#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...