oj.uz

Submission #701583

# Submission time Handle Problem Language Result Execution time Memory
701583 2023-02-21T14:17:02 Z boris_mihov Catfish Farm (IOI22_fish) C++17
18 / 100
 887 ms 193604 KB 
#include "fish.h"
#include <algorithm>
#include <iostream>
#include <cassert>
#include <numeric>
#include <vector>

typedef long long llong;
const int MAXN = 100000 + 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];
    SegmentTree()
    {
        std::fill(tree, tree + 4*MAXM, (llong)-1e18);
    }
    
    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][2];
std::vector <Position> pos[MAXN];
std::vector <Position> posUncleared[MAXN];
std::vector <std::pair <int,int>> fish[MAXN];
SegmentTree LR[2], minusL[2], minusIN[2];

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)
    {
        std::sort(fish[x].begin(), fish[x].end());
        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)
    {
        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 (int type = 0 ; type < 2 ; ++type)
        {
            for (const Position &curr : pos[x])
            {
                if (x == n)
                {
                    minusL[type].update(curr.idx, dp[curr.idx][type] - curr.left + curr.right);
                    minusIN[type].update(curr.idx, dp[curr.idx][type] - curr.in + curr.right);
                    LR[type].update(curr.idx, dp[curr.idx][type] + curr.left + 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][type] = std::max(dp[curr.idx][type], minusIN[1].query(pos[x + 1][0].idx, pos[x + 1][l].idx));
                }

                if (r < pos[x + 1].size() && type == 0)
                {
                    dp[curr.idx][type] = std::max(dp[curr.idx][type], LR[0].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][type] = std::max(dp[curr.idx][type], minusL[0].query(pos[x + 2][0].idx, pos[x + 2][l].idx));
                    }

                    if (r < pos[x + 2].size())
                    {
                        dp[curr.idx][type] = std::max(dp[curr.idx][type], LR[0].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][type] = std::max(dp[curr.idx][type], LR[0].query(firstIdx, cnt));
                }

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

    return LR[0].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:131: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]
  131 |             while (ptrL < fish[x - 1].size() && fish[x - 1][ptrL].first <= p.y)
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
fish.cpp:137: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]
  137 |             while (ptrR < fish[x + 1].size() && fish[x + 1][ptrR].first <= p.y)
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
fish.cpp:143: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]
  143 |             while (ptrIN < fish[x].size() && fish[x][ptrIN].first <= p.y)
      |                    ~~~~~~^~~~~~~~~~~~~~~~
fish.cpp:182:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Position>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  182 |                 if (r < pos[x + 1].size() && type == 0)
      |                     ~~^~~~~~~~~~~~~~~~~~~
fish.cpp:203:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Position>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  203 |                     if (r < pos[x + 2].size())
      |                         ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 131244 KB Output is correct
