oj.uz

Submission #627614

# Submission time Handle Problem Language Result Execution time Memory
627614 2022-08-12T17:40:34 Z dqhungdl Catfish Farm (IOI22_fish) C++17
67 / 100
 433 ms 73544 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;
const int MAX = 1e5 + 5, SINF = 2e9;
const long long INF = 1e18;
bool markLow[MAX];
vector<ii> g[MAX];
vector<long long> S[MAX];
vector<vector<long long>> f[MAX];

struct FenwickTreeLow {
    int n;
    vector<int> buffer;
    vector<long long> tree;

    FenwickTreeLow(int _n) {
        n = _n;
        tree.resize(n + 5, -INF);
    }

    void update(int idx, long long val) {
        idx++;
        for (int i = idx; i <= n; i += i & -i) {
            buffer.push_back(i);
            tree[i] = max(tree[i], val);
        }
    }

    long long get(int idx) {
        idx++;
        long long rs = 0;
        for (int i = idx; i > 0; i -= i & -i)
            rs = max(rs, tree[i]);
        return rs;
    }

    void reset() {
        for (int id: buffer)
            tree[id] = -INF;
        buffer.clear();
    }
};

struct FenwickTreeHigh {
    int n;
    vector<int> buffer;
    vector<long long> tree;

    FenwickTreeHigh(int _n) {
        n = _n;
        tree.resize(n + 5, -INF);
    }

    void update(int idx, long long val) {
        idx++;
        for (int i = idx; i > 0; i -= i & -i) {
            buffer.push_back(i);
            tree[i] = max(tree[i], val);
        }
    }

    long long get(int idx) {
        idx++;
        long long rs = 0;
        for (int i = idx; i <= n; i += i & -i)
            rs = max(rs, tree[i]);
        return rs;
    }

    void reset() {
        for (int id: buffer)
            tree[id] = -INF;
        buffer.clear();
    }
};

//long long calcCost(int col, int L, int R) {
//    int l = lower_bound(g[col].begin(), g[col].end(), ii(L, 0)) - g[col].begin();
//    int r = upper_bound(g[col].begin(), g[col].end(), ii(R, 0)) - g[col].begin() - 1;
//    if (l <= r)
//        return S[col][r] - (l ? S[col][l - 1] : 0);
//    return 0;
//}

long long calcCostLeft(int col, int L) {
    int l = lower_bound(g[col].begin(), g[col].end(), ii(L, 0)) - g[col].begin();
    return l ? S[col][l - 1] : 0;
}

