Submission #833787

#TimeUsernameProblemLanguageResultExecution timeMemory
833787mindiyakCatfish Farm (IOI22_fish)C++17
0 / 100
108 ms7248 KiB
#include "fish.h" #include <vector> using namespace std; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { long long ans0 = 0,ans1 = 0; for(int i=0;i<M;i++){ if(X[i]==0)ans0+=W[i]; else ans1+=W[i]; } return max(ans0,ans1); }
#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...