제출 #1221441

#제출 시각아이디문제언어결과실행 시간메모리
1221441totoro메기 농장 (IOI22_fish)C++20
0 / 100
48 ms7496 KiB
#include <algorithm> #include <array> #include <cassert> #include <map> #include <numeric> #include <vector> #include "fish.h" long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { std::map<int, long long> sums; long long ans = 0; for (int i = 0; i < M; ++i) assert(0 <= X[i] && X[i] <= 1), sums[X[i]] += W[i], ans = std::max(ans, sums[X[i]]); 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...