제출 #633282

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