oj.uz

Submission #1042151

# Submission time Handle Problem Language Result Execution time Memory
1042151 2024-08-02T15:24:49 Z VMaksimoski008 Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 217428 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll pref[3005][3005], dp[3005][3005][2], pmx1[3005][3005], smx1[3005][3005];
 
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for(int i=0; i<M; i++) pref[X[i]+1][Y[i]+1] += W[i];
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++) pref[i][j] += pref[i][j-1];
    for(int i=1; i<=N; i++)
        for(int j=0; j<=N; j++) pmx1[i][j] = smx1[i][j] = -1e18;

    pmx1[1][0] = dp[1][0][1] - pref[1][0];
    smx1[1][N] = max(dp[1][N][0], dp[1][N][1]) + pref[2][N];
    for(int i=1; i<=N; i++) pmx1[1][i] = max(pmx1[1][i-1], dp[1][i][1] - pref[1][i]);
    for(int i=N-1; i>=0; i--) smx1[1][i] = max(smx1[1][i+1], max(dp[1][i][0], dp[1][i][1]) + pref[2][i]);

    for(int i=2; i<=N; i++) {
        for(int j=0; j<=N; j++) {
            dp[i][j][0] = max(dp[i][j][0], smx1[i-1][j] - pref[i][j]);
            dp[i][j][1] = max({ dp[i][j][1], pmx1[i-1][j] + pref[i-1][j] });
            for(int k=0; k<=N; k++) {
                if(i >= 3) dp[i][j][0] = max(dp[i][j][0], max(dp[i-2][k][0], dp[i-2][k][1]) + max(pref[i-1][j], pref[i-1][k]));
                if(i >= 3) dp[i][j][1] = max(dp[i][j][1], max(dp[i-2][k][0], dp[i-2][k][1]) + max(pref[i-1][j], pref[i-1][k]));
            }
            if(j) pmx1[i][j] = pmx1[i][j-1];
            pmx1[i][j] = max(pmx1[i][j], dp[i][j][1] - pref[i][j]);
        }

        smx1[i][N] = max(dp[i][N][0], dp[i][N][1]) + pref[i+1][N];
        for(int j=N-1; j>=0; j--) smx1[i][j] = max(smx1[i][j+1], max(dp[i][j][0], dp[i][j][1]) + pref[i+1][j]);
    }

    ll ans = 0;
    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++) ans = max({ ans, dp[i][j][0] + pref[i+1][j], dp[i][j][1] + pref[i+1][j] });
    return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 241 ms 151892 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 4440 KB Output is correct
2 Runtime error 253 ms 157124 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 252 ms 146680 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 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 7 ms 17756 KB Output is correct
10 Correct 41 ms 29780 KB Output is correct
11 Correct 7 ms 17752 KB Output is correct
12 Correct 43 ms 29712 KB Output is correct
13 Correct 2 ms 11096 KB Output is correct
14 Correct 41 ms 29572 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 7 ms 17756 KB Output is correct
10 Correct 41 ms 29780 KB Output is correct
11 Correct 7 ms 17752 KB Output is correct
12 Correct 43 ms 29712 KB Output is correct
13 Correct 2 ms 11096 KB Output is correct
14 Correct 41 ms 29572 KB Output is correct
15 Correct 41 ms 29616 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 48 ms 31444 KB Output is correct
18 Correct 48 ms 29524 KB Output is correct
19 Correct 48 ms 31568 KB Output is correct
20 Correct 47 ms 31572 KB Output is correct
21 Correct 48 ms 31572 KB Output is correct
22 Correct 56 ms 33352 KB Output is correct
23 Correct 41 ms 30032 KB Output is correct
24 Correct 46 ms 30804 KB Output is correct
25 Correct 45 ms 29612 KB Output is correct
26 Correct 42 ms 30036 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 0 ms 4444 KB Output is correct
4 Correct 0 ms 4444 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 7 ms 17756 KB Output is correct
10 Correct 41 ms 29780 KB Output is correct
11 Correct 7 ms 17752 KB Output is correct
12 Correct 43 ms 29712 KB Output is correct
13 Correct 2 ms 11096 KB Output is correct
14 Correct 41 ms 29572 KB Output is correct
15 Correct 41 ms 29616 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 48 ms 31444 KB Output is correct
18 Correct 48 ms 29524 KB Output is correct
19 Correct 48 ms 31568 KB Output is correct
20 Correct 47 ms 31572 KB Output is correct
21 Correct 48 ms 31572 KB Output is correct
22 Correct 56 ms 33352 KB Output is correct
23 Correct 41 ms 30032 KB Output is correct
24 Correct 46 ms 30804 KB Output is correct
25 Correct 45 ms 29612 KB Output is correct
26 Correct 42 ms 30036 KB Output is correct
27 Execution timed out 1080 ms 217428 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 252 ms 146680 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 241 ms 151892 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -