제출 #1234684

#제출 시각아이디문제언어결과실행 시간메모리
1234684MuhammadSaramCatfish Farm (IOI22_fish)C++20
9 / 100
18 ms4680 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; #define ll long long long long max_weights(int n, int m, vector<int> x, vector<int> y,vector<int> w) { int a[n]={}; for (int i=0;i<m;i++) a[x[i]]=w[i]; ll dp[n][2]={}; dp[1][0]=a[1]; dp[1][1]=a[0]; for (int i=2;i<n;i++) { dp[i][0]=max(dp[i-1][0],dp[i-1][1]+a[i]); dp[i][1]=max(max(dp[i-1][0],dp[i-1][1]),dp[i-2][0]+a[i-1]); } return max(dp[n-1][0],dp[n-1][1]); }
#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...