제출 #627251

#제출 시각아이디문제언어결과실행 시간메모리
627251coloboxx메기 농장 (IOI22_fish)C++17
9 / 100
32 ms6464 KiB
#include "fish.h" #include <bits/stdc++.h> #define ll long long using namespace std; const int MAXN = 300064; ll a[MAXN], dp[MAXN][2]; ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { for (int i = 0; i < M; ++i) a[X[i] + 1] = W[i]; for (int i = 2; i <= N; ++i) { dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + a[i]); dp[i][1] = dp[i - 1][1]; if (i > 2) dp[i][1] = max({ dp[i][1], dp[i - 2][0] + a[i - 1], dp[i - 2][1] + a[i - 1] }); else dp[i][1] = max(dp[i][1], a[i - 1]); } ll ans = 0; for (int i = 1; i <= N; ++i) ans = max({ ans, dp[i][0], dp[i][1] }); 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...