제출 #652685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652685		Lobo	메기 농장 (IOI22_fish)	C++17	14 / 100	411 ms	14268 KiB

fish

#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

const int maxn = 330;
const int maxh = 12;
const int inf = 1e18+10;

int n, m, dp[maxn][maxh][maxh];
vector<pair<int,int>> fish[maxn];

long long max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
    n = N;
    m = M;
    for(int i = 0; i < m; i++) {
        fish[X[i]+1].pb(mp(Y[i]+1,W[i]));
    }

    // dp[i][h1][h] = until i and with h[i-1] = h1 and h[i] = h

    // dp[0][0][0] = 0
    // dp[0][a][b] = -inf
    for(int i = 0; i <= maxh-1; i++) {
        for(int j = 0; j <= maxh-1; j++) {
            dp[0][i][j] = -inf;
        }
    }
    dp[0][0][0] = 0;
    for(int i = 1; i <= n; i++) {
        for(int h1 = 0; h1 <= maxh-1; h1++) {
            for(int h = 0; h <= maxh-1; h++) {
                dp[i][h1][h] = 0;

                int plus10 = 0; // fishs that 1 catchs in 0
                for(auto aux : fish[i]) {
                    int y = aux.fr;
                    int w = aux.sc;
                    if(y > h && y <= h1) plus10+= w;
                }

                for(int h2 = 0; h2 <= maxh-1; h2++) {
                    int plus01 = 0; // fishs that 0 catchs in 1 and had not been caught by 2

                    for(auto aux : fish[i-1]) {
                        int y = aux.fr;
                        int w = aux.sc;
                        if(y > h1 && y <= h && y > h2) plus01+= w;
                    }
                    dp[i][h1][h] = max(dp[i][h1][h],dp[i-1][h2][h1]+plus01 + plus10);
                }
            }
        }
    }

    int ans = 0;
    for(int h = 0; h <= maxh-1; h++) {
        for(int h1 = 0; h1 <= maxh-1; h1++) {
            ans = max(ans,dp[n][h1][h]);
        }
    }
    return ans;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 14 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16