long long calcCostRight(int col, int R) {
    int r = upper_bound(g[col].begin(), g[col].end(), ii(R, 0)) - g[col].begin() - 1;
    return r >= 0 ? S[col][r] : 0;
}

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for (int i = 0; i < M; i++) {
        g[X[i]].emplace_back(Y[i], W[i]);
        if (!Y[i])
            markLow[X[i]] = true;
    }
    for (int i = 0; i < N; i++) {
        if (!markLow[i])
            g[i].emplace_back(0, 0);
        g[i].emplace_back(N, 0);
    }
    for (int i = 0; i < N; i++) {
        sort(g[i].begin(), g[i].end());
        S[i].resize(g[i].size());
        S[i][0] = g[i][0].second;
        for (int j = 1; j < g[i].size(); j++)
            S[i][j] = S[i][j - 1] + g[i][j].second;
        f[i].resize(g[i].size(), vector<long long>(2));
    }
    FenwickTreeLow lowTree(N), lowJump(N);
    FenwickTreeHigh highTree(N), highJump(N);
    long long rs = 0;
    for (int i = 1; i < N; i++) {
        if (i > 1) {
            lowJump.reset(), highJump.reset();
            for (int t = 0; t < g[i - 2].size(); t++) {
                lowJump.update(t, f[i - 2][t][1]);
                highJump.update(t, f[i - 2][t][1] + calcCostRight(i - 1, g[i - 2][t].first));
            }
        }
        lowTree.reset(), highTree.reset();
        for (int t = 0; t < g[i - 1].size(); t++) {
            lowTree.update(t, f[i - 1][t][0] - calcCostLeft(i - 1, g[i - 1][t].first));
            highTree.update(t, f[i - 1][t][1] + calcCostRight(i, g[i - 1][t].first));
        }
        for (int j = 0; j < g[i].size(); j++) {
            if (i > 1) {
                int low = upper_bound(g[i - 2].begin(), g[i - 2].end(), ii(g[i][j].first, SINF)) - g[i - 2].begin() - 1;
                long long tmp = lowJump.get(low) + calcCostRight(i - 1, g[i][j].first);
                f[i][j][0] = max(f[i][j][0], tmp);
                f[i][j][1] = max(f[i][j][1], tmp);

                int high = low + 1;
                tmp = highJump.get(high);
                f[i][j][0] = max(f[i][j][0], tmp);
                f[i][j][1] = max(f[i][j][1], tmp);

//                for (int t = 0; t < g[i - 2].size(); t++) {
//                    long long tmp = f[i - 2][t][1] + calcCost(i - 1, 0, max(g[i - 2][t].first, g[i][j].first));
//                    f[i][j][0] = max(f[i][j][0], tmp);
//                    f[i][j][1] = max(f[i][j][1], tmp);
//                }
            } else {
                long long tmp = calcCostRight(0, g[i][j].first);
                f[i][j][0] = max(f[i][j][0], tmp);
                f[i][j][1] = max(f[i][j][1], tmp);
            }

            int low = upper_bound(g[i - 1].begin(), g[i - 1].end(), ii(g[i][j].first, SINF)) - g[i - 1].begin() - 1;
            long long tmp = lowTree.get(low) + calcCostRight(i - 1, g[i][j].first);
            f[i][j][0] = max(f[i][j][0], tmp);
            f[i][j][1] = max(f[i][j][1], tmp);

            int high = lower_bound(g[i - 1].begin(), g[i - 1].end(), ii(g[i][j].first, 0)) - g[i - 1].begin();
            f[i][j][1] = max(f[i][j][1], highTree.get(high) - calcCostLeft(i, g[i][j].first));

            rs = max({rs, f[i][j][0], f[i][j][1]});
//            for (int t = 0; t < g[i - 1].size(); t++) {
//                if (g[i - 1][t].first <= g[i][j].first) {
//                    f[i][j][0] = max(f[i][j][0], f[i - 1][t][0] + calcCost(i - 1, g[i - 1][t].first, g[i][j].first));
//                    f[i][j][1] = max(f[i][j][1], f[i - 1][t][0] + calcCost(i - 1, g[i - 1][t].first, g[i][j].first));
//                }
//                if (g[i - 1][t].first >= g[i][j].first)
//                    f[i][j][1] = max(f[i][j][1], f[i - 1][t][1] + calcCost(i, g[i][j].first, g[i - 1][t].first));
//            }
        }
    }
    return rs;
}

