oj.uz

Submission #639375

# Submission time Handle Problem Language Result Execution time Memory
639375 2022-09-09T17:47:38 Z SlavicG Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

const ll inf = 1e16;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    vector<vector<ll>> p(n, vector<ll>(n, 0));
    for(int i = 0; i < m; ++i) {
        p[x[i]][y[i]] += w[i];
    }
    for(int i = 0; i < n; ++i) {
        for(int j = 1; j < n; ++j) {
            p[i][j] += p[i][j - 1];
        }
    }

    vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(n + 1, vector<ll>(2, -inf)));
    for(int i = 0; i <= n; ++i) {
        dp[0][i][0] = dp[0][i][1] = 0;
    }

    //0 - increasing, 1 - decreasing
    for(int i = 1; i < n; ++i) {
        for(int lastlen = 0; lastlen <= n; ++lastlen) {
            dp[i][0][0] = max({dp[i][0][0], dp[i - 1][lastlen][0], dp[i - 1][lastlen][1]});
            dp[i][0][1] = max({dp[i][0][1], dp[i - 1][lastlen][0], dp[i - 1][lastlen][1]});
            if(lastlen) {
                dp[i][0][1] = max(dp[i][0][1], dp[i - 1][lastlen][1] + p[i][lastlen - 1]);
                dp[i][0][1] = max(dp[i][0][1], dp[i - 1][lastlen][0] + p[i][lastlen - 1]);
            }
            for(int curlen = 1; curlen <= n; ++curlen) {
                if(curlen >= lastlen) {
                    dp[i][curlen][0] = max(dp[i][curlen][0], dp[i - 1][lastlen][0] + p[i - 1][curlen - 1] - (lastlen ? p[i - 1][lastlen - 1] : 0));
                }
                if(curlen <= lastlen) {
                    dp[i][curlen][1] = max(dp[i][curlen][1], dp[i - 1][lastlen][1] + p[i][lastlen - 1] - p[i][curlen - 1]);
                    dp[i][curlen][1] = max(dp[i][curlen][1], dp[i - 1][lastlen][0] + p[i][lastlen - 1] - p[i][curlen - 1]);
                }
            }
        }
    }
    ll ans = 0;
    for(int i = 0; i <= n; ++i) {
        ans = max({ans, dp[n - 1][i][0], dp[n - 1][i][1]});
    }
    return ans;
}
/*
5 4
0 2 5
1 1 2
4 4 1
3 3 3
*/

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 902 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 792 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 757 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 13 ms 1752 KB Output is correct
10 Correct 86 ms 5972 KB Output is correct
11 Correct 13 ms 1748 KB Output is correct
12 Correct 85 ms 6012 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 86 ms 5972 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 13 ms 1752 KB Output is correct
10 Correct 86 ms 5972 KB Output is correct
11 Correct 13 ms 1748 KB Output is correct
12 Correct 85 ms 6012 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 86 ms 5972 KB Output is correct
15 Correct 85 ms 5972 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 97 ms 7720 KB Output is correct
18 Correct 101 ms 7688 KB Output is correct
19 Correct 99 ms 7636 KB Output is correct
20 Correct 107 ms 7680 KB Output is correct
21 Correct 97 ms 7628 KB Output is correct
22 Correct 110 ms 9508 KB Output is correct
23 Correct 87 ms 6220 KB Output is correct
24 Correct 92 ms 7060 KB Output is correct
25 Correct 86 ms 6012 KB Output is correct
26 Correct 90 ms 6228 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 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 13 ms 1752 KB Output is correct
10 Correct 86 ms 5972 KB Output is correct
11 Correct 13 ms 1748 KB Output is correct
12 Correct 85 ms 6012 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 86 ms 5972 KB Output is correct
15 Correct 85 ms 5972 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 97 ms 7720 KB Output is correct
18 Correct 101 ms 7688 KB Output is correct
19 Correct 99 ms 7636 KB Output is correct
20 Correct 107 ms 7680 KB Output is correct
21 Correct 97 ms 7628 KB Output is correct
22 Correct 110 ms 9508 KB Output is correct
23 Correct 87 ms 6220 KB Output is correct
24 Correct 92 ms 7060 KB Output is correct
25 Correct 86 ms 6012 KB Output is correct
26 Correct 90 ms 6228 KB Output is correct
27 Execution timed out 1127 ms 564652 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 757 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 902 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -