제출 #627431

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
627431		imeimi2000	메기 농장 (IOI22_fish)	C++17	9 / 100	298 ms	18168 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int n;
vector<pii> P[100005];

struct segtree {
    ll seg[1 << 18];
    void init() {
        memset(seg, 0xcf, sizeof(seg));
    }
    void update(int i, int s, int e, int x, int y, ll v) {
        if (e < x || y < s) return;
        if (x <= s && e <= y) {
            seg[i] = max(seg[i], v);
            return;
        }
        int m = (s + e) / 2;
        update(i + i, s, m, x, y, v);
        update(i + i + 1, m + 1, e, x, y, v);
    }
    ll query(int i, int s, int e, int x) {
        if (s == e) return seg[i];
        int m = (s + e) / 2;
        if (x <= m) return max(seg[i], query(i + i, s, m, x));
        return max(seg[i], query(i + i + 1, m + 1, e, x));
    }
} up, dn;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N;
    for (int i = 0; i < M; ++i) {
        P[X[i] + 1].emplace_back(Y[i] + 1, W[i]);
    }
    ll p = 0;
    dn.init();
    for (int i = 1; i <= n; ++i) {
        sort(P[i].begin(), P[i].end());
        for (auto [j, v] : P[i]) {
            up.update(1, 0, n + 1, j + 1, n + 1, up.query(1, 0, n + 1, j) + v);
        }
        reverse(P[i].begin(), P[i].end());
        for (auto [j, v] : P[i]) {
            dn.update(1, 0, n + 1, 0, j - 1, dn.query(1, 0, n + 1, j) + v);
        }
        ll nxt = up.query(1, 0, n + 1, n + 1);
        up.update(1, 0, n + 1, 0, n + 1, dn.query(1, 0, n + 1, 0));
        dn.update(1, 0, n + 1, 0, n + 1, p);
        p = nxt;
    }
    return dn.query(1, 0, n + 1, 0);
}

• Subtask 1: 3 / 3
• Subtask 2: 6 / 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