# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069967 | 2024-08-22T10:41:57 Z | c2zi6 | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KB |
#define _USE_MATH_DEFINES #include <bits/stdc++.h> #define ff first #define ss second #define pb push_back #define all(a) (a).begin(), (a).end() #define replr(i, a, b) for (int i = int(a); i <= int(b); ++i) #define reprl(i, a, b) for (int i = int(a); i >= int(b); --i) #define rep(i, n) for (int i = 0; i < int(n); ++i) #define mkp(a, b) make_pair(a, b) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> PII; typedef vector<int> VI; typedef vector<PII> VPI; typedef vector<VI> VVI; typedef vector<VVI> VVVI; typedef vector<VPI> VVPI; typedef pair<ll, ll> PLL; typedef vector<ll> VL; typedef vector<PLL> VPL; typedef vector<VL> VVL; typedef vector<VVL> VVVL; typedef vector<VPL> VVPL; template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;} template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;} #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template<class T> using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #include "fish.h" #define solvefor(a) if (TEST1::check(N, M, X, Y, W)) return TEST1::solve(N, M, X, Y, W); namespace TEST1 { bool check(int N, int M, VI X, VI Y, VI W) { for (int x : X) if (x & 1) return false; return true; } ll solve(int N, int M, VI X, VI Y, VI W) { ll ans = 0; for (int x : W) ans += x; return ans; } }; namespace TEST1 { bool check(int N, int M, VI X, VI Y, VI W) { for (int x : X) if (x > 1) return false; return true; } ll solve(int N, int M, VI X, VI Y, VI W) { VL sum(2); rep(i, n) sum[X[i]] += W[i]; return max(sum[0], sum[1]); } }; ll max_weights(int N, int M, VI X, VI Y, VI W) { solvefor(TEST1); solvefor(TEST2); return 0; }