제출 #629795

#제출 시각아이디문제언어결과실행 시간메모리
629795europium메기 농장 (IOI22_fish)C++17
0 / 100
84 ms7268 KiB
#include "fish.h" #include <iostream> #include <vector> #include <algorithm> #include <string> #include <numeric> #include <cmath> #include<iterator> #include <set> #include <map> #include <math.h> #include <iomanip> #include <unordered_set> using namespace std; using ll = long long; ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){ ll zero = 0, one = 0; for (int i = 0; i < m; i++){ if (x[i] == 0) zero += w[i]; else one += w[i]; } return max(zero, one); }
#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...