oj.uz

Submission #1022937

# Submission time Handle Problem Language Result Execution time Memory
1022937 2024-07-14T07:47:22 Z vjudge1 Catfish Farm (IOI22_fish) C++17
52 / 100
 1000 ms 298576 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second

const int MAXN = 300100;
int n, w[MAXN], m;
pii a[MAXN];

namespace A{
    ll solve(){
        ll ans = 0;
        for(int i=1; i<=m; i++){
            ans += w[i];
        }
        return ans;
    }
}

namespace B{
    ll d[3001][3001];
    ll dp[3001][3001];
    ll pref[3001][3001];
    ll ddp[3001][3001];
    ll suf[3001];
    ll solve(){
        for(int i=1; i<=m; i++){
            d[a[i].ff][a[i].ss] += w[i];
        }
        for(int i=1; i<=n; i++){
            dp[0][i] = -1e18;
            ddp[0][i] = -1e18;
        }
        dp[0][0] = 0;
        ddp[0][0] = 0;
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                pref[i][j] = pref[i][j - 1] + d[i][j];
            }
            ll mx = -1e18;
            for(int j=n; j>=0; j--){
                mx = max(mx, dp[i-1][j] + pref[i][j]);
                suf[j] = mx;
            }
            ll pddp = -1e18, pdp = -1e18;
            mx = -1e18;
            for(int j=0; j<=n; j++) mx = max(mx, dp[i-1][j]);
            for(int j=0; j<=n; j++){
                ddp[i][j] = mx;
                dp[i][j] = 0;
                pddp = max(pddp, ddp[i-1][j]-pref[i-1][j]);
                ddp[i][j] = max(ddp[i][j], pddp + pref[i-1][j]);
                dp[i][j] = ddp[i][j];
                dp[i][j] = max(dp[i][j], suf[j]-pref[i][j]);
                pdp = max(pdp, ddp[i-1][j]-pref[i-1][j]);
                dp[i][j] = max(dp[i][j], pdp+pref[i-1][j]);
            }
        }
        //for(int i=1; i<=n; i++){
        //    for(int j=0; j<=n; j++){
        //        cout<<dp[i][j]<<' ';
        //    }
        //    cout<<'\n';
        //}
        ll ans = 0;
        for(int i=0; i<=n; i++) ans = max(ans, dp[n][i]);
        return ans;
    }
}

long long max_weights(int N, int M, vector<int> X, vector<int> Y,
                      vector<int> W) {
    n = N;
    m = M;
    for(int i=1; i<=m; i++){
        a[i] = {X[i-1]+1, Y[i-1]+1};
    }
    for(int i=1; i<=m; i++){
        w[i] = W[i-1];
    }
    int ok1 = 1;
    for(int i=1; i<=m; i++){
        ok1 &= (a[i].ff % 2 == 0);
    }
    if(ok1) return A::solve();
    return B::solve();
    return 0;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Execution timed out 1095 ms 198024 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2468 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 4 ms 9564 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 1 ms 3676 KB Output is correct
14 Correct 4 ms 9308 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2468 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 4 ms 9564 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 1 ms 3676 KB Output is correct
14 Correct 4 ms 9308 KB Output is correct
15 Correct 4 ms 13144 KB Output is correct
16 Correct 2 ms 5720 KB Output is correct
17 Correct 13 ms 10844 KB Output is correct
18 Correct 12 ms 10588 KB Output is correct
19 Correct 12 ms 12892 KB Output is correct
20 Correct 12 ms 14476 KB Output is correct
21 Correct 12 ms 12892 KB Output is correct
22 Correct 21 ms 14172 KB Output is correct
23 Correct 6 ms 12380 KB Output is correct
24 Correct 13 ms 12832 KB Output is correct
25 Correct 6 ms 11352 KB Output is correct
26 Correct 6 ms 11804 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2468 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 4 ms 9564 KB Output is correct
11 Correct 2 ms 5468 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 1 ms 3676 KB Output is correct
14 Correct 4 ms 9308 KB Output is correct
15 Correct 4 ms 13144 KB Output is correct
16 Correct 2 ms 5720 KB Output is correct
17 Correct 13 ms 10844 KB Output is correct
18 Correct 12 ms 10588 KB Output is correct
19 Correct 12 ms 12892 KB Output is correct
20 Correct 12 ms 14476 KB Output is correct
21 Correct 12 ms 12892 KB Output is correct
22 Correct 21 ms 14172 KB Output is correct
23 Correct 6 ms 12380 KB Output is correct
24 Correct 13 ms 12832 KB Output is correct
25 Correct 6 ms 11352 KB Output is correct
26 Correct 6 ms 11804 KB Output is correct
27 Correct 130 ms 227924 KB Output is correct
28 Correct 56 ms 40724 KB Output is correct
29 Correct 210 ms 231764 KB Output is correct
30 Correct 203 ms 274256 KB Output is correct
31 Correct 205 ms 274768 KB Output is correct
32 Correct 76 ms 34896 KB Output is correct
33 Correct 206 ms 298376 KB Output is correct
34 Correct 233 ms 298576 KB Output is correct
35 Correct 152 ms 235504 KB Output is correct
36 Correct 194 ms 245076 KB Output is correct

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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