제출 #858727

#제출 시각아이디문제언어결과실행 시간메모리
858727imarn메기 농장 (IOI22_fish)C++17
0 / 100
495 ms286296 KiB
#include<bits/stdc++.h> //#include "insects.h" #define f first #define s second #define ll long long #define pb push_back #define pii pair<int,int> #define pll pair<ll,ll> //#define sz(x) (ll)x.size() #define all(x) x.begin(),x.end() using namespace std; ll dp[3001][3001]{0}; ll mp[3001][3001]{0}; ll max_weights(int N, int M,vector<int> X,vector<int> Y,vector<int> W) { for(int i=0;i<M;i++){ mp[Y[i]+1][X[i]+1]+=W[i]; }ll ans=0; for(int i=1;i<=N;i++)for(int j=1;j<=N;j++)mp[i][j]+=mp[i-1][j]; for(int i=1;i<=N;i++){ for(int j=0;j<=N;j++){ dp[j][i]=0; for(int k=0;k<=N;k++){ dp[j][i] = max(dp[k][i-1]+max(mp[j][i-1]-mp[k][i-1],1ll*0),dp[j][i]); }ans=max(ans,dp[i][j]); } } 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...