제출 #836126

#제출 시각아이디문제언어결과실행 시간메모리
836126ma_moutahid메기 농장 (IOI22_fish)C++17
0 / 100
23 ms9192 KiB
#include "fish.h" #include <vector> #include <bits/stdc++.h> using namespace std; #define vi vector<int> #define vii vector<vi> #define vl vector<long long> #define vll vector<vl> long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { vl v(N); for(int i=0;i<M;i++){ v[X[i]]=W[i]; } int n=N; vll dp(n,vl(4)); dp[n-2][1]=v[n-1]; for(int i=n-3;i>=0;i--){ dp[i][0]=max(dp[i+1][0],dp[i+1][2]); dp[i][1]=max(dp[i+1][0],dp[i+1][2]+v[i+1]); dp[i][2]=dp[i][3]=max(dp[i+1][1],dp[i+1][3]); } dp[0][2]+=v[0]; return max(dp[0][0],max(dp[0][1],dp[0][2])); }
#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...