oj.uz

Submission #701479

# Submission time Handle Problem Language Result Execution time Memory
701479 2023-02-21T10:36:38 Z boris_mihov Catfish Farm (IOI22_fish) C++17
12 / 100
 560 ms 160752 KB 
#include "fish.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>

typedef long long llong;
const int MAXN = 600000 + 10;
const int MAXM = 600000 + 10;

struct Position
{
    int y;
    int idx;
    llong in;
    llong left;
    llong right;

    Position(int _y, int _idx, llong _in, llong _left, llong _right)
    {
        y = _y;
        idx = _idx;
        left = _left;
        right = _right;
        in = _in;
    }
};

int cnt;
struct SegmentTree
{
    llong tree[4*MAXM];
    void update(int l, int r, int node, int queryIdx, llong value)
    {
        if (l == r)
        {
            tree[node] = value;
            return;
        }

        int mid = (l + r) / 2;
        if (queryIdx <= mid) update(l, mid, 2*node, queryIdx, value);
        else update(mid + 1, r, 2*node + 1, queryIdx, value);
        tree[node] = std::max(tree[2*node], tree[2*node + 1]);
    }

    llong query(int l, int r, int node, int queryL, int queryR)
    {
        if (queryL <= l && r <= queryR)
        {
            return tree[node];
        }

        llong ans = -1e18;
        int mid = (l + r) / 2;
        if (queryL <= mid) ans = std::max(ans, query(l, mid, 2*node, queryL, queryR));
        if (mid + 1 <= queryR) ans = std::max(ans, query(mid + 1, r, 2*node + 1, queryL, queryR));
        return ans; 
    }

    void update(int pos, llong value)
    {
        update(1, cnt, 1, pos, value);
    }

    llong query(int l, int r)
    {
        return query(1, cnt, 1, l, r);
    }
};

int n, m;
llong dp[MAXM];
std::vector <Position> pos[MAXN];
std::vector <Position> posUncleared[MAXN];
std::vector <std::pair <int,int>> fish[MAXN];
SegmentTree LR, minusL, minusIN;

llong max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) 
{
    n = N; m = M;   
    for (int i = 0 ; i < m ; ++i)
    {
        fish[X[i] + 1].emplace_back(Y[i] + 1, W[i]);
    }

    for (int x = 1 ; x <= n ; ++x)
    {
        for (const auto &[y, w] : fish[x])
        {
            if (x != 1)
            {
                posUncleared[x - 1].push_back({y, 0, 0LL, 0LL, 0LL});
            }

            if (x != n)
            {
                posUncleared[x + 1].push_back({y, 0, 0LL, 0LL, 0LL});
            }
        }
    }

    for (int x = 1 ; x <= n ; ++x)
    {
        std::sort(posUncleared[x].begin(), posUncleared[x].end(), [&](Position a, Position b)
        {
            return a.y < b.y;
        });

        for (Position p : posUncleared[x])
        {
            if (!pos[x].empty() && pos[x].back().y == p.y)
            {
                continue;
            }

            p.idx = ++cnt;
            pos[x].push_back(p);
        }

        int ptrL = 0;
        int ptrR = 0;
        int ptrIN = 0;
        llong inSum = 0;
        llong leftSum = 0;
        llong rightSum = 0;
        for (Position &p : pos[x])
        {
            while (ptrL < fish[x - 1].size() && fish[x - 1][ptrL].first <= p.y)
            {
                leftSum += fish[x - 1][ptrL].second;
                ptrL++;
            }

            while (ptrR < fish[x + 1].size() && fish[x + 1][ptrR].first <= p.y)
            {
                rightSum += fish[x + 1][ptrR].second;
                ptrR++;
            }

            while (ptrIN < fish[x].size() && fish[x][ptrIN].first <= p.y)
            {
                inSum += fish[x][ptrIN].second;
                ptrIN++;
            }

            p.in = inSum;
            p.left = leftSum;
            p.right = rightSum;
        }
    }

    for (int x = n ; x >= 1 ; --x)
    {
        for (const Position &curr : pos[x])
        {
            if (x == n)
            {
                LR.update(curr.idx, dp[curr.idx] + curr.left + curr.right);
                minusL.update(curr.idx, dp[curr.idx] - curr.left + curr.right);
                minusIN.update(curr.idx, dp[curr.idx] - curr.in + curr.right);
                continue;
            }

            int l = -1, r = pos[x + 1].size(), mid;
            while (l < r - 1)
            {
                mid = (l + r) / 2;
                if (pos[x + 1][mid].y < curr.y) l = mid;
                else r = mid;
            }

            if (l >= 0)
            {
                dp[curr.idx] = std::max(dp[curr.idx], minusIN.query(pos[x + 1][0].idx, pos[x + 1][l].idx));
            }

            if (r < pos[x + 1].size())
            {
                dp[curr.idx] = std::max(dp[curr.idx], LR.query(pos[x + 1][r].idx, pos[x + 1].back().idx) - curr.in - curr.right);
            }

            if (x + 2 <= n)
            {
                l = -1;
                r = pos[x + 2].size();
                while (l < r - 1)
                {
                    mid = (l + r) / 2;
                    if (pos[x + 2][mid].y < curr.y) l = mid;
                    else r = mid;
                }

                if (l >= 0)
                {
                    dp[curr.idx] = std::max(dp[curr.idx], minusL.query(pos[x + 2][0].idx, pos[x + 2][l].idx));
                }

                if (r < pos[x + 2].size())
                {
                    dp[curr.idx] = std::max(dp[curr.idx], LR.query(pos[x + 2][r].idx, pos[x + 2].back().idx) - curr.right);
                }
            }

            int firstIdx = pos[x].back().idx + 1;
            if (!pos[x + 1].empty())
            {
                firstIdx = pos[x + 1].back().idx + 1;
            }

            if (!pos[x + 2].empty())
            {
                firstIdx = pos[x + 2].back().idx + 1;
            }

            if (firstIdx <= cnt)
            {
                dp[curr.idx] = std::max(dp[curr.idx], LR.query(firstIdx, cnt));
            }

            LR.update(curr.idx, dp[curr.idx] + curr.left + curr.right);
            minusL.update(curr.idx, dp[curr.idx] - curr.left + curr.right);
            minusIN.update(curr.idx, dp[curr.idx] - curr.in + curr.right);
        }
    }

    return LR.query(1, cnt);
}

