제출 #1261115

#제출 시각아이디문제언어결과실행 시간메모리
1261115rayan_bd메기 농장 (IOI22_fish)C++20
12 / 100
138 ms14420 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; long long dp[(int) 1e5 + 100]; // 0 -> block, 1 -> take the single , 2 -> take two long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { map<int, long long> mp; long long ans = 0; for(int i = 0; i < M; ++i){ mp[X[i] + 1] += W[i]; } dp[2] = max(mp[1], mp[2]); dp[3] = max(mp[1] + mp[3], mp[2]); for(int i = 4; i <= N; ++i){ dp[i] = max(mp[i - 1] + dp[i - 2], mp[i] + mp[i - 2] + dp[i - 3]); if(i > 4){ dp[i] = max(dp[i], mp[i] + mp[i - 3] + dp[i - 4]); } } return dp[N]; }
#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...