# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
625480 | 2022-08-10T13:09:29 Z | I_love_Hoang_Yen | 메기 농장 (IOI22_fish) | C++17 | 0 ms | 0 KB |
#include "bits/stdc++.h" using namespace std; #define int long long struct Fish { int col, row; int weight; }; int sub1(const std::vector<Fish>& fishes) { int res = 0; for (const auto& fish : fishes) { res += fish.weight; } return res; } int solve(int n, const std::vector<Fish>& fishes) { if (std::all_of( fishes.begin(), fishes.end(), [] (const Fish& f) { return f.col % 2 == 0; })) { return sub1(fishes); } return sub1(fishes); } int max_weights( int n, int nFish, std::vector<int> x, std::vector<int> y, std::vector<int> w) { std::vector<Fish> fishes; for (int i = 0; i < n; ++i) { fishes.push_back({x[i], y[i], w[i]}); } return solve(n, fishes); }