Submission #1216215

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216215		vanea	Catfish Farm (IOI22_fish)	C++20	3 / 100	48 ms	7240 KiB

fish

#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
using ll = long long;

int n, m;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N; m = M;
    bool f = true, s = true, t = true;
    for(int i = 0; i < m; i++) {
        if(X[i] & 1) f = false;
        if(X[i] > 1) s = false;
        if(Y[i] != 0) t = false;
    }
    if(f) {
        ll ans = 0;
        for(int i = 0; i < m; i++) ans += W[i];
        return ans;
    }
    if(s) {
        ll f1 = 0, s1 = 0;
        vector<ll> pref(n+1);
        for(int i = 0; i < m; i++) {
            if(X[i] == 0) f1 += W[i];
            else s1 += W[i];
        }
        for(int i = 0; i < m; i++) {
            if(X[i] == 0) {
                pref[Y[i]] += W[i];
            }
        }
        for(int i = 1; i <= n; i++) pref[i] += pref[i-1];
        ll curr = s1; ll ans = s1;
        for(int i = 0; i < m; i++) {
            if(X[i] == 1) {
                ans = max(ans, curr+pref[Y[i]-1]);
                curr -= W[i];
                ans = max(ans, curr+pref[Y[i]]);
            }
        }
        return max(ans, f1);
    }
    if(t) {
        vector<array<ll, 2>> dp(m, {0, 0});
        dp[0][0] = W[0];
        for(int i = 1; i < m; i++) {
            dp[i][0] = max(dp[i-1][0], dp[i-1][1] + W[i]);
            dp[i][1] = W[i-1];
            if(i >= 2) {
                dp[i][1] = max({dp[i][1], dp[i-2][0]+W[i-1], dp[i-2][1]+W[i-1]});
            }
        }
        return max(dp[m-1][0], dp[m-1][1]);
    }

}

Compilation message (stderr)

fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
   57 | }
      | ^

• 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