Submission #1042005

#TimeUsernameProblemLanguageResultExecution timeMemory
1042005VMaksimoski008Catfish Farm (IOI22_fish)C++17
3 / 100
53 ms13916 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { int mask = 0; for(int i=0; i<M; i++) mask |= (1 << (X[i] % 2)); if(mask == 1) { ll ans = 0; for(int &x : W) ans += x; return ans; } return 0; }
#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...