제출 #756059

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

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>
/*
N - rows and columns
M - number of fish
X, Y - coordinates
W - weights

Y[i] = 0 means that we can only harvest up to 3 fish at a time
*/
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    /*int subtask1 = 1;
    int subtask2 = 1;
    int subtask3 = 1;
    long long res = 0;
    for(int i = 0; i < W.size(); i ++){
        if(X[i] % 2 == 0){
            res += W[i];
        } else {
            subtask1 = 0;
        }
        if(Y[i] > 1){
            subtask2 = 0;
        }
    }*/
    long long res_left = 0;
    long long res_right = 0;
    for(int i = 0; i < M; i ++){
        if(X[i] == 0) res_left += W[i];
        if(X[i] == 1) res_right += W[i];
    }
    return max(res_left, res_right);
    /*vector<vector<int>> fish(M, vector<int>());
    for(int i = 0; i < M; i ++){

    }
    if(subtask1){ 
        return res;
    } else if(subtask2){
        return max(res_left, res_right);
    }*/
    
    
}
/*
g++ -std=gnu++17 -O2 -Wall -pipe -static -o fish grader.cpp fish.cpp
5 6
0 1 1
0 3 1
0 2 4
1 1 5
1 0 6
1 4 5
*/

• 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