2 Correct 132 ms 132488 KB Output is correct
3 Correct 50 ms 120048 KB Output is correct
4 Correct 48 ms 120012 KB Output is correct
5 Correct 785 ms 179944 KB Output is correct
6 Correct 887 ms 193604 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 120048 KB Output is correct
2 Correct 429 ms 143948 KB Output is correct
3 Correct 486 ms 148488 KB Output is correct
4 Correct 116 ms 131288 KB Output is correct
5 Correct 132 ms 132508 KB Output is correct
6 Correct 47 ms 120012 KB Output is correct
7 Correct 48 ms 120064 KB Output is correct
8 Correct 57 ms 120044 KB Output is correct
9 Correct 52 ms 120040 KB Output is correct
10 Correct 48 ms 119936 KB Output is correct
11 Correct 48 ms 119940 KB Output is correct
12 Correct 209 ms 136436 KB Output is correct
13 Correct 236 ms 138696 KB Output is correct
14 Correct 183 ms 132808 KB Output is correct
15 Correct 244 ms 133788 KB Output is correct
16 Correct 177 ms 132816 KB Output is correct
17 Correct 197 ms 133644 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 120012 KB Output is correct
2 Correct 48 ms 120060 KB Output is correct
3 Correct 126 ms 130924 KB Output is correct
4 Correct 100 ms 127460 KB Output is correct
5 Correct 190 ms 139592 KB Output is correct
6 Correct 196 ms 139592 KB Output is correct
7 Correct 191 ms 139596 KB Output is correct
8 Correct 189 ms 139524 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 119972 KB Output is correct
2 Correct 50 ms 120048 KB Output is correct
3 Correct 48 ms 119964 KB Output is correct
4 Correct 48 ms 119992 KB Output is correct
5 Correct 48 ms 120020 KB Output is correct
6 Correct 47 ms 119944 KB Output is correct
7 Correct 47 ms 119936 KB Output is correct
8 Correct 47 ms 119972 KB Output is correct
9 Correct 50 ms 120116 KB Output is correct
10 Correct 55 ms 120460 KB Output is correct
11 Incorrect 49 ms 120240 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278253610386'
12 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 119972 KB Output is correct
2 Correct 50 ms 120048 KB Output is correct
3 Correct 48 ms 119964 KB Output is correct
4 Correct 48 ms 119992 KB Output is correct
5 Correct 48 ms 120020 KB Output is correct
6 Correct 47 ms 119944 KB Output is correct
7 Correct 47 ms 119936 KB Output is correct
8 Correct 47 ms 119972 KB Output is correct
9 Correct 50 ms 120116 KB Output is correct
10 Correct 55 ms 120460 KB Output is correct
11 Incorrect 49 ms 120240 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278253610386'
12 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 119972 KB Output is correct
2 Correct 50 ms 120048 KB Output is correct
3 Correct 48 ms 119964 KB Output is correct
4 Correct 48 ms 119992 KB Output is correct
5 Correct 48 ms 120020 KB Output is correct
6 Correct 47 ms 119944 KB Output is correct
7 Correct 47 ms 119936 KB Output is correct
8 Correct 47 ms 119972 KB Output is correct
9 Correct 50 ms 120116 KB Output is correct
10 Correct 55 ms 120460 KB Output is correct
11 Incorrect 49 ms 120240 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278253610386'
12 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 120012 KB Output is correct
2 Correct 48 ms 120060 KB Output is correct
3 Correct 126 ms 130924 KB Output is correct
4 Correct 100 ms 127460 KB Output is correct
5 Correct 190 ms 139592 KB Output is correct
6 Correct 196 ms 139592 KB Output is correct
7 Correct 191 ms 139596 KB Output is correct
8 Correct 189 ms 139524 KB Output is correct
9 Correct 307 ms 144284 KB Output is correct
10 Correct 341 ms 141236 KB Output is correct
11 Correct 616 ms 162296 KB Output is correct
12 Correct 47 ms 119960 KB Output is correct
13 Correct 47 ms 119936 KB Output is correct
14 Correct 48 ms 119976 KB Output is correct
15 Correct 49 ms 120004 KB Output is correct
16 Correct 46 ms 119960 KB Output is correct
17 Correct 47 ms 120008 KB Output is correct
18 Correct 48 ms 119940 KB Output is correct
19 Correct 49 ms 120024 KB Output is correct
20 Correct 55 ms 120052 KB Output is correct
21 Correct 49 ms 120012 KB Output is correct
22 Incorrect 329 ms 144176 KB 1st lines differ - on the 1st token, expected: '45561826463480', found: '45356223398028'
23 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 131244 KB Output is correct
2 Correct 132 ms 132488 KB Output is correct
3 Correct 50 ms 120048 KB Output is correct
4 Correct 48 ms 120012 KB Output is correct
5 Correct 785 ms 179944 KB Output is correct
6 Correct 887 ms 193604 KB Output is correct
7 Correct 47 ms 120048 KB Output is correct
8 Correct 429 ms 143948 KB Output is correct
9 Correct 486 ms 148488 KB Output is correct
10 Correct 116 ms 131288 KB Output is correct
11 Correct 132 ms 132508 KB Output is correct
12 Correct 47 ms 120012 KB Output is correct
13 Correct 48 ms 120064 KB Output is correct
14 Correct 57 ms 120044 KB Output is correct
15 Correct 52 ms 120040 KB Output is correct
16 Correct 48 ms 119936 KB Output is correct
17 Correct 48 ms 119940 KB Output is correct
18 Correct 209 ms 136436 KB Output is correct
19 Correct 236 ms 138696 KB Output is correct
20 Correct 183 ms 132808 KB Output is correct
21 Correct 244 ms 133788 KB Output is correct
22 Correct 177 ms 132816 KB Output is correct
23 Correct 197 ms 133644 KB Output is correct
24 Correct 47 ms 120012 KB Output is correct
25 Correct 48 ms 120060 KB Output is correct
26 Correct 126 ms 130924 KB Output is correct
27 Correct 100 ms 127460 KB Output is correct
28 Correct 190 ms 139592 KB Output is correct
29 Correct 196 ms 139592 KB Output is correct
30 Correct 191 ms 139596 KB Output is correct
31 Correct 189 ms 139524 KB Output is correct
32 Correct 47 ms 119972 KB Output is correct
33 Correct 50 ms 120048 KB Output is correct
34 Correct 48 ms 119964 KB Output is correct
35 Correct 48 ms 119992 KB Output is correct
36 Correct 48 ms 120020 KB Output is correct
37 Correct 47 ms 119944 KB Output is correct
38 Correct 47 ms 119936 KB Output is correct
39 Correct 47 ms 119972 KB Output is correct
40 Correct 50 ms 120116 KB Output is correct
41 Correct 55 ms 120460 KB Output is correct
42 Incorrect 49 ms 120240 KB 1st lines differ - on the 1st token, expected: '278622587073', found: '278253610386'
43 Halted 0 ms 0 KB -