Submission #1180319

#TimeUsernameProblemLanguageResultExecution timeMemory
1180319madamadam3Catfish Farm (IOI22_fish)C++20
0 / 100
48 ms7240 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using vi = vector<int>; typedef long long ll; ll max_weights(int N, int M, vi X, vi Y, vi W) { // subtask 2: x[i] <= 1: either use everything in col0, or col1 (as using 1 means you cant use the other) ll c0 = 0, c1 = 0; for (int i = 0; i < M; i++) { if (X[i] == 0) { c0 += W[i]; } else { c1 += W[i]; } } ll ans = max(c0, c1); return ans; }
#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...