oj.uz

Submission #1070322

# Submission time Handle Problem Language Result Execution time Memory
1070322 2024-08-22T13:12:12 Z beaconmc Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 9256 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 = 305;


bool fish[maxn][maxn];
ll weights[maxn][maxn];


ll dp[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,maxn){
        FOR(j,0,maxn){
                fish[i][j] = false;
                dp[i][j][0] = 0;
                dp[i][j][1] = 0;
        }
    }

    FOR(i,0,M){
        Y[i]++;
        fish[X[i]][Y[i]] = true;
        weights[X[i]][Y[i]] = W[i];
    }

    FOR(i,2,N+1){
        FOR(j,0,N+1){
            FOR(k,0,2){
                ll temp = 0;
                ll add = 0;
                if (k==0){
                    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{
                    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;
            }
        }
    }


    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;







}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1031 ms 4444 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 2648 KB Output is correct
2 Execution timed out 1090 ms 9256 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 1059 ms 2652 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 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 6 ms 2652 KB Output is correct
10 Correct 57 ms 2652 KB Output is correct
11 Correct 9 ms 2652 KB Output is correct
12 Correct 39 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 39 ms 2652 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 6 ms 2652 KB Output is correct
10 Correct 57 ms 2652 KB Output is correct
11 Correct 9 ms 2652 KB Output is correct
12 Correct 39 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 39 ms 2652 KB Output is correct
15 Correct 41 ms 2648 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 47 ms 4444 KB Output is correct
18 Correct 47 ms 4520 KB Output is correct
19 Correct 47 ms 4440 KB Output is correct
20 Correct 47 ms 4420 KB Output is correct
21 Correct 45 ms 4444 KB Output is correct
22 Correct 51 ms 6228 KB Output is correct
23 Correct 43 ms 2904 KB Output is correct
24 Correct 51 ms 3676 KB Output is correct
25 Correct 39 ms 2648 KB Output is correct
26 Correct 47 ms 2908 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 6 ms 2652 KB Output is correct
10 Correct 57 ms 2652 KB Output is correct
11 Correct 9 ms 2652 KB Output is correct
12 Correct 39 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 39 ms 2652 KB Output is correct
15 Correct 41 ms 2648 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 47 ms 4444 KB Output is correct
18 Correct 47 ms 4520 KB Output is correct
19 Correct 47 ms 4440 KB Output is correct
20 Correct 47 ms 4420 KB Output is correct
21 Correct 45 ms 4444 KB Output is correct
22 Correct 51 ms 6228 KB Output is correct
23 Correct 43 ms 2904 KB Output is correct
24 Correct 51 ms 3676 KB Output is correct
25 Correct 39 ms 2648 KB Output is correct
26 Correct 47 ms 2908 KB Output is correct
27 Runtime error 3 ms 5208 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1059 ms 2652 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 1031 ms 4444 KB Time limit exceeded
2 Halted 0 ms 0 KB -