oj.uz

Submission #1035753

# Submission time Handle Problem Language Result Execution time Memory
1035753 2024-07-26T14:35:27 Z Andrey Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 200044 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;

long long haha[5001][5001];
long long dp[5001][5001][3];

long long max_weights(int n, int m, vector<int> x, vector<int> y,  vector<int> w) {
    for(long long i = 0; i <= n; i++) {
        for(long long j = 0; j <= n; j++) {
            haha[i][j] = 0;
        }
    }
    for(long long i = 0; i < m; i++) {
        haha[x[i]+1][y[i]+1] = w[i];
    }
    for(long long i = 0; i <= n; i++) {
        dp[0][i][0] = -LLONG_MAX/2;
        dp[0][i][1] = -LLONG_MAX/2;
        dp[0][i][2] = -LLONG_MAX/2;
    }
    dp[0][0][0] = 0;
    for(long long i = 1; i <= n; i++) {
        long long br = 0;
        for(int j = 0; j <= n; j++) {
            dp[i][j][0] = -LLONG_MAX/2;
            dp[i][j][1] = -LLONG_MAX/2;
            dp[i][j][2] = -LLONG_MAX/2;
        }
        for(long long j = 0; j <= n; j++) {
            br+=haha[i][j];
            long long sb1 = br,sb2 = 0;
            dp[i][j][1] = max(dp[i][j][1],max(dp[i-1][j][0],dp[i-1][j][2])+br);
            for(int k = 0; k <= n; k++) {
                if(k > j) {
                    sb1+=haha[i-1][k];
                    sb2+=haha[i-1][k];
                }
                else {
                    sb1-=haha[i][k];
                }
                if(k <= j) {
                    dp[i][k][2] = max(dp[i][k][2],max(dp[i-1][j][2],dp[i-1][j][0])+sb1);
                }
                else {
                    dp[i][k][0] = max(dp[i][k][0],dp[i-1][j][0]+sb1);
                }
                dp[i][k][0] = max(dp[i][k][0],dp[i-1][j][1]+sb2);
            }
        }
    }
    long long ans = 0;
    for(long long i = 0; i <= n; i++) {
        ans = max(ans,max(dp[n][i][0],dp[n][i][1]));
        ans = max(ans,dp[n][i][2]);
    }
    return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 158 ms 198076 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 0 ms 348 KB Output is correct
2 Runtime error 175 ms 200044 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 149 ms 196176 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 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 2224 KB Output is correct
10 Correct 38 ms 5744 KB Output is correct
11 Correct 6 ms 2420 KB Output is correct
12 Correct 45 ms 5668 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 37 ms 5620 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 2224 KB Output is correct
10 Correct 38 ms 5744 KB Output is correct
11 Correct 6 ms 2420 KB Output is correct
12 Correct 45 ms 5668 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 37 ms 5620 KB Output is correct
15 Correct 36 ms 5600 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 51 ms 7468 KB Output is correct
18 Correct 57 ms 7504 KB Output is correct
19 Correct 49 ms 7488 KB Output is correct
20 Correct 47 ms 7388 KB Output is correct
21 Correct 48 ms 7592 KB Output is correct
22 Correct 53 ms 9304 KB Output is correct
23 Correct 38 ms 5972 KB Output is correct
24 Correct 47 ms 6736 KB Output is correct
25 Correct 37 ms 5716 KB Output is correct
26 Correct 38 ms 5864 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 2224 KB Output is correct
10 Correct 38 ms 5744 KB Output is correct
11 Correct 6 ms 2420 KB Output is correct
12 Correct 45 ms 5668 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 37 ms 5620 KB Output is correct
15 Correct 36 ms 5600 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 51 ms 7468 KB Output is correct
18 Correct 57 ms 7504 KB Output is correct
19 Correct 49 ms 7488 KB Output is correct
20 Correct 47 ms 7388 KB Output is correct
21 Correct 48 ms 7592 KB Output is correct
22 Correct 53 ms 9304 KB Output is correct
23 Correct 38 ms 5972 KB Output is correct
24 Correct 47 ms 6736 KB Output is correct
25 Correct 37 ms 5716 KB Output is correct
26 Correct 38 ms 5864 KB Output is correct
27 Execution timed out 1037 ms 89428 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 149 ms 196176 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 158 ms 198076 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -