Submission #931172

#	Time	Username	Problem	Language	Result	Execution time	Memory
931172		VMaksimoski008	Catfish Farm (IOI22_fish)	C++17	18 / 100	63 ms	7272 KiB

fish

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;
using ll = long long;

int64_t max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    bool even = true, sub2 = true, sub3 = true;

    for(int i=0; i<m; i++) {
        if(x[i] % 2 == 1) even = false;
        if(x[i] > 1) sub2 = false;
        if(y[i] > 0) sub3 = false;
    }

    if(even) {
        ll ans = 0;
        for(int &x : w) ans += x;
        return ans;
    }

    if(sub2) {
        ll ans = 0, pref[n][2];

        memset(pref, 0, sizeof(pref));
        for(int i=0; i<m; i++)
            pref[y[i]][x[i]] += w[i];

        for(int i=1; i<n; i++) {
            pref[i][0] += pref[i-1][0];
            pref[i][1] += pref[i-1][1];
        }

        if(n == 2) return max(pref[n-1][0], pref[n-1][1]);

        for(int i=0; i<n; i++)
            ans = max(ans, pref[i][0] + pref[n-1][1] - pref[i][1]);
        return max({ ans, pref[n-1][0], pref[n-1][1] });
    }

    if(sub3) {
        vector<int> v(n, 0);
        vector<ll> dp(n, 0);
        vector<ll> mx(n, 0);

        for(int i=0; i<m; i++)
            v[x[i]] = w[i];

        dp[0] = (n > 1 ? v[1] : 0);
        mx[0] = dp[0];
        for(int i=1; i<n; i++) {
            ll res1 = dp[i-1] - v[i];
            if(i < n-1) res1 += v[i+1];

            ll res2 = (i > 1 ? dp[i-2] : 0);
            if(i < n-1) res2 += v[i+1];

            ll res3 = (i > 2 ? mx[i-3] : 0);
            res3 += v[i-1];
            if(i < n-1) res3 += v[i+1];

            dp[i] = max({ dp[i], res1, res2, res3 });
            mx[i] = max(mx[i-1], dp[i]);
        }

        return *max_element(all(mx));
    }

    return 0;
}

// int32_t main() {
//     setIO();

//     int n, m;
//     cin >> n >> m;

//     vector<int> x(m), y(m), w(m);
//     for(int i=0; i<m; i++)
//         cin >> x[i] >> y[i] >> w[i];
    
//     cout << max_weights(n, m, x, y, w) << '\n';
//     return 0;
// }

• Subtask 1: 3 / 3
• Subtask 2: 6 / 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