Submission #1199910

#TimeUsernameProblemLanguageResultExecution timeMemory
1199910fadyscubeCatfish Farm (IOI22_fish)C++17
0 / 100
47 ms7240 KiB
#include "fish.h" #include <vector> using namespace std; #define ll long long long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { ll can1 = 0; ll can2 = 0; for (int i = 0; i < M; i++) { if (X[i] == 1) can1 += W[i]; else if (X[i] == 0) can2 += W[i]; } return max(can1, can2); }
#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...