oj.uz

Submission #1035782

# Submission time Handle Problem Language Result Execution time Memory
1035782 2024-07-26T15:26:22 Z Andrey Catfish Farm (IOI22_fish) C++17
52 / 100
 214 ms 319520 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(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            haha[i][j]+=haha[i][j-1];
        }
    }
    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;
        }
        long long x = -LLONG_MAX/2;
        for(long long j = n; j >= 0; j--) {
            x = max(x,max(dp[i-1][j][2],dp[i-1][j][0])+haha[i][j]);
            dp[i][j][2] = x-haha[i][j];
        }
        for(long long j = 0; j <= n; j++) {
            dp[i][j][1] = max(dp[i-1][j][0],dp[i-1][j][2])+haha[i][j];
        }
        x = -LLONG_MAX/2;
        for(long long j = 0; j <= n; j++) {
            x = max(x,dp[i-1][j][1]-haha[i-1][j]);
            x = max(x,dp[i-1][j][0]-haha[i-1][j]);
            dp[i][j][0] = max(dp[i][j][0],x+haha[i-1][j]);
        }
        x = -LLONG_MAX/2;
        for(long long j = n; j >= 0; j--) {
            x = max(x,dp[i-1][j][1]);
            dp[i][j][0] = max(dp[i][j][0],x);
        }
        /*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;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:29:19: warning: unused variable 'br' [-Wunused-variable]
   29 |         long long br = 0;
      |                   ^~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 153 ms 199508 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 344 KB Output is correct
2 Runtime error 168 ms 202692 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 152 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 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 1 ms 2396 KB Output is correct
10 Correct 3 ms 5632 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 3 ms 5596 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 5724 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 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 1 ms 2396 KB Output is correct
10 Correct 3 ms 5632 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 3 ms 5596 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 5724 KB Output is correct
15 Correct 3 ms 5720 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 10 ms 7516 KB Output is correct
18 Correct 10 ms 7368 KB Output is correct
19 Correct 11 ms 7516 KB Output is correct
20 Correct 10 ms 7516 KB Output is correct
21 Correct 10 ms 7516 KB Output is correct
22 Correct 18 ms 9308 KB Output is correct
23 Correct 5 ms 5980 KB Output is correct
24 Correct 8 ms 6904 KB Output is correct
25 Correct 3 ms 5724 KB Output is correct
26 Correct 4 ms 5980 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 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 1 ms 2396 KB Output is correct
10 Correct 3 ms 5632 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 3 ms 5596 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 5724 KB Output is correct
15 Correct 3 ms 5720 KB Output is correct
16 Correct 1 ms 1112 KB Output is correct
17 Correct 10 ms 7516 KB Output is correct
18 Correct 10 ms 7368 KB Output is correct
19 Correct 11 ms 7516 KB Output is correct
20 Correct 10 ms 7516 KB Output is correct
21 Correct 10 ms 7516 KB Output is correct
22 Correct 18 ms 9308 KB Output is correct
23 Correct 5 ms 5980 KB Output is correct
24 Correct 8 ms 6904 KB Output is correct
25 Correct 3 ms 5724 KB Output is correct
26 Correct 4 ms 5980 KB Output is correct
27 Correct 152 ms 306772 KB Output is correct
28 Correct 48 ms 32848 KB Output is correct
29 Correct 206 ms 319328 KB Output is correct
30 Correct 207 ms 319200 KB Output is correct
31 Correct 211 ms 319520 KB Output is correct
32 Correct 56 ms 26484 KB Output is correct
33 Correct 214 ms 319372 KB Output is correct
34 Correct 204 ms 319316 KB Output is correct
35 Correct 169 ms 311380 KB Output is correct
36 Correct 206 ms 319316 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 152 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 153 ms 199508 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -