# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858196 | 2023-10-07T14:58:36 Z | vjudge1 | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #define pb push_back #define eb emplace_back #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define uniq(x) x.erase(unique(all(x)), x.end()) #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; void setIO() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int64_t max_weights(int n, int m, int x[], int y[], int w[]) { ll ans = 0; for(int i=0; i<m; i++) { if(x[i] % 2 == 1) continue; if(x[i] == 0) continue; if(x[i] == n-1) continue; ans += w[i]; } return ans; } // int32_t main() { // setIO(); // int n, m; // cin >> n >> m; // int x[m], y[m], w[m]; // for(int i=0; i<m; i++) // cin >> x[i] >> y[i] >> w[i]; // cout << max_weights(n, m, x, y, w) << '\n'; // return 0; // }