Submission #1056621

#TimeUsernameProblemLanguageResultExecution timeMemory
1056621MercubytheFirstCatfish Farm (IOI22_fish)C++17
0 / 100
62 ms21084 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; const ll inf = 1e9 + 37; long long max_weights(signed N, signed M, vector<signed> X, vector<signed> Y, vector<signed> W) { ll a[2]{}; for(int i = 0; i < M; ++i) { a[X[i]] += W[i]; } return max(a[0], a[1]); }
#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...