oj.uz

Submission #678798

# Submission time Handle Problem Language Result Execution time Memory
678798 2023-01-06T15:16:01 Z pls33 Catfish Farm (IOI22_fish) C++17
23 / 100
 1000 ms 2097152 KB 
#include <bits/stdc++.h>

#ifndef _AAAAAAAAA
#include "fish.h"
#endif

using namespace std;
#pragma region dalykai
using p32 = pair<int, int>;
using p32u = pair<uint32_t, uint32_t>;
using p64 = pair<int64_t, int64_t>;
using p64u = pair<uint64_t, uint64_t>;
using vi16 = vector<int16_t>;
using vi16u = vector<uint16_t>;
using vi32 = vector<int>;
using vi32u = vector<uint32_t>;
using vi64 = vector<int64_t>;
using vi64u = vector<uint64_t>;
using vp32 = vector<p32>;
using vp32u = vector<p32u>;
using vp64 = vector<p64>;
using vp64u = vector<p64u>;
using vvi32 = vector<vi32>;
using vvi32u = vector<vi32u>;
using vvi64 = vector<vi64>;
using vvi64u = vector<vi64u>;
using vvp32 = vector<vp32>;
using vvp32u = vector<vp32u>;
using vvp64 = vector<vp64>;
using vvp64u = vector<vp64u>;
#pragma endregion

using map_t = unordered_map<int64_t, int64_t>;

struct node_t
{
    int64_t val;
    p32 range;
    node_t *left, *right;

    node_t(p32 r)
    {
        val = 0;
        range = r;
        left = nullptr;
        right = nullptr;
    }

    void update()
    {
        if (!right || range.second - range.first == 1)
        {
            return;
        }

        val = max(left->val, right->val);
    }

    void expand()
    {
        if (range.second - range.first == 1 || right)
        {
            return;
        }

        int mid = (range.first + range.second) / 2;
        left = new node_t({range.first, mid});
        right = new node_t({mid, range.second});
    }

    int contains(p32 query)
    {
        if (query.first >= range.second || query.second <= range.first)
        {
            return 0;
        }

        if (range.first >= query.first && range.second <= query.second)
        {
            return 1;
        }

        return 2;
    }
};

void update(node_t *node, int64_t val, p32 dest)
{
    if (!node || !node->contains(dest))
    {
        return;
    }

    if (node->contains(dest) == 1)
    {
        node->val = max(node->val, val);
        return;
    }

    node->expand();
    update(node->left, val, dest);
    update(node->right, val, dest);
    node->update();
}

int64_t query(node_t *node, p32 dest)
{
    if (!node || !node->contains(dest))
    {
        return 0;
    }

    if (node->contains(dest) == 1)
    {
        return node->val;
    }

    return max(query(node->left, dest),
               query(node->right, dest));
}

void assign_max(int64_t val, int64_t &v)
{
    v = max(v, val);
}

int64_t weight_sum(int i, int j, vvi64 &prefix, int row)
{
    if (i == -1)
    {
        return 0;
    }

    int64_t sum = prefix[row][j];

    if (i)
    {
        sum -= prefix[row][i - 1];
    }

    return sum;
}

int64_t new_weight(p32 lhs, p32 rhs, vvi64 &prefix)
{
    int64_t left = rhs.first > 0
                       ? weight_sum(0, rhs.second, prefix, rhs.first - 1)
                       : 0;

    int64_t right = (rhs.first + 1 < (int)prefix.size())
                        ? weight_sum(0, rhs.second, prefix, rhs.first + 1)
                        : 0;

    if (lhs.first == -1)
    {
        return left + right;
    }

    if (rhs.first - lhs.first > 2)
    {
        return left + right;
    }

    if (rhs.first - lhs.first == 2)
    {
        if (lhs.second >= rhs.second)
        {
            return right;
        }
        left -= weight_sum(0, lhs.second, prefix, rhs.first - 1);
        return left + right;
    }

    if (lhs.second > rhs.second)
    {
        left = -weight_sum(0, rhs.second, prefix, rhs.first);
        return left + right;
    }

    left -= weight_sum(0, lhs.second, prefix, rhs.first) +
            weight_sum(0, lhs.second, prefix, rhs.first - 1);
    return left + right;
}