Compilation message

fish.cpp: In function 'llong max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:130:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |             while (ptrL < fish[x - 1].size() && fish[x - 1][ptrL].first <= p.y)
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
fish.cpp:136:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |             while (ptrR < fish[x + 1].size() && fish[x + 1][ptrR].first <= p.y)
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
fish.cpp:142:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |             while (ptrIN < fish[x].size() && fish[x][ptrIN].first <= p.y)
      |                    ~~~~~~^~~~~~~~~~~~~~~~
fish.cpp:179:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Position>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |             if (r < pos[x + 1].size())
      |                 ~~^~~~~~~~~~~~~~~~~~~
fish.cpp:200:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Position>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |                 if (r < pos[x + 2].size())
      |                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 56448 KB Output is correct
2 Correct 89 ms 58292 KB Output is correct
3 Correct 22 ms 42600 KB Output is correct
4 Correct 21 ms 42580 KB Output is correct
5 Correct 508 ms 147544 KB Output is correct
6 Correct 560 ms 160752 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 42504 KB Output is correct
2 Incorrect 254 ms 76612 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '80958394776886'
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 42580 KB Output is correct
2 Correct 20 ms 42580 KB Output is correct
3 Correct 90 ms 56020 KB Output is correct
4 Correct 75 ms 52656 KB Output is correct
5 Correct 124 ms 67492 KB Output is correct
6 Correct 138 ms 67448 KB Output is correct
7 Correct 143 ms 67528 KB Output is correct
8 Correct 153 ms 67504 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 42504 KB Output is correct
2 Correct 20 ms 42580 KB Output is correct
3 Correct 20 ms 42580 KB Output is correct
4 Correct 20 ms 42580 KB Output is correct
5 Correct 20 ms 42580 KB Output is correct
6 Correct 21 ms 42560 KB Output is correct
7 Correct 23 ms 42560 KB Output is correct
8 Correct 20 ms 42532 KB Output is correct
9 Incorrect 24 ms 42708 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '307266647744'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 42504 KB Output is correct
2 Correct 20 ms 42580 KB Output is correct
3 Correct 20 ms 42580 KB Output is correct
4 Correct 20 ms 42580 KB Output is correct
5 Correct 20 ms 42580 KB Output is correct
6 Correct 21 ms 42560 KB Output is correct
7 Correct 23 ms 42560 KB Output is correct
8 Correct 20 ms 42532 KB Output is correct
9 Incorrect 24 ms 42708 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '307266647744'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 42504 KB Output is correct
2 Correct 20 ms 42580 KB Output is correct
3 Correct 20 ms 42580 KB Output is correct
4 Correct 20 ms 42580 KB Output is correct
5 Correct 20 ms 42580 KB Output is correct
6 Correct 21 ms 42560 KB Output is correct
7 Correct 23 ms 42560 KB Output is correct
8 Correct 20 ms 42532 KB Output is correct
9 Incorrect 24 ms 42708 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '307266647744'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 42580 KB Output is correct
2 Correct 20 ms 42580 KB Output is correct
3 Correct 90 ms 56020 KB Output is correct
4 Correct 75 ms 52656 KB Output is correct
5 Correct 124 ms 67492 KB Output is correct
6 Correct 138 ms 67448 KB Output is correct
7 Correct 143 ms 67528 KB Output is correct
8 Correct 153 ms 67504 KB Output is correct
9 Correct 195 ms 77560 KB Output is correct
10 Incorrect 137 ms 64352 KB 1st lines differ - on the 1st token, expected: '36454348383152', found: '46645297467139'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 56448 KB Output is correct
2 Correct 89 ms 58292 KB Output is correct
3 Correct 22 ms 42600 KB Output is correct
4 Correct 21 ms 42580 KB Output is correct
5 Correct 508 ms 147544 KB Output is correct
6 Correct 560 ms 160752 KB Output is correct
7 Correct 23 ms 42504 KB Output is correct
8 Incorrect 254 ms 76612 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '80958394776886'
9 Halted 0 ms 0 KB -