Submission #720920

#TimeUsernameProblemLanguageResultExecution timeMemory
720920Yell0메기 농장 (IOI22_fish)C++17
0 / 100
29 ms6988 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MN=1e5+2; struct fish{fish(int xi,int yi,int wi):x(xi),y(yi),w(wi){} int x,y,w;}; ll max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W) { ll dp[MN][2][2],w[MN],ans=0; for(int i=0;i<M;++i) w[X[i]+1]=W[i]; for(int i=1;i<=N;++i) { dp[i][0][0]=max(dp[i-1][0][0],dp[i-1][1][0]); dp[i][0][1]=max(dp[i-1][0][0],dp[i-1][1][0])+w[i+1]; dp[i][1][1]=max(dp[i-1][0][1],dp[i-1][1][1])-(i>1?w[i]:0)+w[i+1]; dp[i][1][0]=max(dp[i-1][0][1],dp[i-1][1][1]); ans=max({ans,dp[i][0][0],dp[i][0][1],dp[i][1][1],dp[i][1][0]}); } 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...