Submission #824890

#	Time	Username	Problem	Language	Result	Execution time	Memory
824890		PixelCat	Catfish Farm (IOI22_fish)	C++17	0 / 100	46 ms	9632 KiB

fish

#include "fish.h"

#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second 
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

inline void chmax(int &x, int val) { x = max(x, val); }

const int MAXN = 300;

int n, m;
int pre[MAXN + 10][MAXN + 10];
int dp[MAXN + 10][MAXN + 10][2];

int sum(int x, int u, int d) {
    if(u < d) return 0;
    int res = pre[x][u];
    if(d) res -= pre[x][d - 1];
    return res;
}

long long max_weights(i32 N, i32 M, vector<i32> X, vector<i32> Y,
                      vector<i32> W) {
    n = N;
    m = M;

    memset(pre, 0, sizeof(pre));
    For(i, 0, m - 1) {
        pre[X[i]][Y[i]] += W[i];
    }
    For(i, 0, n - 1) For(j, 1, n - 1) {
        pre[i][j] += pre[i][j - 1];
    }

    For(i, 0, n - 2) For(j, 0, n) {
        // column i selected
        chmax(dp[i + 1][j][0], dp[i][j][1] + sum(i + 1, j - 1, 0));
        For(j2, 1, n) {
            chmax(dp[i + 1][j2][1], dp[i][j][1] + sum(i, j2 - 1, j));
        }
        // column i not selected
        chmax(dp[i + 1][0][0], dp[i][j][0]);
        For(j2, 1, n) {
            chmax(dp[i + 1][j2][1], dp[i][j][0] + sum(i, j2 - 1, j));
        }
    }
    int ans = 0;
    For(j, 0, n) For(k, 0, 1) chmax(ans, dp[n - 1][j][k]);
    return ans;
}

/*

5 4
0 2 5
1 1 2
4 4 1
3 3 3

8

*/

• Subtask 1: 0 / 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