Submission #1201463

#TimeUsernameProblemLanguageResultExecution timeMemory
1201463TimoshCatfish Farm (IOI22_fish)C++20
3 / 100
48 ms7240 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { bool ok = 1; for (auto &i : X) ok &= (i % 2 == 0); if (ok) return accumulate(W.begin(), W.end(), 0ll); if (*max_element(X.begin(), X.end()) <= 1) { vector<int> A(N), B(N); for (int i = 0; i < N; i++) { if (X[i]) B[Y[i]] = W[i]; else A[Y[i]] = W[i]; } long long mx, s; s = mx = 0; for (int i = 0; i < N; i++) { s += A[i] - B[i]; s = max(0ll, s); mx = max(mx, s); } return mx + accumulate(B.begin(), B.end(), 0ll); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...