oj.uz

Submission #1042164

# Submission time Handle Problem Language Result Execution time Memory
1042164 2024-08-02T15:33:05 Z VMaksimoski008 Catfish Farm (IOI22_fish) C++17
52 / 100
 315 ms 507124 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], pmx2[3005][3005], smx2[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] = pmx2[i][j] = smx2[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=1; i<=N; i++) pmx2[1][i] = max(pmx2[1][i-1], max(dp[1][i][0], dp[1][i][1]));
    for(int i=N-1; i>=0; i--) smx2[1][i] = max(smx2[i][i+1], max(dp[1][i][0], dp[1][i][1]));

    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] });
            if(i >= 3) dp[i][j][0] = max({ dp[i][j][0], pmx2[i-2][j] + pref[i-1][j], smx2[i-2][j] + pref[i-1][j] });
            if(i >= 3) dp[i][j][1] = max({ dp[i][j][1], pmx2[i-2][j] + pref[i-1][j], smx2[i-2][j] + pref[i-1][j] });

            if(j) pmx1[i][j] = pmx1[i][j-1];
            if(j) pmx2[i][j] = pmx2[i][j-1];
            pmx1[i][j] = max(pmx1[i][j], dp[i][j][1] - pref[i][j]);
            pmx2[i][j] = max(pmx2[i][j], max(dp[i][j][0], dp[i][j][1]));
        }

        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]);
        smx2[i][N] = max(dp[i][N][0], dp[i][N][1]);
        for(int j=N-1; j>=0; j--) smx2[i][j] = max(smx2[i][j+1], max(dp[i][j][0], dp[i][j][1]));
    }

    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 174 ms 150224 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 6492 KB Output is correct
2 Runtime error 211 ms 153944 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 171 ms 146260 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 6488 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 6 ms 19036 KB Output is correct
11 Correct 3 ms 12380 KB Output is correct
12 Correct 6 ms 17284 KB Output is correct
13 Correct 2 ms 10076 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 6 ms 19036 KB Output is correct
11 Correct 3 ms 12380 KB Output is correct
12 Correct 6 ms 17284 KB Output is correct
13 Correct 2 ms 10076 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct
15 Correct 5 ms 16984 KB Output is correct
16 Correct 1 ms 8028 KB Output is correct
17 Correct 13 ms 19940 KB Output is correct
18 Correct 12 ms 20056 KB Output is correct
19 Correct 11 ms 19928 KB Output is correct
20 Correct 11 ms 18524 KB Output is correct
21 Correct 16 ms 18212 KB Output is correct
22 Correct 18 ms 20976 KB Output is correct
23 Correct 6 ms 19036 KB Output is correct
24 Correct 9 ms 17756 KB Output is correct
25 Correct 6 ms 19292 KB Output is correct
26 Correct 6 ms 17500 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 6 ms 19036 KB Output is correct
11 Correct 3 ms 12380 KB Output is correct
12 Correct 6 ms 17284 KB Output is correct
13 Correct 2 ms 10076 KB Output is correct
14 Correct 6 ms 18780 KB Output is correct
15 Correct 5 ms 16984 KB Output is correct
16 Correct 1 ms 8028 KB Output is correct
17 Correct 13 ms 19940 KB Output is correct
18 Correct 12 ms 20056 KB Output is correct
19 Correct 11 ms 19928 KB Output is correct
20 Correct 11 ms 18524 KB Output is correct
21 Correct 16 ms 18212 KB Output is correct
22 Correct 18 ms 20976 KB Output is correct
23 Correct 6 ms 19036 KB Output is correct
24 Correct 9 ms 17756 KB Output is correct
25 Correct 6 ms 19292 KB Output is correct
26 Correct 6 ms 17500 KB Output is correct
27 Correct 238 ms 494416 KB Output is correct
28 Correct 55 ms 61780 KB Output is correct
29 Correct 297 ms 506996 KB Output is correct
30 Correct 290 ms 506960 KB Output is correct
31 Correct 295 ms 506992 KB Output is correct
32 Correct 66 ms 47952 KB Output is correct
33 Correct 293 ms 506964 KB Output is correct
34 Correct 315 ms 506968 KB Output is correct
35 Correct 266 ms 499024 KB Output is correct
36 Correct 287 ms 507124 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 171 ms 146260 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 174 ms 150224 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -