Submission #630856

#TimeUsernameProblemLanguageResultExecution timeMemory
630856oliversommerCatfish Farm (IOI22_fish)C++17
0 / 100
21 ms2128 KiB
#include "fish.h" #include <algorithm> #include <assert.h> #include <numeric> #include <vector> using namespace std; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { int sum0 = 0, sum1 = 0; for(int i = 0; i < M; ++i) { assert(X[i] == 0 || X[i] == 1); if(X[i] == 0) { sum0 += W[i]; } else { sum1 += W[i]; } } return max(sum0, sum1); }
#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...