제출 #1002549

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

fish

#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector <vector <pair <int, ll>>> fish;
vector <vector <ll>> pfx;
int n, m;
const int maxn = 1e5 + 5;
ll dp[maxn][10][10];
bool ready[maxn][10][10];
ll cost(int i, int h1, int h2, int h3) {
    if (i-1 <= 0 || max(h1, h3) <= h2 || (int)fish[i-1].size() == 1)
        return 0;
    int mx = max(h1, h3);
    pair <int, ll> tp = {h2, 0};
    int it = lower_bound(fish[i-1].begin(), fish[i-1].end(), tp) - fish[i-1].begin();
    tp.first = mx;
    tp.second = 1e18;
    int it2 = upper_bound(fish[i-1].begin(), fish[i-1].end(), tp) - fish[i-1].begin();
    it2--;
    if (it == 0)
        return pfx[i-1][it2];
    return pfx[i-1][it2] - pfx[i-1][it-1];
}
ll solve(int i, int h1, int h2) {
    if (min(h1, h2) < 0)
        return 0;
    if (i == n+1) {
        return cost(i, h1, h2, 0);
        // return 0;
    }
    if (ready[i][h1][h2])
        return dp[i][h1][h2];
    ll ans = solve(i+1, h2, 0) + cost(i, h1, h2, 0);
    if (i-1 >= 1) {
        for (auto j : fish[i-1]) {
            ans = max(ans, solve(i+1, h2, j.first) + cost(i, h1, h2, j.first));
            ans = max(ans, solve(i+1, h2, j.first-1) + cost(i, h1, h2, j.first-1));
            ans = max(ans, solve(i+1, h2, j.first+1) + cost(i, h1, h2, j.first+1));
        }
    }
    for (auto j : fish[i]) {
        ans = max(ans, solve(i+1, h2, j.first) + cost(i, h1, h2, j.first));
            ans = max(ans, solve(i+1, h2, j.first-1) + cost(i, h1, h2, j.first-1));
            ans = max(ans, solve(i+1, h2, j.first+1) + cost(i, h1, h2, j.first+1));
    }
    if (i+1 <= n) {
        for (auto j : fish[i+1]) {
            ans = max(ans, solve(i+1, h2, j.first) + cost(i, h1, h2, j.first));
            ans = max(ans, solve(i+1, h2, j.first-1) + cost(i, h1, h2, j.first-1));
            ans = max(ans, solve(i+1, h2, j.first+1) + cost(i, h1, h2, j.first+1));
        }
    }
    ready[i][h1][h2] = true;
    dp[i][h1][h2] = ans;
    return ans;
}
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N;
    m = M;
    fish.resize(N+1);
    pfx.resize(N+1);
    for (int i = 0; i < M; i++) {
        fish[X[i] + 1].push_back({Y[i] + 1, W[i]});
    }
    // dp = vector <vector <ll>> (N+1, vector <ll> (N+1, -1));
    for (int i = 1; i <= N; i++) {
        fish[i].push_back({0, 0});
        sort(fish[i].begin(), fish[i].end());
        pfx[i].resize((int)fish[i].size() + 5, 1e18);
        pfx[i][0] = 0;
        for (int j = 1; j < (int)fish[i].size(); j++)
            pfx[i][j] = pfx[i][j-1] + fish[i][j].second;
    }
    return solve(1, 0, 0);
}
// int main() {
//     int nn, mm;
//     cin >> nn >> mm;
//     vector <int> x(mm), y(mm), w(mm);
//     for (int i = 0; i < mm; i++)
//         cin >> x[i] >> y[i] >> w[i];
//     cout << max_weights(nn, mm, x, y, w) << '\n';
// }

• 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