//int main() {
//    freopen("../_input", "r", stdin);
//    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;
//}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:112:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for (int j = 1; j < g[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~
fish.cpp:122:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |             for (int t = 0; t < g[i - 2].size(); t++) {
      |                             ~~^~~~~~~~~~~~~~~~~
fish.cpp:128:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |         for (int t = 0; t < g[i - 1].size(); t++) {
      |                         ~~^~~~~~~~~~~~~~~~~
fish.cpp:132:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |         for (int j = 0; j < g[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 49588 KB Output is correct
2 Correct 227 ms 55612 KB Output is correct
3 Correct 115 ms 29388 KB Output is correct
4 Correct 113 ms 29256 KB Output is correct
5 Correct 422 ms 73544 KB Output is correct
6 Correct 433 ms 58452 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 272 ms 57384 KB Output is correct
3 Correct 320 ms 65164 KB Output is correct
4 Correct 176 ms 49624 KB Output is correct
5 Correct 207 ms 55720 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 6 ms 7252 KB Output is correct
8 Correct 3 ms 7252 KB Output is correct
9 Correct 5 ms 7252 KB Output is correct
10 Correct 115 ms 29340 KB Output is correct
11 Correct 118 ms 29276 KB Output is correct
12 Correct 183 ms 49716 KB Output is correct
13 Correct 212 ms 55628 KB Output is correct
14 Correct 184 ms 42572 KB Output is correct
15 Correct 216 ms 45900 KB Output is correct
16 Correct 193 ms 42516 KB Output is correct
17 Correct 237 ms 45888 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 29276 KB Output is correct
2 Correct 132 ms 29280 KB Output is correct
3 Correct 155 ms 28476 KB Output is correct
4 Correct 147 ms 30156 KB Output is correct
5 Correct 167 ms 31692 KB Output is correct
6 Correct 156 ms 31720 KB Output is correct
7 Correct 228 ms 31644 KB Output is correct
8 Correct 174 ms 31720 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7252 KB Output is correct
7 Correct 4 ms 7328 KB Output is correct
8 Correct 5 ms 7252 KB Output is correct
9 Correct 6 ms 7380 KB Output is correct
10 Correct 6 ms 7508 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 7 ms 7508 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 6 ms 7436 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7252 KB Output is correct
7 Correct 4 ms 7328 KB Output is correct
8 Correct 5 ms 7252 KB Output is correct
9 Correct 6 ms 7380 KB Output is correct
10 Correct 6 ms 7508 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 7 ms 7508 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 6 ms 7436 KB Output is correct
15 Correct 5 ms 7372 KB Output is correct
16 Correct 6 ms 7508 KB Output is correct
17 Correct 47 ms 11768 KB Output is correct
18 Correct 55 ms 11980 KB Output is correct
19 Correct 45 ms 11908 KB Output is correct
20 Correct 44 ms 11860 KB Output is correct
21 Correct 48 ms 11896 KB Output is correct
22 Correct 91 ms 16412 KB Output is correct
23 Correct 14 ms 8276 KB Output is correct
24 Correct 35 ms 10304 KB Output is correct
25 Correct 7 ms 7508 KB Output is correct
26 Correct 13 ms 8148 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 4 ms 7252 KB Output is correct
4 Correct 4 ms 7252 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7252 KB Output is correct
7 Correct 4 ms 7328 KB Output is correct
8 Correct 5 ms 7252 KB Output is correct
9 Correct 6 ms 7380 KB Output is correct
10 Correct 6 ms 7508 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 7 ms 7508 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 6 ms 7436 KB Output is correct
15 Correct 5 ms 7372 KB Output is correct
16 Correct 6 ms 7508 KB Output is correct
17 Correct 47 ms 11768 KB Output is correct
18 Correct 55 ms 11980 KB Output is correct
19 Correct 45 ms 11908 KB Output is correct
20 Correct 44 ms 11860 KB Output is correct
21 Correct 48 ms 11896 KB Output is correct
22 Correct 91 ms 16412 KB Output is correct
23 Correct 14 ms 8276 KB Output is correct
24 Correct 35 ms 10304 KB Output is correct
25 Correct 7 ms 7508 KB Output is correct
26 Correct 13 ms 8148 KB Output is correct
27 Correct 9 ms 8148 KB Output is correct
28 Correct 249 ms 28952 KB Output is correct
29 Correct 356 ms 37648 KB Output is correct
30 Correct 314 ms 36852 KB Output is correct
31 Correct 322 ms 36824 KB Output is correct
32 Incorrect 376 ms 37700 KB 1st lines differ - on the 1st token, expected: '99669450104468', found: '99665998357453'
33 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 29276 KB Output is correct
2 Correct 132 ms 29280 KB Output is correct
3 Correct 155 ms 28476 KB Output is correct
4 Correct 147 ms 30156 KB Output is correct
5 Correct 167 ms 31692 KB Output is correct
6 Correct 156 ms 31720 KB Output is correct
7 Correct 228 ms 31644 KB Output is correct
8 Correct 174 ms 31720 KB Output is correct
9 Correct 239 ms 38416 KB Output is correct
10 Correct 150 ms 24096 KB Output is correct
11 Correct 338 ms 40852 KB Output is correct
12 Correct 5 ms 7264 KB Output is correct
13 Correct 4 ms 7252 KB Output is correct
14 Correct 5 ms 7252 KB Output is correct
15 Correct 6 ms 7252 KB Output is correct
16 Correct 7 ms 7348 KB Output is correct
17 Correct 6 ms 7252 KB Output is correct
18 Correct 142 ms 29216 KB Output is correct
19 Correct 138 ms 29272 KB Output is correct
20 Correct 134 ms 29276 KB Output is correct
21 Correct 153 ms 29248 KB Output is correct
22 Correct 277 ms 38532 KB Output is correct
23 Correct 413 ms 48184 KB Output is correct
24 Correct 361 ms 48616 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 49588 KB Output is correct
2 Correct 227 ms 55612 KB Output is correct
3 Correct 115 ms 29388 KB Output is correct
4 Correct 113 ms 29256 KB Output is correct
5 Correct 422 ms 73544 KB Output is correct
6 Correct 433 ms 58452 KB Output is correct
7 Correct 4 ms 7252 KB Output is correct
8 Correct 272 ms 57384 KB Output is correct
9 Correct 320 ms 65164 KB Output is correct
10 Correct 176 ms 49624 KB Output is correct
11 Correct 207 ms 55720 KB Output is correct
12 Correct 4 ms 7252 KB Output is correct
13 Correct 6 ms 7252 KB Output is correct
14 Correct 3 ms 7252 KB Output is correct
15 Correct 5 ms 7252 KB Output is correct
16 Correct 115 ms 29340 KB Output is correct
17 Correct 118 ms 29276 KB Output is correct
18 Correct 183 ms 49716 KB Output is correct
19 Correct 212 ms 55628 KB Output is correct
20 Correct 184 ms 42572 KB Output is correct
21 Correct 216 ms 45900 KB Output is correct
22 Correct 193 ms 42516 KB Output is correct
23 Correct 237 ms 45888 KB Output is correct
24 Correct 138 ms 29276 KB Output is correct
25 Correct 132 ms 29280 KB Output is correct
26 Correct 155 ms 28476 KB Output is correct
27 Correct 147 ms 30156 KB Output is correct
28 Correct 167 ms 31692 KB Output is correct
29 Correct 156 ms 31720 KB Output is correct
30 Correct 228 ms 31644 KB Output is correct
31 Correct 174 ms 31720 KB Output is correct
32 Correct 5 ms 7252 KB Output is correct
33 Correct 5 ms 7252 KB Output is correct
34 Correct 4 ms 7252 KB Output is correct
35 Correct 4 ms 7252 KB Output is correct
36 Correct 4 ms 7252 KB Output is correct
37 Correct 5 ms 7252 KB Output is correct
38 Correct 4 ms 7328 KB Output is correct
39 Correct 5 ms 7252 KB Output is correct
40 Correct 6 ms 7380 KB Output is correct
41 Correct 6 ms 7508 KB Output is correct
42 Correct 4 ms 7380 KB Output is correct
43 Correct 7 ms 7508 KB Output is correct
44 Correct 4 ms 7380 KB Output is correct
45 Correct 6 ms 7436 KB Output is correct
46 Correct 5 ms 7372 KB Output is correct
47 Correct 6 ms 7508 KB Output is correct
48 Correct 47 ms 11768 KB Output is correct
49 Correct 55 ms 11980 KB Output is correct
50 Correct 45 ms 11908 KB Output is correct
51 Correct 44 ms 11860 KB Output is correct
52 Correct 48 ms 11896 KB Output is correct
53 Correct 91 ms 16412 KB Output is correct
54 Correct 14 ms 8276 KB Output is correct
55 Correct 35 ms 10304 KB Output is correct
56 Correct 7 ms 7508 KB Output is correct
57 Correct 13 ms 8148 KB Output is correct
58 Correct 9 ms 8148 KB Output is correct
59 Correct 249 ms 28952 KB Output is correct
60 Correct 356 ms 37648 KB Output is correct
61 Correct 314 ms 36852 KB Output is correct
62 Correct 322 ms 36824 KB Output is correct
63 Incorrect 376 ms 37700 KB 1st lines differ - on the 1st token, expected: '99669450104468', found: '99665998357453'
64 Halted 0 ms 0 KB -