oj.uz

Submission #634145

# Submission time Handle Problem Language Result Execution time Memory
634145 2022-08-23T21:59:51 Z Utaha Catfish Farm (IOI22_fish) C++17
35 / 100
 92 ms 14028 KB 
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

const int maxN = 305;

int n_col = 0;
const int max_height = maxN;
long long dp[maxN][3][max_height + 1];
long long prefix[maxN][max_height + 1];
const long long INF = 1e18;
const int UP = 0;
const int DOWN = 1;
const int STOP = 2;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    n_col = N + 2;

    for(int i = 0; i < M; i++) {
        prefix[X[i] + 1][Y[i] + 1] = W[i];
    }
    for(int i = 0; i < n_col; i++) {
        for(int j = 0; j < max_height; j++) {
            prefix[i][j + 1] += prefix[i][j];
        }
    }
    // for(int i = 0; i < n_col; i++) {
    //     for(int j = 0; j < prefix[i].size(); j++) {
    //         cout << prefix[i][j] << ' ';
    //     }
    //     cout<<'\n';
    // }

    for(int i = 0; i < n_col; i++) {
        for(int j = 0; j < 3; j++) {
            for(int k = 0; k <= max_height; k++) {
                // printf("%d %d %d %lld\n", i, j, k, dp[i][j][k]);
                if (i == 0) {
                    if (j != UP) {
                        dp[i][j][k] = -INF;
                    }
                    else {
                        dp[i][j][k] = 0;
                    }
                }
                if (i == n_col - 1) break;

                if (j == UP) {
                    for(int t = k; t <= max_height; t++) {
                        dp[i + 1][UP][t] = max(dp[i + 1][UP][t], dp[i][j][k] + prefix[i + 1][t] - prefix[i + 1][k]);
                        // printf("DEBUG: %d %d %lld\n",i, t, dp[i + 1][UP][t]);
                    }
                    if (k == max_height) dp[i + 1][STOP][k] = max(dp[i + 1][STOP][k], dp[i][j][k]);
                }
                else if(j == STOP) {
                    if(k != max_height) {
                        continue;
                    }
                    for(int t = 0; t <= k; t++){
                        dp[i + 1][DOWN][t] = max(dp[i + 1][DOWN][t], dp[i][j][k] + prefix[i + 1][k] - prefix[i + 1][t]);
                    }
                    // down and immediately up
                    // maybe this case doesn't even exist...
                    for(int t = 0; t <= max_height; t++) {
                        const int height = max(t, k);

                        // printf("check: %d %d %lld %lld\n",i, t, dp[i][j][k], prefix[i + 1][height]);
                        dp[i + 1][UP][t] = max(dp[i + 1][UP][t], dp[i][j][k] + prefix[i + 1][height]);
                        // printf("DEBU2: %d %d %lld\n",i, t, dp[i + 1][UP][t]);
                    }
                }
                else{
                    for(int t = 0; t <= k; t++) {
                        dp[i + 1][DOWN][t] = max(dp[i + 1][DOWN][t], dp[i][j][k] + prefix[i + 1][k] - prefix[i + 1][t]);
                    }
                    // down and immediately up
                    // maybe this case doesn't even exist...
                    for(int t = 0; t <= max_height; t++) {
                        const int height = max(t, k);

                        // printf("check: %d %d %lld %lld\n",i, t, dp[i][j][k], prefix[i + 1][height]);
                        dp[i + 1][UP][t] = max(dp[i + 1][UP][t], dp[i][j][k] + prefix[i + 1][height]);
                        // printf("DEBU2: %d %d %lld\n",i, t, dp[i + 1][UP][t]);
                    }
                }
            }
        }
    }
    return dp[n_col - 1][DOWN][0];
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 28 ms 10088 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Runtime error 52 ms 14028 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 6228 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 35 ms 1688 KB Output is correct
10 Correct 69 ms 3196 KB Output is correct
11 Correct 35 ms 1748 KB Output is correct
12 Correct 82 ms 3216 KB Output is correct
13 Correct 18 ms 948 KB Output is correct
14 Correct 68 ms 3136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 35 ms 1688 KB Output is correct
10 Correct 69 ms 3196 KB Output is correct
11 Correct 35 ms 1748 KB Output is correct
12 Correct 82 ms 3216 KB Output is correct
13 Correct 18 ms 948 KB Output is correct
14 Correct 68 ms 3136 KB Output is correct
15 Correct 73 ms 3128 KB Output is correct
16 Correct 19 ms 980 KB Output is correct
17 Correct 81 ms 4228 KB Output is correct
18 Correct 80 ms 4124 KB Output is correct
19 Correct 83 ms 4172 KB Output is correct
20 Correct 84 ms 4160 KB Output is correct
21 Correct 80 ms 4196 KB Output is correct
22 Correct 92 ms 5332 KB Output is correct
23 Correct 70 ms 3312 KB Output is correct
24 Correct 76 ms 3868 KB Output is correct
25 Correct 72 ms 3248 KB Output is correct
26 Correct 76 ms 3320 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 35 ms 1688 KB Output is correct
10 Correct 69 ms 3196 KB Output is correct
11 Correct 35 ms 1748 KB Output is correct
12 Correct 82 ms 3216 KB Output is correct
13 Correct 18 ms 948 KB Output is correct
14 Correct 68 ms 3136 KB Output is correct
15 Correct 73 ms 3128 KB Output is correct
16 Correct 19 ms 980 KB Output is correct
17 Correct 81 ms 4228 KB Output is correct
18 Correct 80 ms 4124 KB Output is correct
19 Correct 83 ms 4172 KB Output is correct
20 Correct 84 ms 4160 KB Output is correct
21 Correct 80 ms 4196 KB Output is correct
22 Correct 92 ms 5332 KB Output is correct
23 Correct 70 ms 3312 KB Output is correct
24 Correct 76 ms 3868 KB Output is correct
25 Correct 72 ms 3248 KB Output is correct
26 Correct 76 ms 3320 KB Output is correct
27 Runtime error 2 ms 596 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 6228 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 28 ms 10088 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -