제출 #954740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
954740		IUA_Hasin	메기 농장 (IOI22_fish)	C++17	0 / 100	73 ms	11040 KiB

fish

#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
 
using namespace std; 

#include "fish.h"

#include <vector>

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
                        ll sum0 = 0;
                        ll sum1 = 0;
                        for(int i=0; i<M; i++){
                          ll a = W[i];
                          if(X[i]==0){
                            sum0 = sum0+a;
                          } else {
                            sum1 = sum1+a;
                          }
                        }
                        ll ans = max(sum0, sum1);
                        return ans;

  // return 0;
}

• 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