long long max_weights(int N, int M,
                      std::vector<int> X,
                      std::vector<int> Y,
                      std::vector<int> W)
{
    vp32 fish;

    int max_y = 0;
    for (int i = 0; i < M; i++)
    {
        max_y = max(max_y, Y[i]);
        if (X[i])
        {
            fish.push_back({X[i] - 1, Y[i]});
        }
        if (X[i] < N - 1)
        {
            fish.push_back({X[i] + 1, Y[i]});
        }
    }

    vvi64 prefix(N, vi64(max_y + 1));
    for (int i = 0; i < M; i++)
    {
        prefix[X[i]][Y[i]] = W[i];
    }

    for (auto &row : prefix)
    {
        for (int i = 1; i < (int)row.size(); i++)
        {
            row[i] += row[i - 1];
        }
    }

    sort(fish.begin(), fish.end());
    auto it = unique(fish.begin(), fish.end());
    fish.erase(it, fish.end());

    map_t decrease;
    map_t increase;
    vp32 check;

    node_t *fish_count = new node_t({0, N});
    for (auto &f : fish)
    {
        int64_t initial = new_weight(p32(-1, -1), f, prefix);
        if (f.first > 2)
        {
            initial += query(fish_count, {0, f.first - 2});
        }

        auto &f_inc = increase[f.first * N + f.second];
        auto &f_dec = decrease[f.first * N + f.second];

        assign_max(initial, f_inc);
        assign_max(initial, f_dec);
        check.push_back(f);
        for (int cur = (int)check.size() - 2; cur >= 0; cur--)
        {
            auto &[i, j] = check[cur];
            auto &inc = increase[i * N + j];
            auto &dec = decrease[i * N + j];

            if (f.first - i > 3)
            {
                break;
            }

            if (i == f.first)
            {
                continue;
            }
            int64_t prev = new_weight(p32(i, j), f, prefix);
            if (i == f.first - 1)
            {
                if (j < f.second)
                {
                    assign_max(prev + inc, f_inc);
                }
                else
                {
                    assign_max(prev + dec, f_dec);
                }
            }
            else
            {
                prev += max(inc, dec);
                assign_max(prev, f_inc);
                assign_max(prev, f_dec);
            }
        }

        update(fish_count,
               max(f_inc, f_dec),
               {f.first, f.first + 1});
    }

    return fish_count->val;
}

#ifdef _AAAAAAAAA
int main()
{
    freopen("fish.in", "r", stdin);
#ifndef __linux__
    atexit([]()
           {
        freopen("con", "r", stdin);
        system("pause"); });
#endif

    int N, M;
    assert(2 == scanf("%d %d", &N, &M));

    std::vector<int> X(M), Y(M), W(M);
    for (int i = 0; i < M; ++i)
    {
        assert(3 == scanf("%d %d %d", &X[i], &Y[i], &W[i]));
    }

    long long result = max_weights(N, M, X, Y, W);
    printf("%lld\n", result);
    return 0;
}
#endif

Compilation message

fish.cpp:8: warning: ignoring '#pragma region dalykai' [-Wunknown-pragmas]
    8 | #pragma region dalykai
      | 
fish.cpp:31: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
   31 | #pragma endregion
      |

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 734 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 770 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5716 KB Output is correct
2 Correct 7 ms 5716 KB Output is correct
3 Correct 78 ms 19296 KB Output is correct
4 Correct 58 ms 16164 KB Output is correct
5 Correct 132 ms 30280 KB Output is correct
6 Correct 128 ms 29756 KB Output is correct
7 Correct 134 ms 30312 KB Output is correct
8 Correct 140 ms 30324 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 2 ms 436 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 2 ms 468 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 2 ms 436 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 13 ms 740 KB Output is correct
17 Correct 946 ms 9044 KB Output is correct
18 Correct 891 ms 8480 KB Output is correct
19 Correct 643 ms 8792 KB Output is correct
20 Correct 460 ms 8528 KB Output is correct
21 Correct 431 ms 8148 KB Output is correct
22 Execution timed out 1080 ms 11404 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 2 ms 436 KB Output is correct
12 Correct 2 ms 592 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 13 ms 740 KB Output is correct
17 Correct 946 ms 9044 KB Output is correct
18 Correct 891 ms 8480 KB Output is correct
19 Correct 643 ms 8792 KB Output is correct
20 Correct 460 ms 8528 KB Output is correct
21 Correct 431 ms 8148 KB Output is correct
22 Execution timed out 1080 ms 11404 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5716 KB Output is correct
2 Correct 7 ms 5716 KB Output is correct
3 Correct 78 ms 19296 KB Output is correct
4 Correct 58 ms 16164 KB Output is correct
5 Correct 132 ms 30280 KB Output is correct
6 Correct 128 ms 29756 KB Output is correct
7 Correct 134 ms 30312 KB Output is correct
8 Correct 140 ms 30324 KB Output is correct
9 Runtime error 762 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 734 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -