oj.uz

Submission #829294

# Submission time Handle Problem Language Result Execution time Memory
829294 2023-08-18T08:21:42 Z tolbi Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 1747924 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include "fish.h"
vector<vector<vector<ll>>> dp;
vector<vector<ll>> grid;
int N;
long long f(int x, int y, int flag){
    if (dp[x][y][flag]!=-1) return dp[x][y][flag];
    if (flag==1){
        dp[x][y][flag]=0;
        if (y<N){
            ll crr = 0;
            if (x>0) crr = grid[x-1][y];
            dp[x][y][flag]=crr+f(x,y+1,1);
        }
        if (x+1<N){
            dp[x][y][flag]=max(dp[x][y][flag],f(x+1,y,1));
            dp[x][y][flag]=max(dp[x][y][flag],f(x+1,y,0));
        }
    }
    else if (flag==0){
        dp[x][y][flag]=0;
        if (y-1>=0){
            dp[x][y][flag]=grid[x][y-1]+f(x,y-1,0);
        }
        if (x+1<N){
            dp[x][y][flag]=max(dp[x][y][flag],f(x+1,y,0));
            if (y==0){
                dp[x][y][flag]=max(dp[x][y][flag],f(x+1,y,2));
            }
        }
    }
    else {
        dp[x][y][flag]=0;
        if (y<N){
            dp[x][y][flag]=f(x,y+1,2);
        }
        if (x+1<N){
            dp[x][y][flag]=max(dp[x][y][flag],f(x+1,y,1));
            dp[x][y][flag]=max(dp[x][y][flag],f(x+1,y,0));
        }
    }
    if (flag!=0 && x+2<N){
        dp[x][y][flag]=max(dp[x][y][flag],f(x+2,0,1));
    }
    return dp[x][y][flag];
};

long long max_weights(int _N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    N=_N;
    dp.resize(N,vector<vector<ll>>(N+1,vector<ll>(3,-1)));
    grid.resize(N,vector<ll>(N+1,0));
    for (int i = 0; i < M; ++i)
    {
        grid[X[i]][Y[i]]=W[i];
    }
    //0 decreasing
    //1 increasing
    //2 increasing, \
    but forbidden to profit from back
    return f(0,0,2);
}

Compilation message

fish.cpp:60:5: warning: multi-line comment [-Wcomment]
   60 |     //2 increasing, \
      |     ^

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1132 ms 1747924 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 1147 ms 1659020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 10 ms 6100 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 10 ms 5972 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 10 ms 5972 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 10 ms 6100 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 10 ms 5972 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 10 ms 5972 KB Output is correct
15 Correct 11 ms 6072 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 20 ms 7100 KB Output is correct
18 Correct 20 ms 7124 KB Output is correct
19 Correct 20 ms 7108 KB Output is correct
20 Correct 20 ms 7108 KB Output is correct
21 Correct 20 ms 7032 KB Output is correct
22 Correct 30 ms 8148 KB Output is correct
23 Correct 12 ms 6252 KB Output is correct
24 Correct 17 ms 6772 KB Output is correct
25 Correct 10 ms 5972 KB Output is correct
26 Correct 12 ms 6228 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 10 ms 6100 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 10 ms 5972 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 10 ms 5972 KB Output is correct
15 Correct 11 ms 6072 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 20 ms 7100 KB Output is correct
18 Correct 20 ms 7124 KB Output is correct
19 Correct 20 ms 7108 KB Output is correct
20 Correct 20 ms 7108 KB Output is correct
21 Correct 20 ms 7032 KB Output is correct
22 Correct 30 ms 8148 KB Output is correct
23 Correct 12 ms 6252 KB Output is correct
24 Correct 17 ms 6772 KB Output is correct
25 Correct 10 ms 5972 KB Output is correct
26 Correct 12 ms 6228 KB Output is correct
27 Execution timed out 1040 ms 565300 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1147 ms 1659020 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 1156 ms 1726292 KB Time limit exceeded
2 Halted 0 ms 0 KB -