제출 #1032940

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1032940		Mr_Husanboy	메기 농장 (IOI22_fish)	C++17	0 / 100	843 ms	2097152 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long
 
template<typename T>
int len(T &a){
    return a.size();
}
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
 
long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y,
                      std::vector<int> w) {
    vector<vector<ll>> s(n + 1, vector<ll> (n + 1));
 
    for(int i = 0; i < m; i ++) s[x[i] + 1][y[i] + 1] = w[i];
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) s[i][j] += s[i][j - 1];
 
    vector<vector<array<ll, 2>>> dp(n + 1, vector<array<ll, 2>>(n + 1));
    for(int j = 0; j <= n; j ++){
        dp[2][j][0] = dp[2][j][1] = s[1][j];
    }
    
    for(int i = 2; i <= n; i ++){
        for(int j = 0; j <= n; j ++){
            if(i > 2)
            for(int k = 0; k <= n; k ++){
                dp[i][j][0] = max(dp[i][j][0], max(dp[i - 2][j][0], dp[i - 2][j][1]) + s[i - 1][max(j, k)]);
            }
            dp[i][j][1] = dp[i][j][0];
            //cout << dp[i][j][0] << endl;
            for(int k = 0; k <= j; k ++){
                dp[i][j][0] = max(dp[i][j][0], dp[i - 1][k][0] + s[i - 1][j] - s[i - 1][k]);
            }
            for(int k = j; k <= n; k ++){
                dp[i][j][1] = max(dp[i][j][1], max(dp[i - 1][k][1], dp[i - 1][k][0]) + s[i][k] - s[i][j]);
            }
            //cout << i << ' ' << j << ' ' << dp[i][j][1] << endl;
        }
    }
    ll ans = 0;
    for(int i = 0; i <= n; i ++){
        ans = max({ans, dp[n][i][0], dp[n][i][1]});
        //cout << dp[n][i][0] << ' ' << dp[n][i][1] << endl;
    }
 
    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