oj.uz

Submission #681799

# Submission time Handle Problem Language Result Execution time Memory
681799 2023-01-14T11:30:21 Z Jarif_Rahman Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W){
    vector<vector<ll>> v(n, vector<ll>(n+1, 0));
    for(int i = 0; i < m; i++) v[X[i]][Y[i]+1]+=W[i];

    vector<vector<ll>> dp_up(n, vector<ll>(n+1, 0)), dp_down = dp_up;

    for(int i = n-1; i >= 0; i--) for(int j = 0; j <= n; j++){
        if(i == n-1){
            dp_down[i][j] = 0;
            dp_up[i][j] = 0;
            continue;
        }

        ll s = 0;
        for(int k = j; k <= n; k++){
            if(k > j) s+=v[i][k];
            dp_up[i][j] = max(dp_up[i][j], s+dp_up[i+1][k]);
        }
        s = 0;
        for(int k = j; k >= 0; k--){
            if(k < j) s+=v[i+1][k+1];
            dp_down[i][j] = max(dp_down[i][j], s+dp_down[i+1][k]);
        }

        s = 0;
        for(int k = j+1; k <= n; k++) s+=v[i][k];
        dp_up[i][j] = max(dp_up[i][j], s+dp_down[i+1][n]);

        if(i+2 < n){
            s = 0;
            for(int k = 0; k <= j; k++) s+=v[i+1][k];
            for(int k = 0; k <= n; k++){
                if(k > j) s+=v[i+1][k];
                dp_down[i][j] = max(dp_down[i][j], s+dp_up[i+2][k]);
            }
            dp_down[i][j] = max(dp_down[i][j], s+dp_down[i+2][n]);
        }
    }

    return max(*max_element(dp_up[0].begin(), dp_up[0].end()), *max_element(dp_down[0].begin(), dp_down[0].end()));
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1072 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 815 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 740 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 212 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 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 10 ms 852 KB Output is correct
10 Correct 81 ms 2516 KB Output is correct
11 Correct 11 ms 852 KB Output is correct
12 Correct 77 ms 2480 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 77 ms 2468 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 10 ms 852 KB Output is correct
10 Correct 81 ms 2516 KB Output is correct
11 Correct 11 ms 852 KB Output is correct
12 Correct 77 ms 2480 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 77 ms 2468 KB Output is correct
15 Correct 81 ms 2388 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 92 ms 4288 KB Output is correct
18 Correct 87 ms 4180 KB Output is correct
19 Correct 90 ms 4148 KB Output is correct
20 Correct 86 ms 4152 KB Output is correct
21 Correct 86 ms 4232 KB Output is correct
22 Correct 97 ms 6064 KB Output is correct
23 Correct 77 ms 2732 KB Output is correct
24 Correct 85 ms 3540 KB Output is correct
25 Correct 75 ms 2388 KB Output is correct
26 Correct 81 ms 2772 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 216 KB Output is correct
9 Correct 10 ms 852 KB Output is correct
10 Correct 81 ms 2516 KB Output is correct
11 Correct 11 ms 852 KB Output is correct
12 Correct 77 ms 2480 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 77 ms 2468 KB Output is correct
15 Correct 81 ms 2388 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 92 ms 4288 KB Output is correct
18 Correct 87 ms 4180 KB Output is correct
19 Correct 90 ms 4148 KB Output is correct
20 Correct 86 ms 4152 KB Output is correct
21 Correct 86 ms 4232 KB Output is correct
22 Correct 97 ms 6064 KB Output is correct
23 Correct 77 ms 2732 KB Output is correct
24 Correct 85 ms 3540 KB Output is correct
25 Correct 75 ms 2388 KB Output is correct
26 Correct 81 ms 2772 KB Output is correct
27 Execution timed out 1106 ms 212056 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 740 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 Execution timed out 1072 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -