oj.uz

Submission #1022954

# Submission time Handle Problem Language Result Execution time Memory
1022954 2024-07-14T08:00:28 Z Otalp Catfish Farm (IOI22_fish) C++17
55 / 100
 1000 ms 292944 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;
    }
}

namespace C{
    ll d[5][100100];
    ll dp[5][100100];
    ll pref[5][100100];
    ll ddp[5][100100];
    ll suf[100100];
    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<=3; 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;
    int ok2 = 1, ok3 = 1;
    for(int i=1; i<=m; i++){
        ok1 &= (a[i].ff % 2 == 1);
        ok2 &= (a[i].ff < 2);
    }
    if(ok1) return A::solve();
    if(ok2) cout<<1/0;
    if(ok2) return C::solve();
    return B::solve();
    return 0;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:145:20: warning: division by zero [-Wdiv-by-zero]
  145 |     if(ok2) cout<<1/0;
      |                   ~^~
fish.cpp:139:18: warning: unused variable 'ok3' [-Wunused-variable]
  139 |     int ok2 = 1, ok3 = 1;
      |                  ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4952 KB Output is correct
2 Correct 17 ms 5468 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 54 ms 10864 KB Output is correct
6 Correct 56 ms 11648 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Runtime error 8 ms 4700 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 4696 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 7516 KB Output is correct
12 Correct 4 ms 9308 KB Output is correct
13 Correct 1 ms 3672 KB Output is correct
14 Correct 3 ms 9308 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 4696 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 7516 KB Output is correct
12 Correct 4 ms 9308 KB Output is correct
13 Correct 1 ms 3672 KB Output is correct
14 Correct 3 ms 9308 KB Output is correct
15 Correct 6 ms 9372 KB Output is correct
16 Correct 2 ms 3676 KB Output is correct
17 Correct 12 ms 10844 KB Output is correct
18 Correct 12 ms 10588 KB Output is correct
19 Correct 12 ms 11100 KB Output is correct
20 Correct 12 ms 11100 KB Output is correct
21 Correct 12 ms 12952 KB Output is correct
22 Correct 20 ms 12772 KB Output is correct
23 Correct 5 ms 10332 KB Output is correct
24 Correct 10 ms 11100 KB Output is correct
25 Correct 4 ms 9300 KB Output is correct
26 Correct 5 ms 9816 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 4444 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 4696 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 7516 KB Output is correct
12 Correct 4 ms 9308 KB Output is correct
13 Correct 1 ms 3672 KB Output is correct
14 Correct 3 ms 9308 KB Output is correct
15 Correct 6 ms 9372 KB Output is correct
16 Correct 2 ms 3676 KB Output is correct
17 Correct 12 ms 10844 KB Output is correct
18 Correct 12 ms 10588 KB Output is correct
19 Correct 12 ms 11100 KB Output is correct
20 Correct 12 ms 11100 KB Output is correct
21 Correct 12 ms 12952 KB Output is correct
22 Correct 20 ms 12772 KB Output is correct
23 Correct 5 ms 10332 KB Output is correct
24 Correct 10 ms 11100 KB Output is correct
25 Correct 4 ms 9300 KB Output is correct
26 Correct 5 ms 9816 KB Output is correct
27 Correct 166 ms 227924 KB Output is correct
28 Correct 52 ms 34640 KB Output is correct
29 Correct 187 ms 225616 KB Output is correct
30 Correct 204 ms 268368 KB Output is correct
31 Correct 204 ms 268880 KB Output is correct
32 Correct 60 ms 29012 KB Output is correct
33 Correct 207 ms 292944 KB Output is correct
34 Correct 212 ms 292944 KB Output is correct
35 Correct 158 ms 232528 KB Output is correct
36 Correct 191 ms 238704 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Runtime error 8 ms 4700 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 4952 KB Output is correct
2 Correct 17 ms 5468 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 54 ms 10864 KB Output is correct
6 Correct 56 ms 11648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Execution timed out 1074 ms 193620 KB Time limit exceeded
9 Halted 0 ms 0 KB -