제출 #1221436

#제출 시각아이디문제언어결과실행 시간메모리
1221436totoro메기 농장 (IOI22_fish)C++20
0 / 100
13 ms3648 KiB
#include <algorithm> #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::vector<long long> vals(N); for (int i = 0; i < M; ++i) vals[X[i]] = W[i]; std::vector<long long> dp(N + 1); dp[1] = vals[0]; for (int i = 2; i <= N; ++i) { dp[i] = std::max(dp[i - 1], vals[i - 1] + dp[i - 2]); } return dp[N]; }
#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...