oj.uz

Submission #629285

# Submission time Handle Problem Language Result Execution time Memory
629285 2022-08-14T10:37:42 Z qwerasdfzxcl Catfish Farm (IOI22_fish) C++17
100 / 100
 817 ms 131268 KB 
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll INF = 4e18;
vector<int> H[100100], A[100100];
vector<ll> dp[2][100100], S[100100], prf[2][100100], suf[2][100100];
int n, sz[100100];

ll cost(int i, int s, int e){
    if (s>e || i==0) return 0;
    int j1 = upper_bound(H[i].begin(), H[i].end(), s-1) - H[i].begin() - 1;
    int j2 = upper_bound(H[i].begin(), H[i].end(), e) - H[i].begin() - 1;
    return S[i][j2] - S[i][j1];
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    n = N;
    for (int i=0;i<=N;i++) {H[i].push_back(0); H[i].push_back(N);}
    for (int i=0;i<M;i++){
        ++X[i], ++Y[i];
        H[X[i]].push_back(Y[i]);
        H[X[i]].push_back(Y[i]-1);
        if (X[i]>1) H[X[i]-1].push_back(Y[i]);
        if (X[i]<N) H[X[i]+1].push_back(Y[i]);
    }


    for (int i=0;i<=N;i++){
        sort(H[i].begin(), H[i].end());
        H[i].erase(unique(H[i].begin(), H[i].end()), H[i].end());
        sz[i] = H[i].size();

        A[i].resize(sz[i], 0);
        S[i].resize(sz[i], 0);
        dp[0][i].resize(sz[i], 0);
        dp[1][i].resize(sz[i], 0);
        prf[0][i].resize(sz[i]);
        prf[1][i].resize(sz[i]);
        suf[0][i].resize(sz[i]);
        suf[1][i].resize(sz[i]);
    }

    for (int i=0;i<M;i++){
        int idx = lower_bound(H[X[i]].begin(), H[X[i]].end(), Y[i]) - H[X[i]].begin();
        assert(idx < sz[X[i]]);
        A[X[i]][idx] = W[i];
    }


    for (int i=1;i<=n;i++){
        for (int j=1;j<sz[i];j++) S[i][j] = S[i][j-1] + A[i][j];
    }


    dp[0][0][0] = 0;
    dp[1][0][0] = 0;
    assert(sz[0]==2);
    dp[0][0][1] = -INF;
    dp[1][0][1] = -INF;

    for (int i=1;i<=n;i++){
        --i;
        for (int j=0;j<sz[i];j++){
            prf[0][i][j] = dp[0][i][j] + cost(i, H[i][j]+1, n);
            prf[1][i][j] = max(dp[0][i][j], dp[1][i][j]);

            if (j==0) continue;
            prf[0][i][j] = max(prf[0][i][j], prf[0][i][j-1]);
            prf[1][i][j] = max(prf[1][i][j], prf[1][i][j-1]);

        }
        for (int j=sz[i]-1;j>=0;j--){
            ll X = cost(i+1, 1, H[i][j]);
            suf[0][i][j] = max(dp[0][i][j], dp[1][i][j]) + X;
            suf[1][i][j] = dp[1][i][j] + X;

            if (j==sz[i]-1) continue;
            suf[0][i][j] = max(suf[0][i][j], suf[0][i][j+1]);
            suf[1][i][j] = max(suf[1][i][j], suf[1][i][j+1]);
        }
        ++i;

        for (int j=0;j<sz[i];j++){
            ///0 -> 0
            int idx00 = upper_bound(H[i-1].begin(), H[i-1].end(), H[i][j]) - H[i-1].begin() - 1;
            dp[0][i][j] = max(dp[0][i][j], prf[0][i-1][idx00] - cost(i-1, H[i][j]+1, n));

            ///1 -> 0
            if (i>=2){
                int idx10 = upper_bound(H[i-2].begin(), H[i-2].end(), H[i][j]) - H[i-2].begin() - 1;
                dp[0][i][j] = max(dp[0][i][j], prf[1][i-2][idx10] + cost(i-1, 1, H[i][j]));
                if (idx10+1 < sz[i-2]) dp[0][i][j] = max(dp[0][i][j], suf[0][i-2][idx10+1]);
            }

            ///0 -> 1
            dp[1][i][j] = max(dp[1][i][j], dp[0][i-1][sz[i-1]-1] + cost(i, H[i][j]+1, n));

            ///1 -> 1
            int idx11 = idx00;
            if (H[i-1][idx11]<H[i][j]) idx11++;
            dp[1][i][j] = max(dp[1][i][j], suf[1][i-1][idx11] - cost(i, 1, H[i][j]));
        }
    }

    return max(*max_element(dp[0][n].begin(), dp[0][n].end()), *max_element(dp[1][n].begin(), dp[1][n].end()));
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 60004 KB Output is correct
2 Correct 226 ms 65340 KB Output is correct
3 Correct 83 ms 50008 KB Output is correct
4 Correct 78 ms 49960 KB Output is correct
5 Correct 736 ms 116948 KB Output is correct
6 Correct 734 ms 131268 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21460 KB Output is correct
2 Correct 304 ms 68580 KB Output is correct
3 Correct 344 ms 75144 KB Output is correct
4 Correct 203 ms 59936 KB Output is correct
5 Correct 231 ms 65336 KB Output is correct
6 Correct 12 ms 21460 KB Output is correct
7 Correct 13 ms 21424 KB Output is correct
8 Correct 11 ms 21460 KB Output is correct
9 Correct 11 ms 21436 KB Output is correct
10 Correct 93 ms 49964 KB Output is correct
11 Correct 78 ms 49956 KB Output is correct
12 Correct 251 ms 65160 KB Output is correct
13 Correct 281 ms 71784 KB Output is correct
14 Correct 232 ms 62652 KB Output is correct
15 Correct 219 ms 61928 KB Output is correct
16 Correct 230 ms 62756 KB Output is correct
17 Correct 247 ms 67048 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 50012 KB Output is correct
2 Correct 80 ms 50008 KB Output is correct
3 Correct 117 ms 49488 KB Output is correct
4 Correct 109 ms 51496 KB Output is correct
5 Correct 176 ms 54436 KB Output is correct
6 Correct 166 ms 54400 KB Output is correct
7 Correct 173 ms 54444 KB Output is correct
8 Correct 162 ms 54468 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 12 ms 21460 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 11 ms 21460 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 13 ms 21424 KB Output is correct
7 Correct 11 ms 21460 KB Output is correct
8 Correct 13 ms 21460 KB Output is correct
9 Correct 12 ms 21460 KB Output is correct
10 Correct 15 ms 21816 KB Output is correct
11 Correct 12 ms 21588 KB Output is correct
12 Correct 13 ms 21656 KB Output is correct
13 Correct 13 ms 21460 KB Output is correct
14 Correct 12 ms 21640 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 12 ms 21460 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 11 ms 21460 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 13 ms 21424 KB Output is correct
7 Correct 11 ms 21460 KB Output is correct
8 Correct 13 ms 21460 KB Output is correct
9 Correct 12 ms 21460 KB Output is correct
10 Correct 15 ms 21816 KB Output is correct
11 Correct 12 ms 21588 KB Output is correct
12 Correct 13 ms 21656 KB Output is correct
13 Correct 13 ms 21460 KB Output is correct
14 Correct 12 ms 21640 KB Output is correct
15 Correct 12 ms 21588 KB Output is correct
16 Correct 15 ms 21732 KB Output is correct
17 Correct 57 ms 26976 KB Output is correct
18 Correct 54 ms 26872 KB Output is correct
19 Correct 56 ms 26852 KB Output is correct
20 Correct 49 ms 26536 KB Output is correct
21 Correct 50 ms 26444 KB Output is correct
22 Correct 97 ms 31352 KB Output is correct
23 Correct 27 ms 23764 KB Output is correct
24 Correct 52 ms 26988 KB Output is correct
25 Correct 13 ms 21716 KB Output is correct
26 Correct 27 ms 23352 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 12 ms 21460 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 11 ms 21460 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 13 ms 21424 KB Output is correct
7 Correct 11 ms 21460 KB Output is correct
8 Correct 13 ms 21460 KB Output is correct
9 Correct 12 ms 21460 KB Output is correct
10 Correct 15 ms 21816 KB Output is correct
11 Correct 12 ms 21588 KB Output is correct
12 Correct 13 ms 21656 KB Output is correct
13 Correct 13 ms 21460 KB Output is correct
14 Correct 12 ms 21640 KB Output is correct
15 Correct 12 ms 21588 KB Output is correct
16 Correct 15 ms 21732 KB Output is correct
17 Correct 57 ms 26976 KB Output is correct
18 Correct 54 ms 26872 KB Output is correct
19 Correct 56 ms 26852 KB Output is correct
20 Correct 49 ms 26536 KB Output is correct
21 Correct 50 ms 26444 KB Output is correct
22 Correct 97 ms 31352 KB Output is correct
23 Correct 27 ms 23764 KB Output is correct
24 Correct 52 ms 26988 KB Output is correct
25 Correct 13 ms 21716 KB Output is correct
26 Correct 27 ms 23352 KB Output is correct
27 Correct 16 ms 22740 KB Output is correct
28 Correct 234 ms 47884 KB Output is correct
29 Correct 375 ms 64584 KB Output is correct
30 Correct 634 ms 99972 KB Output is correct
31 Correct 603 ms 99212 KB Output is correct
32 Correct 284 ms 54024 KB Output is correct
33 Correct 621 ms 102632 KB Output is correct
34 Correct 644 ms 102672 KB Output is correct
35 Correct 203 ms 44908 KB Output is correct
36 Correct 542 ms 88916 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 50012 KB Output is correct
2 Correct 80 ms 50008 KB Output is correct
3 Correct 117 ms 49488 KB Output is correct
4 Correct 109 ms 51496 KB Output is correct
5 Correct 176 ms 54436 KB Output is correct
6 Correct 166 ms 54400 KB Output is correct
7 Correct 173 ms 54444 KB Output is correct
8 Correct 162 ms 54468 KB Output is correct
9 Correct 215 ms 65412 KB Output is correct
10 Correct 155 ms 46176 KB Output is correct
11 Correct 261 ms 70788 KB Output is correct
12 Correct 13 ms 21460 KB Output is correct
13 Correct 12 ms 21460 KB Output is correct
14 Correct 12 ms 21364 KB Output is correct
15 Correct 13 ms 21460 KB Output is correct
16 Correct 12 ms 21456 KB Output is correct
17 Correct 11 ms 21332 KB Output is correct
18 Correct 78 ms 49968 KB Output is correct
19 Correct 78 ms 50136 KB Output is correct
20 Correct 85 ms 50136 KB Output is correct
21 Correct 93 ms 50012 KB Output is correct
22 Correct 331 ms 74300 KB Output is correct
23 Correct 353 ms 79980 KB Output is correct
24 Correct 358 ms 80908 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 60004 KB Output is correct
2 Correct 226 ms 65340 KB Output is correct
3 Correct 83 ms 50008 KB Output is correct
4 Correct 78 ms 49960 KB Output is correct
5 Correct 736 ms 116948 KB Output is correct
6 Correct 734 ms 131268 KB Output is correct
7 Correct 13 ms 21460 KB Output is correct
8 Correct 304 ms 68580 KB Output is correct
9 Correct 344 ms 75144 KB Output is correct
10 Correct 203 ms 59936 KB Output is correct
11 Correct 231 ms 65336 KB Output is correct
12 Correct 12 ms 21460 KB Output is correct
13 Correct 13 ms 21424 KB Output is correct
14 Correct 11 ms 21460 KB Output is correct
15 Correct 11 ms 21436 KB Output is correct
16 Correct 93 ms 49964 KB Output is correct
17 Correct 78 ms 49956 KB Output is correct
18 Correct 251 ms 65160 KB Output is correct
19 Correct 281 ms 71784 KB Output is correct
20 Correct 232 ms 62652 KB Output is correct
21 Correct 219 ms 61928 KB Output is correct
22 Correct 230 ms 62756 KB Output is correct
23 Correct 247 ms 67048 KB Output is correct
24 Correct 78 ms 50012 KB Output is correct
25 Correct 80 ms 50008 KB Output is correct
26 Correct 117 ms 49488 KB Output is correct
27 Correct 109 ms 51496 KB Output is correct
28 Correct 176 ms 54436 KB Output is correct
29 Correct 166 ms 54400 KB Output is correct
30 Correct 173 ms 54444 KB Output is correct
31 Correct 162 ms 54468 KB Output is correct
32 Correct 11 ms 21460 KB Output is correct
33 Correct 12 ms 21460 KB Output is correct
34 Correct 11 ms 21460 KB Output is correct
35 Correct 11 ms 21460 KB Output is correct
36 Correct 11 ms 21460 KB Output is correct
37 Correct 13 ms 21424 KB Output is correct
38 Correct 11 ms 21460 KB Output is correct
39 Correct 13 ms 21460 KB Output is correct
40 Correct 12 ms 21460 KB Output is correct
41 Correct 15 ms 21816 KB Output is correct
42 Correct 12 ms 21588 KB Output is correct
43 Correct 13 ms 21656 KB Output is correct
44 Correct 13 ms 21460 KB Output is correct
45 Correct 12 ms 21640 KB Output is correct
46 Correct 12 ms 21588 KB Output is correct
47 Correct 15 ms 21732 KB Output is correct
48 Correct 57 ms 26976 KB Output is correct
49 Correct 54 ms 26872 KB Output is correct
50 Correct 56 ms 26852 KB Output is correct
51 Correct 49 ms 26536 KB Output is correct
52 Correct 50 ms 26444 KB Output is correct
53 Correct 97 ms 31352 KB Output is correct
54 Correct 27 ms 23764 KB Output is correct
55 Correct 52 ms 26988 KB Output is correct
56 Correct 13 ms 21716 KB Output is correct
57 Correct 27 ms 23352 KB Output is correct
58 Correct 16 ms 22740 KB Output is correct
59 Correct 234 ms 47884 KB Output is correct
60 Correct 375 ms 64584 KB Output is correct
61 Correct 634 ms 99972 KB Output is correct
62 Correct 603 ms 99212 KB Output is correct
63 Correct 284 ms 54024 KB Output is correct
64 Correct 621 ms 102632 KB Output is correct
65 Correct 644 ms 102672 KB Output is correct
66 Correct 203 ms 44908 KB Output is correct
67 Correct 542 ms 88916 KB Output is correct
68 Correct 215 ms 65412 KB Output is correct
69 Correct 155 ms 46176 KB Output is correct
70 Correct 261 ms 70788 KB Output is correct
71 Correct 13 ms 21460 KB Output is correct
72 Correct 12 ms 21460 KB Output is correct
73 Correct 12 ms 21364 KB Output is correct
74 Correct 13 ms 21460 KB Output is correct
75 Correct 12 ms 21456 KB Output is correct
76 Correct 11 ms 21332 KB Output is correct
77 Correct 78 ms 49968 KB Output is correct
78 Correct 78 ms 50136 KB Output is correct
79 Correct 85 ms 50136 KB Output is correct
80 Correct 93 ms 50012 KB Output is correct
81 Correct 331 ms 74300 KB Output is correct
82 Correct 353 ms 79980 KB Output is correct
83 Correct 358 ms 80908 KB Output is correct
84 Correct 817 ms 115624 KB Output is correct
85 Correct 791 ms 117692 KB Output is correct
86 Correct 718 ms 126960 KB Output is correct
87 Correct 806 ms 130172 KB Output is correct
88 Correct 13 ms 21460 KB Output is correct
89 Correct 747 ms 130164 KB Output is correct
90 Correct 593 ms 106572 KB Output is correct
91 Correct 387 ms 85836 KB Output is correct