oj.uz

Submission #823719

# Submission time Handle Problem Language Result Execution time Memory
823719 2023-08-13T02:56:31 Z boyliguanhan Catfish Farm (IOI22_fish) C++17
35 / 100
 219 ms 12368 KB 
#include "fish.h"
 
#include <bits/stdc++.h>
using namespace std;
long long fish[301][301], dp[301][301], dp2[301][301], dpm[301][301], dpm2[301][301];
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for(int i = 0; i < M; i++)
        fish[X[i]][Y[i]+1]=W[i];
    for(int i = 0; i < N; i++)
        for(int j = 1; j <= N; j++)
            fish[i][j]+=fish[i][j-1];
    for(int l = 1; l < N; l++) {
        for(int i = 0; i <= N; i++) {
            for(int j = 0; j <= N; j++) {
                if(i<=j) {
                    dp[i][j] = dpm[j][N]+fish[l][j]-fish[l][i]; 
                } else {
                    dp[i][j] = dpm[j][j]+fish[l-1][i]-fish[l-1][j];
                    dp[i][j]=max(dp[i][j],dpm2[j][i]);
                    if(!j)
                        for(int k = j; k < i; k++)
                            dp[i][j] = max(dp[i][j], dp2[j][k]+fish[l-1][i]-fish[l-1][k]);
                }
            }
        }
        swap(dp, dp2);
        memset(dp, 0, sizeof dp);
        memcpy(dpm, dp2, sizeof dp2);
        memcpy(dpm2, dp2, sizeof dp2);
        for(int i = 0; i <= N; i++)
            for(int j = 1; j <= N; j++)
                dpm[i][j] = max(dpm[i][j-1], dpm[i][j]);
        for(int i = 0; i <= N; i++)
            for(int j = N; j--;)
                dpm2[i][j] = max(dpm2[i][j+1], dpm2[i][j]);
    }
    long long ans = 0;
    for(int i = 0; i <= N; i++)
        for(int j = 0; j <= N; j++)
            ans = max(ans, dp2[i][j]);
    return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 7084 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 2 ms 3028 KB Output is correct
2 Runtime error 43 ms 12368 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 2 ms 1876 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 3 ms 3028 KB Output is correct
2 Correct 3 ms 3156 KB Output is correct
3 Correct 2 ms 3124 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3028 KB Output is correct
9 Correct 38 ms 3412 KB Output is correct
10 Correct 190 ms 3924 KB Output is correct
11 Correct 43 ms 3412 KB Output is correct
12 Correct 187 ms 3868 KB Output is correct
13 Correct 12 ms 3284 KB Output is correct
14 Correct 188 ms 3860 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3028 KB Output is correct
2 Correct 3 ms 3156 KB Output is correct
3 Correct 2 ms 3124 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3028 KB Output is correct
9 Correct 38 ms 3412 KB Output is correct
10 Correct 190 ms 3924 KB Output is correct
11 Correct 43 ms 3412 KB Output is correct
12 Correct 187 ms 3868 KB Output is correct
13 Correct 12 ms 3284 KB Output is correct
14 Correct 188 ms 3860 KB Output is correct
15 Correct 185 ms 3796 KB Output is correct
16 Correct 12 ms 3284 KB Output is correct
17 Correct 200 ms 5692 KB Output is correct
18 Correct 203 ms 5660 KB Output is correct
19 Correct 207 ms 5652 KB Output is correct
20 Correct 207 ms 5656 KB Output is correct
21 Correct 211 ms 5640 KB Output is correct
22 Correct 219 ms 7460 KB Output is correct
23 Correct 202 ms 4188 KB Output is correct
24 Correct 194 ms 5040 KB Output is correct
25 Correct 188 ms 3876 KB Output is correct
26 Correct 189 ms 4164 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3028 KB Output is correct
2 Correct 3 ms 3156 KB Output is correct
3 Correct 2 ms 3124 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3028 KB Output is correct
9 Correct 38 ms 3412 KB Output is correct
10 Correct 190 ms 3924 KB Output is correct
11 Correct 43 ms 3412 KB Output is correct
12 Correct 187 ms 3868 KB Output is correct
13 Correct 12 ms 3284 KB Output is correct
14 Correct 188 ms 3860 KB Output is correct
15 Correct 185 ms 3796 KB Output is correct
16 Correct 12 ms 3284 KB Output is correct
17 Correct 200 ms 5692 KB Output is correct
18 Correct 203 ms 5660 KB Output is correct
19 Correct 207 ms 5652 KB Output is correct
20 Correct 207 ms 5656 KB Output is correct
21 Correct 211 ms 5640 KB Output is correct
22 Correct 219 ms 7460 KB Output is correct
23 Correct 202 ms 4188 KB Output is correct
24 Correct 194 ms 5040 KB Output is correct
25 Correct 188 ms 3876 KB Output is correct
26 Correct 189 ms 4164 KB Output is correct
27 Runtime error 1 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 2 ms 1876 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 23 ms 7084 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -