oj.uz

Submission #1066114

# Submission time Handle Problem Language Result Execution time Memory
1066114 2024-08-19T15:09:52 Z j_vdd16 Catfish Farm (IOI22_fish) C++17
67 / 100
 1000 ms 134348 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

# Verdict Execution time Memory Grader output
1 Correct 130 ms 55168 KB Output is correct
2 Correct 181 ms 63720 KB Output is correct
3 Correct 30 ms 39472 KB Output is correct
4 Correct 28 ms 39468 KB Output is correct
5 Correct 626 ms 131488 KB Output is correct
6 Correct 312 ms 134348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 334 ms 79664 KB Output is correct
3 Correct 442 ms 94288 KB Output is correct
4 Correct 146 ms 55168 KB Output is correct
5 Correct 178 ms 63660 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 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 30 ms 39476 KB Output is correct
11 Correct 28 ms 39476 KB Output is correct
12 Correct 187 ms 60604 KB Output is correct
13 Correct 233 ms 70040 KB Output is correct
14 Correct 158 ms 57908 KB Output is correct
15 Correct 180 ms 64408 KB Output is correct
16 Correct 160 ms 57992 KB Output is correct
17 Correct 179 ms 64152 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 39388 KB Output is correct
2 Correct 27 ms 39548 KB Output is correct
3 Correct 55 ms 49684 KB Output is correct
4 Correct 47 ms 49192 KB Output is correct
5 Correct 84 ms 65300 KB Output is correct
6 Correct 81 ms 64552 KB Output is correct
7 Correct 80 ms 65324 KB Output is correct
8 Correct 88 ms 65324 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 219 ms 12420 KB Output is correct
18 Correct 226 ms 12588 KB Output is correct
19 Correct 138 ms 12368 KB Output is correct
20 Correct 126 ms 12000 KB Output is correct
21 Correct 124 ms 11860 KB Output is correct
22 Correct 441 ms 23380 KB Output is correct
23 Correct 17 ms 3160 KB Output is correct
24 Correct 99 ms 9152 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 14 ms 2908 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 219 ms 12420 KB Output is correct
18 Correct 226 ms 12588 KB Output is correct
19 Correct 138 ms 12368 KB Output is correct
20 Correct 126 ms 12000 KB Output is correct
21 Correct 124 ms 11860 KB Output is correct
22 Correct 441 ms 23380 KB Output is correct
23 Correct 17 ms 3160 KB Output is correct
24 Correct 99 ms 9152 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 14 ms 2908 KB Output is correct
27 Correct 3 ms 2396 KB Output is correct
28 Execution timed out 1085 ms 41280 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 39388 KB Output is correct
2 Correct 27 ms 39548 KB Output is correct
3 Correct 55 ms 49684 KB Output is correct
4 Correct 47 ms 49192 KB Output is correct
5 Correct 84 ms 65300 KB Output is correct
6 Correct 81 ms 64552 KB Output is correct
7 Correct 80 ms 65324 KB Output is correct
8 Correct 88 ms 65324 KB Output is correct
9 Correct 91 ms 71208 KB Output is correct
10 Correct 70 ms 45236 KB Output is correct
11 Correct 146 ms 90424 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 440 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 31 ms 39468 KB Output is correct
19 Correct 33 ms 39524 KB Output is correct
20 Correct 30 ms 39476 KB Output is correct
21 Correct 29 ms 39440 KB Output is correct
22 Correct 119 ms 71512 KB Output is correct
23 Correct 166 ms 99356 KB Output is correct
24 Correct 179 ms 101924 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 55168 KB Output is correct
2 Correct 181 ms 63720 KB Output is correct
3 Correct 30 ms 39472 KB Output is correct
4 Correct 28 ms 39468 KB Output is correct
5 Correct 626 ms 131488 KB Output is correct
6 Correct 312 ms 134348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 334 ms 79664 KB Output is correct
9 Correct 442 ms 94288 KB Output is correct
10 Correct 146 ms 55168 KB Output is correct
11 Correct 178 ms 63660 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 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 30 ms 39476 KB Output is correct
17 Correct 28 ms 39476 KB Output is correct
18 Correct 187 ms 60604 KB Output is correct
19 Correct 233 ms 70040 KB Output is correct
20 Correct 158 ms 57908 KB Output is correct
21 Correct 180 ms 64408 KB Output is correct
22 Correct 160 ms 57992 KB Output is correct
23 Correct 179 ms 64152 KB Output is correct
24 Correct 32 ms 39388 KB Output is correct
25 Correct 27 ms 39548 KB Output is correct
26 Correct 55 ms 49684 KB Output is correct
27 Correct 47 ms 49192 KB Output is correct
28 Correct 84 ms 65300 KB Output is correct
29 Correct 81 ms 64552 KB Output is correct
30 Correct 80 ms 65324 KB Output is correct
31 Correct 88 ms 65324 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 2 ms 1116 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 1 ms 860 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 4 ms 860 KB Output is correct
48 Correct 219 ms 12420 KB Output is correct
49 Correct 226 ms 12588 KB Output is correct
50 Correct 138 ms 12368 KB Output is correct
51 Correct 126 ms 12000 KB Output is correct
52 Correct 124 ms 11860 KB Output is correct
53 Correct 441 ms 23380 KB Output is correct
54 Correct 17 ms 3160 KB Output is correct
55 Correct 99 ms 9152 KB Output is correct
56 Correct 1 ms 860 KB Output is correct
57 Correct 14 ms 2908 KB Output is correct
58 Correct 3 ms 2396 KB Output is correct
59 Execution timed out 1085 ms 41280 KB Time limit exceeded
60 Halted 0 ms 0 KB -