oj.uz

Submission #632692

# Submission time Handle Problem Language Result Execution time Memory
632692 2022-08-20T15:56:46 Z Olympia Catfish Farm (IOI22_fish) C++17
47 / 100
 1000 ms 2097152 KB 
#include <bits/stdc++.h>
//#include <fish.h>
using namespace std;
template<class T>
class SegmentTree {
public:

    SegmentTree (int N) {
        N = (1 << ((int)floor(log2(N - 1)) + 1));
        this->N = N;
        val.assign(2 * N, ID);
    }

    void update (int x, T y) {
        x += N - 1;
        val[x] = y;
        while (x != 0) {
            x = (x - 1)/2;
            val[x] = merge(val[2 * x + 1], val[2 * x + 2]);
        }
    }

    T query (int ind, const int l, const int r, int tl, int tr) {
        if (tl >= l && tr <= r) {
            return val[ind];
        }
        if (tr < l || tl > r) {
            return ID;
        }
        return merge(query(2 * ind + 1, l, r, tl, (tl + tr)/2), query(2 * ind + 2, l, r, (tl + tr)/2 + 1, tr));
    }

    T query (int l, int r) {
        return query(0, l, r, 0, N - 1);
    }
private:
    vector<T> val;
    T ID = -1e17;
    T merge (T x, T y) {
        return max(x, y);
    }
    int N;
};

int64_t max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for (int i = 0; i < X.size(); i++) {
        X[i]++;
    }
    bool all_even = true;
    for (int i: X) {
        if (i % 2 == 0) {
            all_even = false;
        }
    }
    if (all_even) {
        int64_t w= 0;
        for (int o: W) {
            w += o;
        }
        return w;
    }
    int my = 0;
    for (int y: Y) {
        my = max(my, y);
    }
    my ++;
    vector<pair<int,int64_t> > vec[N + 10];
    map<int,int64_t> s[N + 10];
    for (int i = 0; i < X.size(); i++) {
        vec[X[i]].push_back(make_pair(Y[i], W[i]));
        s[X[i]][Y[i]] = W[i];
    }
    int64_t pref[N + 10][my + 2];
    for (int i = 0; i <= N + 9; i++) {
        pref[i][0] = 0;
        for (int j = 1; j <= my + 1; j++) {
            pref[i][j] = pref[i][j - 1] + s[i][j - 1];
        }
    }
    int64_t dp[N + 1][my + 1][3];
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= my; j++) {
            for (int d = 0; d < 3; d++) {
                dp[i][j][d] = -1e17;
            }
        }
    }
    dp[0][0][0] = 0;
    //0 --> stagnant
    //1 --> increasing
    //2 --> decreasing
    for (int i = 1; i <= N; i++) {
        for (int p = 0; p <= my; p++) {
            dp[i][0][0] = max(dp[i][0][0], dp[i - 1][p][0]);
        }
        int64_t myMax1 = -1e17;
        int64_t myMax2 = dp[i - 1][0][0] - pref[i - 1][0];
        for (int cur = 1; cur <= my; cur++) {
            dp[i][cur][0] = max(dp[i][cur][0], max(dp[i - 1][cur][1], dp[i - 1][cur][2]));
            myMax1 = max(myMax1, dp[i - 1][cur][1] - pref[i][cur] - pref[i - 1][cur]);
            dp[i][cur][1] = max(dp[i][cur][1], myMax1 + pref[i + 1][cur] + pref[i - 1][cur]);
            for (int d = 1; d <= 2; d++) {
                myMax2 = max(myMax2, dp[i - 1][cur][0] - pref[i - 1][cur]);
                dp[i][cur][d] = max(dp[i][cur][d], myMax2 + pref[i - 1][cur] + pref[i + 1][cur]);
            }
        }
        int64_t myMax3 = -1e17, myMax4 = -1e17;
        for (int cur = my; cur >= 1; cur--) {
            myMax4 = max(myMax4, dp[i - 1][cur][2]);
            dp[i][cur][2] = max(dp[i][cur][2], myMax4 - pref[i][cur] + pref[i + 1][cur]);
            for (int d = 1; d <= 2; d++) {
                myMax3 = max(myMax3, dp[i - 1][cur][0]);
                dp[i][cur][d] = max(dp[i][cur][d], myMax3 + pref[i + 1][cur]);
            }
        }
    }
    int64_t myMax = 0;
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= my; j++) {
            for (int d = 0; d <= 2; d++) {
                myMax = max(myMax, dp[i][j][d]);
            }
        }
    }
    return myMax;
}

Compilation message

fish.cpp: In function 'int64_t max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for (int i = 0; i < X.size(); i++) {
      |                     ~~^~~~~~~~~~
fish.cpp:69:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for (int i = 0; i < X.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 3276 KB Output is correct
2 Correct 29 ms 4044 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 81 ms 11172 KB Output is correct
6 Correct 77 ms 7284 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Execution timed out 1114 ms 2097152 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 28 ms 26832 KB Output is correct
3 Correct 62 ms 27856 KB Output is correct
4 Correct 47 ms 28980 KB Output is correct
5 Correct 109 ms 32488 KB Output is correct
6 Correct 99 ms 33000 KB Output is correct
7 Correct 114 ms 33588 KB Output is correct
8 Correct 105 ms 33548 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 1 ms 220 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 480 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 1 ms 220 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 480 KB Output is correct
15 Correct 13 ms 8916 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 37 ms 11468 KB Output is correct
18 Correct 36 ms 12052 KB Output is correct
19 Correct 35 ms 11832 KB Output is correct
20 Correct 42 ms 11896 KB Output is correct
21 Correct 26 ms 7512 KB Output is correct
22 Correct 69 ms 14756 KB Output is correct
23 Correct 19 ms 9476 KB Output is correct
24 Correct 37 ms 10656 KB Output is correct
25 Correct 1 ms 852 KB Output is correct
26 Correct 19 ms 9348 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 1 ms 220 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 1 ms 220 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 472 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 480 KB Output is correct
15 Correct 13 ms 8916 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 37 ms 11468 KB Output is correct
18 Correct 36 ms 12052 KB Output is correct
19 Correct 35 ms 11832 KB Output is correct
20 Correct 42 ms 11896 KB Output is correct
21 Correct 26 ms 7512 KB Output is correct
22 Correct 69 ms 14756 KB Output is correct
23 Correct 19 ms 9476 KB Output is correct
24 Correct 37 ms 10656 KB Output is correct
25 Correct 1 ms 852 KB Output is correct
26 Correct 19 ms 9348 KB Output is correct
27 Execution timed out 1147 ms 848244 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 28 ms 26832 KB Output is correct
3 Correct 62 ms 27856 KB Output is correct
4 Correct 47 ms 28980 KB Output is correct
5 Correct 109 ms 32488 KB Output is correct
6 Correct 99 ms 33000 KB Output is correct
7 Correct 114 ms 33588 KB Output is correct
8 Correct 105 ms 33548 KB Output is correct
9 Runtime error 812 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 Correct 31 ms 3276 KB Output is correct
2 Correct 29 ms 4044 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 81 ms 11172 KB Output is correct
6 Correct 77 ms 7284 KB Output is correct
7 Correct 0 ms 300 KB Output is correct
8 Execution timed out 1114 ms 2097152 KB Time limit exceeded
9 Halted 0 ms 0 KB -