제출 #1123294

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123294		sunboi	메기 농장 (IOI22_fish)	C++20	0 / 100	1175 ms	1736088 KiB

fish

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

using namespace std;

long long max_weights(int N, int M, vector<int> X, vector<int> Y,
                      vector<int> W) {
    /*vector<pair<int, int>> a(M);
    for (int i = 0; i < M; i++){
        a[i] = {X[i], Y[i]};
    }*/
    vector<vector<int>> pref(N, vector<int> (N + 1));
    for (int i = 0; i < M; i++){
        pref[X[i]][Y[i]] += W[i];  
    }
    for (int i = 0; i < N; i++){
        for (int j = 1; j <= N; j++){
            pref[i][j] += pref[i][j - 1];
        }
    }
    vector<vector<int>> dp(N, vector<int> (N + 1));
    int ans = 0;
    for (int i = 1; i < N; i++){
        for (int prev = 0; prev <= N; prev++){
            for (int j = 0; j <= N; j++){
                int cogemos = 0;
                if (prev > j){
                    cogemos = pref[i][prev] - pref[i][j];
                }else{
                    cogemos = pref[i - 1][j] - pref[i][prev];
                }
                dp[i][j] = max(dp[i][j], dp[i - 1][prev] + cogemos);
            }
        }
    }
    for (int i = 0; i <= N; i++) ans = max(ans, dp[N - 1][i]);
    
    return ans;
    
}

• 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