제출 #1234818

#제출 시각아이디문제언어결과실행 시간메모리
1234818mariza메기 농장 (IOI22_fish)C++20
12 / 100
53 ms8776 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const ll N=1e5; #define MID ((l+r)/2) long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){ ll a[n]={}; for(ll i=0; i<m; i++){ a[x[i]]+=w[i]; } ll ans[n+2]; ans[n]=0; ans[n+1]=0; for(ll i=n-1; i>=0; i--){ ans[i]=ans[i+1]; if(i<n-1) ans[i]=max(ans[i],max(a[i+1]+ans[i+2],a[i]+ans[i+2])); if(i<n-2) ans[i]=max(ans[i],a[i]+a[i+2]+ans[i+3]); } return ans[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...