제출 #629372

#제출 시각아이디문제언어결과실행 시간메모리
629372DarkMatter메기 농장 (IOI22_fish)C++17
3 / 100
90 ms8816 KiB
#include<bits/stdc++.h> #include "fish.h" #include <vector> using namespace std; typedef long long ll; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { vector<ll>sum(N, 0), dp(N, 0); for (int i = 0; i < M; i++) sum[X[i]] += W[i]; dp[N - 1] = sum[N - 1]; for (int i = N - 2; i >= 0; i--) { if (!sum[i]) dp[i] = dp[i + 1]; else { if (!sum[i + 1]) dp[i] = sum[i] + dp[i + 1]; else { int val = 0; if (i != N - 2) val = dp[i + 2]; dp[i] = max(dp[i + 1], (sum[i] + val)); } } } return dp[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...