제출 #831461

#제출 시각아이디문제언어결과실행 시간메모리
831461MrDeboo메기 농장 (IOI22_fish)C++17
3 / 100
68 ms71120 KiB
#include "fish.h" #include "bits/stdc++.h" #define int long long using namespace std; int dp[3001][3002]; vector<pair<int,int>>vct[3001]; int slv(int a,int b){ if(dp[a][b]!=-1)return dp[a][b]; int mx=slv(a+1,0); int tot=0; for(auto &i:vct[a]){ if(i.first>b)tot+=i.second; mx=max(slv(a+1,i.first)+tot,mx); } return mx; } long long max_weights(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> y, std::vector<int32_t> w) { if(n>3000){ int g=0; for(auto &i:w)g+=i; return g; } memset(dp,-1,sizeof dp); for(int i=0;i<m;i++){ vct[x[i]].push_back({y[i]+1,w[i]}); } for(int i=0;i<=n;i++)sort(vct[i].begin(),vct[i].end()); return slv(0,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...