oj.uz

답안 #1066101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066101 2024-08-19T15:03:52 Z j_vdd16 메기 농장 (IOI22_fish) C++17
18 / 100
 654 ms 134880 KB 
#include "fish.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define ll long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

vector<vector<pair<int, ll>>> fishes;
vector<map<int, ll>> prefixWeight;
vector<ll> totals;

inline ll weightSum(int x, int y1, int y2) {
    if (x >= fishes.size() || y2 <= y1)
        return 0;

    auto it1 = prefixWeight[x].upper_bound(y2 - 1);
    auto it2 = prefixWeight[x].upper_bound(y1 - 1);
    ll res = (--it1)->second - (--it2)->second;
    //cout << x << ' ' << y1 << ' ' << y2 << " = " << res << endl;
    return res;
}

long long max_weights(signed N, signed M, vector<signed> X, std::vector<signed> Y, std::vector<signed> W) {
    fishes = vector<vector<pair<int, ll>>>(N);
    loop(i, M) {
        fishes[X[i]].push_back({Y[i], W[i]});
    }
    fishes.push_back({});

    prefixWeight = vector<map<int, ll>>(N + 1);
    totals = vector<ll>(N + 1);
    loop(x, N + 1) {
        sort(all(fishes[x]));

        ll total = 0;
        prefixWeight[x][-2] = 0;
        for (auto [y, w] : fishes[x]) {
            total += w;

            prefixWeight[x][y] = total;
        }

        totals[x] = total;
    }

    vector<map<int, ll>> beforeDp(N);
    vector<map<int, ll>> bothDp(N);

    vector<ll> maxBefore(N);
    vector<ll> maxBoth(N);
    vector<ll> maxBeforeMinCur(N), maxBeforeMinNext(N);

    //bestBefore, bestBeforeAndAfter
    int counter = 0;
    loop(x, N) {
        if (x == 0) {
            for (const auto& [y, w] : fishes[x + 1]) {
                int height = y + 1;
                bothDp[0][height] = weightSum(x + 1, 0, height);
                maxBoth[x] = max(maxBoth[x], bothDp[0][height]);

                maxBeforeMinCur[x] = max(maxBeforeMinCur[x], 0 - weightSum(x, 0, height));
                maxBeforeMinNext[x] = max(maxBeforeMinNext[x], 0 - weightSum(x + 1, 0, height));
            }

            beforeDp[0][0] = 0;
            maxBefore[0] = 0;

            continue;
        }

        ll bestBefore2 = 0;
        if (x >= 2) {
            bestBefore2 = maxBefore[x - 2];
        }
        if (x >= 3) {
            bestBefore2 = max(bestBefore2, maxBoth[x - 3]);
        }

        for (const auto& [y, w] : fishes.at(x - 1)) {
            int height = y + 1;
            ll& both = bothDp[x][height];
            ll& before = beforeDp[x][height];

            both = maxBeforeMinCur[x - 1] + weightSum(x - 1, 0, height);
            before = maxBeforeMinCur[x - 1] + weightSum(x - 1, 0, height);

            // for (const auto& [prevHeight, prevScore] : beforeDp.at(x - 1)) {
            //     counter++;
            //     //ll prevCur = weightSum(x - 1, prevHeight, height);
            //     ll prevCur = -weightSum(x - 1, 0, prevHeight);

            //     both = max(both, prevScore + prevCur);
            //     before = max(before, prevScore + prevCur);
            // }
            // both += weightSum(x - 1, 0, height);
            // before += weightSum(x - 1, 0, height);

            both = max(both, maxBeforeMinNext[x]);
            // for (const auto& [prevY, prevScore] : bothDp.at(x - 1)) {
            //     counter++;
            //     if (prevY <= height) 
            //         continue;

            //     ll prevCur = -weightSum(x, 0, height);
            //     both = max(both, prevScore + prevCur);
            // }

            ll prevWeight = weightSum(x - 1, 0, height);
            both = max(both, bestBefore2 + prevWeight);

            before = max(before, bestBefore2 + prevWeight);
            
            maxBefore[x] = max(maxBefore[x], before);
            maxBeforeMinCur[x] = max(maxBeforeMinCur[x], before - weightSum(x, 0, height));
            maxBeforeMinNext[x] = max(maxBeforeMinNext[x], before - weightSum(x + 1, 0, height));
        }
        for (const auto& [y, w] : fishes.at(x + 1)) {
            int height = y + 1;
            ll& both = bothDp[x][height];

            both = max(both, maxBeforeMinCur[x - 1] + weightSum(x - 1, 0, height));
            both = max(both, maxBeforeMinNext[x]);
            // for (const auto& [prevHeight, prevScore] : beforeDp.at(x - 1)) {
            //     counter++;
            //     ll prevCur = weightSum(x - 1, prevHeight, height);

            //     both = max(both, prevScore + prevCur);
            // }
            // for (const auto& [prevY, prevScore] : bothDp.at(x - 1)) {
            //     counter++;
            //     if (prevY <= height) 
            //         continue;

            //     ll prevCur = -weightSum(x, 0, height);
            //     both = max(both, prevScore + prevCur);
            // }

            ll prevWeight = weightSum(x - 1, 0, height);
            both = max(both, bestBefore2 + prevWeight);
        }

        for (const auto& [height, score] : bothDp.at(x)) {
            counter++;
            ll nextWeight = weightSum(x + 1, 0, height);
            bothDp[x][height] += nextWeight;
            
            maxBoth[x] = max(maxBoth[x], bothDp[x][height]);
        }

        ll& both = bothDp[x][0];
        ll& before = beforeDp[x][0];

        both = max({ both, maxBefore[x - 1], bestBefore2 });
        before = max(before, both);

        maxBefore[x] = max(maxBefore[x], before);
        maxBoth[x] = max(maxBoth[x], both);

        maxBeforeMinCur[x] = max(maxBeforeMinCur[x], before);
        maxBeforeMinNext[x] = max(maxBeforeMinNext[x], before);
    }

    //cout << "Counter: " << counter << endl;

    ll res = 0;
    loop(x, N) {
        for (auto [y, score] : beforeDp[x]) {
            res = max(res, score);
        }
        for (auto [y, score] : bothDp[x]) {
            res = max(res, score);
        }
    }

    return res;
}

