oj.uz

Submission #1070746

# Submission time Handle Problem Language Result Execution time Memory
1070746 2024-08-22T17:42:06 Z beaconmc Catfish Farm (IOI22_fish) C++17
52 / 100
 1000 ms 722024 KB 
    // #pragma GCC optimize("O3,unroll-loops")
    // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
    #include "fish.h"
     
    #include <bits/stdc++.h>
    using namespace std;
     
    typedef long long ll;
    #define FOR(i,x,y) for(ll i=x; i<y; i++)
    #define FORNEG(i,x,y) for(ll i=x; i>y; i--)
     
    const ll maxn = 3005;
     
     
    bool fish[maxn][maxn];
    ll weights[maxn][maxn];
     
    ll p[maxn][maxn];
     
     
     
    ll dp[maxn][maxn][2];
     
    ll pref[maxn][maxn][2];
    ll pref2[maxn][maxn][2];
    ll suff[maxn][maxn][2];
     
     
    long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                          std::vector<int> W) {
     
     
        FOR(i,0,M){
            Y[i]++;
            fish[X[i]][Y[i]] = true;
            weights[X[i]][Y[i]] = W[i];
        }
        FOR(i,0,maxn){
            p[i][0] = 0;
            FOR(j,1,maxn){
                p[i][j] = p[i][j-1] + weights[i][j];
            }
        }
     
        FOR(i,1,N+1){
            FOR(j,0,N+1){
                FOR(k,0,2){
     
     
                    if (i<2) continue;
                    ll temp = 0;
                    ll add = 0;
                    if (k==0){
                        temp = max(temp, suff[i-1][j+1][0] - p[i-1][j]);
                        temp = max(temp, suff[i-1][j+1][1] - p[i-1][j]);
                        // FOR(p,j+1,N+1){
                        //     if (fish[i-1][p]) add += weights[i-1][p];
                        //     temp = max(temp, dp[i-1][p][0] + add);
                        //     temp = max(temp, dp[i-1][p][1] + add);
                        // }
                    }else{
                        temp = max(temp, pref[i-1][j][0]);
                        temp = max(temp, pref[i-1][j][1] + p[i-2][j]);
                        // FOR(p,0,j+1) if (fish[i-2][p]) add += weights[i-2][p];
                        // FOR(p,0,j+1){
                        //     if (fish[i-2][p]) add -= weights[i-2][p];
                        //     temp = max(temp, dp[i-1][p][0]);
                        //     temp = max(temp, dp[i-1][p][1] + add);
                        // }
                    }
                    dp[i][j][k] = temp;
                }
            }
     
            FOR(k,0,2){
                ll tempadd = 0;
                ll tempadd2 = 0;
     
     
                FOR(j,0,N+1){
                    tempadd += weights[i][j];
                    suff[i][j][k] = dp[i][j][k]+tempadd;
                }
     
                FOR(j,0,N+1){
                    if (i>1) tempadd2 -= weights[i-1][j];
                    pref[i][j][k] = dp[i][j][k] + tempadd2;
                    pref2[i][j][k] = dp[i][j][k];
                }
     
                FOR(j,1,N+1){
                    pref[i][j][k] = max(pref[i][j][k], pref[i][j-1][k]);
                    pref2[i][j][k] = max(pref2[i][j][k], pref2[i][j-1][k]);
                }
     
                FORNEG(j,N,-1){
                    suff[i][j][k] = max(suff[i][j][k], suff[i][j+1][k]);
                }
            }
     
        }
     
     
        ll ans = 0;
        FOR(i,0,N+1) FOR(j,0,N+1)FOR(k,0,2){
            //if (dp[i][j][k]==305) cout << i << " " << j << " " << k << endl;
            ans = max(ans, dp[i][j][k]);
        }
        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:52:24: warning: unused variable 'add' [-Wunused-variable]
   52 |                     ll add = 0;
      |                        ^~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 74328 KB Output is correct
2 Execution timed out 1064 ms 279892 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 1094 ms 260220 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 74328 KB Output is correct
2 Correct 13 ms 76636 KB Output is correct
3 Correct 13 ms 74332 KB Output is correct
4 Correct 13 ms 74300 KB Output is correct
5 Correct 14 ms 74300 KB Output is correct
6 Correct 13 ms 74412 KB Output is correct
7 Correct 12 ms 74332 KB Output is correct
8 Correct 13 ms 74332 KB Output is correct
9 Correct 17 ms 82268 KB Output is correct
10 Correct 21 ms 93008 KB Output is correct
11 Correct 17 ms 82420 KB Output is correct
12 Correct 19 ms 93016 KB Output is correct
13 Correct 13 ms 77916 KB Output is correct
14 Correct 21 ms 93020 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 74328 KB Output is correct
2 Correct 13 ms 76636 KB Output is correct
3 Correct 13 ms 74332 KB Output is correct
4 Correct 13 ms 74300 KB Output is correct
5 Correct 14 ms 74300 KB Output is correct
6 Correct 13 ms 74412 KB Output is correct
7 Correct 12 ms 74332 KB Output is correct
8 Correct 13 ms 74332 KB Output is correct
9 Correct 17 ms 82268 KB Output is correct
10 Correct 21 ms 93008 KB Output is correct
11 Correct 17 ms 82420 KB Output is correct
12 Correct 19 ms 93016 KB Output is correct
13 Correct 13 ms 77916 KB Output is correct
14 Correct 21 ms 93020 KB Output is correct
15 Correct 23 ms 93016 KB Output is correct
16 Correct 16 ms 77912 KB Output is correct
17 Correct 28 ms 94292 KB Output is correct
18 Correct 26 ms 93980 KB Output is correct
19 Correct 29 ms 94172 KB Output is correct
20 Correct 36 ms 94032 KB Output is correct
21 Correct 31 ms 94044 KB Output is correct
22 Correct 35 ms 95048 KB Output is correct
23 Correct 20 ms 93276 KB Output is correct
24 Correct 26 ms 93780 KB Output is correct
25 Correct 21 ms 93168 KB Output is correct
26 Correct 20 ms 93276 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 74328 KB Output is correct
2 Correct 13 ms 76636 KB Output is correct
3 Correct 13 ms 74332 KB Output is correct
4 Correct 13 ms 74300 KB Output is correct
5 Correct 14 ms 74300 KB Output is correct
6 Correct 13 ms 74412 KB Output is correct
7 Correct 12 ms 74332 KB Output is correct
8 Correct 13 ms 74332 KB Output is correct
9 Correct 17 ms 82268 KB Output is correct
10 Correct 21 ms 93008 KB Output is correct
11 Correct 17 ms 82420 KB Output is correct
12 Correct 19 ms 93016 KB Output is correct
13 Correct 13 ms 77916 KB Output is correct
14 Correct 21 ms 93020 KB Output is correct
15 Correct 23 ms 93016 KB Output is correct
16 Correct 16 ms 77912 KB Output is correct
17 Correct 28 ms 94292 KB Output is correct
18 Correct 26 ms 93980 KB Output is correct
19 Correct 29 ms 94172 KB Output is correct
20 Correct 36 ms 94032 KB Output is correct
21 Correct 31 ms 94044 KB Output is correct
22 Correct 35 ms 95048 KB Output is correct
23 Correct 20 ms 93276 KB Output is correct
24 Correct 26 ms 93780 KB Output is correct
25 Correct 21 ms 93168 KB Output is correct
26 Correct 20 ms 93276 KB Output is correct
27 Correct 323 ms 708176 KB Output is correct
28 Correct 79 ms 145232 KB Output is correct
29 Correct 423 ms 702336 KB Output is correct
30 Correct 397 ms 719952 KB Output is correct
31 Correct 388 ms 719188 KB Output is correct
32 Correct 87 ms 125296 KB Output is correct
33 Correct 384 ms 722024 KB Output is correct
34 Correct 385 ms 722004 KB Output is correct
35 Correct 347 ms 711252 KB Output is correct
36 Correct 428 ms 677712 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 260220 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 1055 ms 278356 KB Time limit exceeded
2 Halted 0 ms 0 KB -