Submission #1054974

#	Time	Username	Problem	Language	Result	Execution time	Memory
1054974		vjudge1	Catfish Farm (IOI22_fish)	C++17	12 / 100	49 ms	20328 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;

ll max_weights(int n, int m, vi X, vi Y, vi W) {
    vll S(n + 1, 0);
    for(int i = 0; i < m; ++i) {
        S[X[i]] += W[i];
    }
    vector<vll> DP(n + 1, vll(3, 0));
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < 2; ++j) {
            DP[i + 1][j + 1] = max(DP[i + 1][j + 1], DP[i][j]); /// nu fac nimic
        }
        ///ult pier la i - 1 - j, acum construim la i => distanta 1 + j
        DP[i + 1][0] = max(DP[i + 1][0], DP[i][0] - S[i] + S[i + 1]);     
        DP[i + 1][0] = max(DP[i + 1][0], DP[i][1] + S[i + 1]);     
        ll uv = S[i + 1];
        if(i) uv += S[i - 1];
        DP[i + 1][0] = max(DP[i + 1][0], DP[i][2] + uv);     
    }
    ll re = 0;
    for(auto it : DP[n]) re = max(re, it);
    return re;
}

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