Compilation message

fish.cpp: In function 'long long int weightSum(int, int, int)':
fish.cpp:38:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     if (x >= fishes.size() || y2 <= y1)
      |         ~~^~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 55164 KB Output is correct
2 Correct 183 ms 64004 KB Output is correct
3 Correct 29 ms 39472 KB Output is correct
4 Correct 26 ms 39380 KB Output is correct
5 Correct 654 ms 131960 KB Output is correct
6 Correct 307 ms 134880 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 331 ms 80292 KB Output is correct
3 Correct 426 ms 94084 KB Output is correct
4 Correct 159 ms 55256 KB Output is correct
5 Correct 171 ms 63724 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 44 ms 39536 KB Output is correct
11 Correct 48 ms 39720 KB Output is correct
12 Correct 190 ms 60488 KB Output is correct
13 Correct 240 ms 70036 KB Output is correct
14 Correct 163 ms 57760 KB Output is correct
15 Correct 219 ms 64264 KB Output is correct
16 Correct 153 ms 57988 KB Output is correct
17 Correct 169 ms 64148 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 39472 KB Output is correct
2 Correct 30 ms 39464 KB Output is correct
3 Correct 58 ms 49764 KB Output is correct
4 Correct 66 ms 49192 KB Output is correct
5 Correct 96 ms 65164 KB Output is correct
6 Correct 97 ms 64804 KB Output is correct
7 Correct 100 ms 65296 KB Output is correct
8 Correct 147 ms 65324 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 39472 KB Output is correct
2 Correct 30 ms 39464 KB Output is correct
3 Correct 58 ms 49764 KB Output is correct
4 Correct 66 ms 49192 KB Output is correct
5 Correct 96 ms 65164 KB Output is correct
6 Correct 97 ms 64804 KB Output is correct
7 Correct 100 ms 65296 KB Output is correct
8 Correct 147 ms 65324 KB Output is correct
9 Correct 113 ms 70952 KB Output is correct
10 Incorrect 107 ms 44904 KB 1st lines differ - on the 1st token, expected: '36454348383152', found: '36364983059693'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 135 ms 55164 KB Output is correct
2 Correct 183 ms 64004 KB Output is correct
3 Correct 29 ms 39472 KB Output is correct
4 Correct 26 ms 39380 KB Output is correct
5 Correct 654 ms 131960 KB Output is correct
6 Correct 307 ms 134880 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 331 ms 80292 KB Output is correct
9 Correct 426 ms 94084 KB Output is correct
10 Correct 159 ms 55256 KB Output is correct
11 Correct 171 ms 63724 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 44 ms 39536 KB Output is correct
17 Correct 48 ms 39720 KB Output is correct
18 Correct 190 ms 60488 KB Output is correct
19 Correct 240 ms 70036 KB Output is correct
20 Correct 163 ms 57760 KB Output is correct
21 Correct 219 ms 64264 KB Output is correct
22 Correct 153 ms 57988 KB Output is correct
23 Correct 169 ms 64148 KB Output is correct
24 Correct 25 ms 39472 KB Output is correct
25 Correct 30 ms 39464 KB Output is correct
26 Correct 58 ms 49764 KB Output is correct
27 Correct 66 ms 49192 KB Output is correct
28 Correct 96 ms 65164 KB Output is correct
29 Correct 97 ms 64804 KB Output is correct
30 Correct 100 ms 65296 KB Output is correct
31 Correct 147 ms 65324 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
40 Halted 0 ms 0 KB -