Submission #628112

#	Time	Username	Problem	Language	Result	Execution time	Memory
628112		TheQuantiX	Catfish Farm (IOI22_fish)	C++17	3 / 100	84 ms	8820 KiB

fish

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

ll n, m, x, y, k;

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> k) {
    vector<ll> v(n);
    for (int i = 0; i < m; i++) {
        v[x[i]] += k[i];
    }
    vector<ll> dp(n + 1);
    for (int i = 1; i <= n; i++) {
        dp[i] = v[i - 1];
        if (i >= 2) {
            dp[i] = max(dp[i], dp[i - 2] + v[i - 1]);
        }
        if (i >= 3) {
            dp[i] = max(dp[i], dp[i - 3] + v[i - 1]);
        }
//        cout << dp[i] << '\n';
    }
    return *max_element(dp.begin(), dp.end());
}

//void solve() {
//    cin >> n >> m;
//    vector<int> x(m);
//    vector<int> y(m);
//    vector<int> k(m);
//    for (int i = 0; i < m; i++) {
//        cin >> x[i] >> y[i] >> k[i];
//    }
//    cout << max_weights(n, m, x, y, k) << '\n';
//}
//
//int main() {
//    ios_base::sync_with_stdio(0);
//    cin.tie(0);
//    cout.tie(0);
//    solve();
//}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16