Submission #661002

#	Time	Username	Problem	Language	Result	Execution time	Memory
661002		mychecksedad	Catfish Farm (IOI22_fish)	C++17	9 / 100	201 ms	23780 KiB

fish

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
const int S = 1e5 + 100;


ll dp[S][15], a[S][2], s[S], pref[S][15];
long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w){  
    bool case1 = 1, case2 = 1;
    for(int i = 0; i < m; ++i){
        if(x[i] % 2) case1 = 0;
        if(x[i] > 1) case2 = 0;
    }
    if(case1){
        ll ans = 0;
        for(int i = 0; i < m; ++i) ans += w[i];
        return ans;
    }
    if(case2){
        ll ans1 = 0, ans2 = 0;

        for(int i = 0; i < m; ++i){
            if(x[i] == 0) ans1 += w[i];
            else ans2 += w[i];
        }
        if(n == 2)
            return max(ans1, ans2);
        else{
            ll best = 0, sum = 0;
            int p = 0;
            for(int i = 0; i <= n + 1; ++i) a[i][0] = a[i][1] = s[i] = 0;
            for(int i = 0; i < m; i++) if(x[i] == 0) a[y[i]][0] = w[i]; else a[y[i]][1] = w[i];

            for(int i = n; i >= 0; --i) s[i] = s[i + 1] + a[i][1];

            for(int i = 0; i <= n + 1; ++i){
                best = max(best, s[i] + sum);
                sum += a[i][0];
            }

            return best;
        }
    }
    for(int i = 0; i <= n; ++i){
        for(int j = 0; j < 15; ++j) pref[i][j] = dp[i][j] = 0;
    }
    for(int i = 0; i < m; ++i) pref[x[i]][y[i] + 1] = w[i];

    for(int i = 0; i <= n; ++i){
        for(int j = 1; j < 15; ++j) pref[i][j] += pref[i][j - 1];
    }
    for(int i = 1; i <= n; ++i){
        for(int j = 0; j < 10; ++j){
            for(int k = 0; k < 10; ++k){
                ll val;

                if(i == 1){
                    val = (j >= k ? pref[i - 1][j] - pref[i - 1][k] : pref[i][k] - pref[i][j]);
                    dp[i][j] = max(dp[i][j], dp[i - 1][k] + val);
                }else{
                    for(int l = 0; l < 10; ++l){
                        if(k >= j){
                            val = pref[i][k] - pref[i][j];
                            dp[i][j] = max(dp[i][j], dp[i - 1][k] + val);
                        }else{
                            if(l <= k){
                                val = pref[i - 1][j] - pref[i - 1][k] + pref[i - 2][k] - pref[i - 2][l];
                                dp[i][j] = max(dp[i][j], dp[i - 2][l] + val);
                            }else{
                                val = pref[i - 1][max(j, l)] - pref[i - 1][k];
                                dp[i][j] = max(dp[i][j], dp[i - 2][l] + val);
                            }
                        }
                    }
                }
                if(i >= 2){
                    val = pref[i - 1][max(j, k)];
                    dp[i][j] = max(dp[i][j], dp[i - 2][k] + val);
                }
                if(i >= 3){
                    val = pref[i - 1][j] + pref[i - 2][k];
                    dp[i][j] = max(dp[i][j], dp[i - 3][k] + val);
                }
            }
        }
    }
    return dp[n][0];
}   

Compilation message (stderr)

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:31:17: warning: unused variable 'p' [-Wunused-variable]
   31 |             int p = 0;
      |                 ^

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