Submission #625798

#	Time	Username	Problem	Language	Result	Execution time	Memory
625798		Hazem	Catfish Farm (IOI22_fish)	C++17	3 / 100	1074 ms	46468 KiB

fish

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

using namespace std;

#ifdef B01
#include "deb.h"
#else
#define deb(...)
#endif

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    vector<vector<pair<int, int>>> g(n);
    vector<vector<long long>> L(n);
    vector<vector<long long>> R(n);
    vector<vector<long long>> in(n);
    vector<vector<long long>> dp(n);
    for (int i = 0; i < m; i++) {
        g[x[i]].emplace_back(y[i], w[i]);
    }
    for (int i = 0; i < n; i++) {
        sort(g[i].begin(), g[i].end());
        g[i].emplace_back(n, 0);
        int z = g[i].size();
        dp[i].resize(z);
        L[i].resize(z);
        R[i].resize(z);
        in[i].resize(z);
        for (int j = 0; j < z - 1; j++) {
            in[i][j + 1] = in[i][j] + g[i][j].second;
        }
    }
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        long long ls = 0, rs = 0;
        int l = 0, r = 0;
        for (int j = 0; j < (int) dp[i].size(); j++) {
            if (i > 0) {
                while (l < (int) g[i - 1].size() && g[i - 1][l].first < g[i][j].first) {
                    ls += g[i - 1][l++].second;
                }
            }
            if (i + 1 < n) {
                while (r < (int) g[i + 1].size() && g[i + 1][r].first < g[i][j].first) {
                    rs += g[i + 1][r++].second;
                }
            }
            L[i][j] = ls;
            R[i][j] = rs;
            ans = max(ans, max(ls, rs));
        }
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < (int) dp[i].size(); j++) {
            for (int k = 0; k < (int) dp[i - 1].size(); k++) {
                if (g[i - 1][k].first < g[i][j].first) {
                    dp[i][j] = max(dp[i][j], dp[i - 1][k] - in[i - 1][k]);
                } else {
                    dp[i][j] = max(dp[i][j], dp[i - 1][k] - L[i][j]);
                }
            }
            dp[i][j] += L[i][j];
            ans = max(ans, dp[i][j] + R[i][j]);
        }
    }
    return ans;
}

• 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