제출 #1223454

#제출 시각아이디문제언어결과실행 시간메모리
1223454trimkusCatfish Farm (IOI22_fish)C++20
3 / 100
54 ms9800 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { vector<ll> dp1(N), dp2(N); vector<ll> c(N); for (int i = 0; i < M; ++i) { c[X[i]] += W[i]; } dp1[0] = 0; dp2[0] = c[0]; for (int i = 1; i < N; ++i) { dp2[i] = max(dp2[i], dp1[i - 1] + c[i]); dp1[i] = max(dp1[i], dp2[i - 1]); } return max(dp1[N - 1], dp2[N - 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...