제출 #1199974

#제출 시각아이디문제언어결과실행 시간메모리
1199974fadyscubeCatfish Farm (IOI22_fish)C++17
0 / 100
30 ms9284 KiB
#include "fish.h" #include <vector> #include <algorithm> using namespace std; #define ll long long long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { vector<vector<ll>> dp(N, vector<ll>(2, 0)); vector<int> v(N, 0); for (int i = 0; i < M; i++) v[X[i]] = W[i]; dp[0][0] = v[0]; dp[0][1] = 0; for (int i = 1; i < N; i++) { dp[i][1] = max(dp[i-1][0] + v[i-1], dp[i-1][1]); dp[i][0] = max(dp[i-1][0], dp[i-1][1] + W[i]); } return max(dp[N-1][1], dp[N-1][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...