oj.uz

Submission #1032984

# Submission time Handle Problem Language Result Execution time Memory
1032984 2024-07-24T11:36:36 Z Mr_Husanboy Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long
 
template<typename T>
int len(T &a){
    return a.size();
}
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
 
long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y,
                      std::vector<int> w) {
    vector<vector<ll>> s(n + 1, vector<ll> (n + 1));
 
    for(int i = 0; i < m; i ++) s[x[i] + 1][y[i] + 1] = w[i];
    for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) s[i][j] += s[i][j - 1];
 
    vector<vector<array<ll, 2>>> dp(n + 1, vector<array<ll, 2>>(n + 1));
    for(int j = 0; j <= n; j ++){
        dp[2][j][0] = s[1][j];
    }
    for(int i = 2; i <= n; i ++){
        ll mx = 0;
        for(int j = 0; j <= n; j ++){
            if(i > 2)
            for(int k = 0; k <= n; k ++){
                dp[i][j][0] = max(dp[i][j][0], max(dp[i - 2][k][0], dp[i - 2][k][1]) + s[i - 1][max(j, k)]);
            }
            dp[i][j][1] = dp[i][j][0];
            mx = max(mx, dp[i - 1][j][0] - s[i - 1][j]);
            dp[i][j][0] = max(dp[i][j][0], mx + s[i - 1][j]);
        }
        mx = 0;
        for(int j = n; j >= 0; j --){
            mx = max(mx, max(dp[i - 1][j][0], dp[i - 1][j][1]) - (s[i][n] - s[i][j]));
            dp[i][j][1] = max(dp[i][j][1], mx + (s[i][n] - s[i][j]));
        }
    }
    ll ans = 0;
    for(int i = 0; i <= n; i ++){
        ans = max({ans, dp[n][i][0], dp[n][i][1]});
        //cout << dp[n][i][0] << ' ' << dp[n][i][1] << endl;
    }
 
    return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 765 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Runtime error 807 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 776 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 30 ms 2396 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 37 ms 2392 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 29 ms 2396 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 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 30 ms 2396 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 37 ms 2392 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 29 ms 2396 KB Output is correct
15 Correct 29 ms 2396 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 39 ms 3680 KB Output is correct
18 Correct 36 ms 3420 KB Output is correct
19 Correct 37 ms 3420 KB Output is correct
20 Correct 39 ms 3540 KB Output is correct
21 Correct 37 ms 3420 KB Output is correct
22 Correct 45 ms 4700 KB Output is correct
23 Correct 31 ms 2800 KB Output is correct
24 Correct 38 ms 3160 KB Output is correct
25 Correct 29 ms 2396 KB Output is correct
26 Correct 31 ms 2652 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 30 ms 2396 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 37 ms 2392 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 29 ms 2396 KB Output is correct
15 Correct 29 ms 2396 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 39 ms 3680 KB Output is correct
18 Correct 36 ms 3420 KB Output is correct
19 Correct 37 ms 3420 KB Output is correct
20 Correct 39 ms 3540 KB Output is correct
21 Correct 37 ms 3420 KB Output is correct
22 Correct 45 ms 4700 KB Output is correct
23 Correct 31 ms 2800 KB Output is correct
24 Correct 38 ms 3160 KB Output is correct
25 Correct 29 ms 2396 KB Output is correct
26 Correct 31 ms 2652 KB Output is correct
27 Execution timed out 1047 ms 212044 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 776 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 Runtime error 765 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -