제출 #1238819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1238819		nickolasarapidis	Catfish Farm (IOI22_fish)	C++20	3 / 100	52 ms	10852 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define F first
#define S second

ll solve1(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
	ll ans = 0;
	for(int i = 0; i < M; i++){
		ans += W[i];
	}
	return ans;
}

ll solve2(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
	ll sum1 = 0, sum2 = 0;
	for(int i = 0; i < M; i++){
		if(X[i] == 0) sum1 += W[i];
		else sum2 += W[i];
	}
	return max(sum1, sum2);
}

ll solve3(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
	return 0;
}

ll solve4(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
	return 0;
}

ll solve5(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
	return 0;
}

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
	bool b1 = true, b2 = true, b3 = true, b4 = true, b5 = true;
	for(int i = 0; i < M; i++){
		if(X[i]%2 != 0) b1 = false;
		if(X[i] > 1) b2 = false;
		if(Y[i] != 0) b3 = false;
	}
	if(b1) return solve1(N, M, X, Y, W);
	if(b2) return solve2(N, M, X, Y, W);
	if(b3) return solve3(N, M, X, Y, W);
	if(b4) return solve4(N, M, X, Y, W);
	if(b5) return solve5(N, M, X, Y, W);
	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