oj.uz

Submission #829293

# Submission time Handle Problem Language Result Execution time Memory
829293 2023-08-18T08:19:18 Z tolbi Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include "fish.h"

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    vector<vector<ll>> grid(N,vector<ll>(N+1,0));
    for (int i = 0; i < M; ++i)
    {
        grid[X[i]][Y[i]]=W[i];
    }
    vector<vector<vector<ll>>> dp(N,vector<vector<ll>>(N+1,vector<ll>(3,-1)));
    //0 decreasing
    //1 increasing
    //2 increasing, \
    but forbidden to profit from back
    function<ll(int,int,int)> f;
    f = [&](int x, int y, int flag)->ll{
        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];
    };
    return f(0,0,2);
}

Compilation message

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

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 652 ms 2097152 KB Execution killed with signal 9
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 Runtime error 657 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 618 ms 2097152 KB Execution killed with signal 9
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 1 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 4 ms 1748 KB Output is correct
10 Correct 13 ms 6228 KB Output is correct
11 Correct 4 ms 1748 KB Output is correct
12 Correct 14 ms 6228 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 16 ms 6228 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 1 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 4 ms 1748 KB Output is correct
10 Correct 13 ms 6228 KB Output is correct
11 Correct 4 ms 1748 KB Output is correct
12 Correct 14 ms 6228 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 16 ms 6228 KB Output is correct
15 Correct 16 ms 6228 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 23 ms 7252 KB Output is correct
18 Correct 24 ms 7980 KB Output is correct
19 Correct 24 ms 8048 KB Output is correct
20 Correct 34 ms 7976 KB Output is correct
21 Correct 26 ms 8020 KB Output is correct
22 Correct 34 ms 9812 KB Output is correct
23 Correct 16 ms 6484 KB Output is correct
24 Correct 20 ms 7416 KB Output is correct
25 Correct 14 ms 6240 KB Output is correct
26 Correct 18 ms 6524 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 1 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 4 ms 1748 KB Output is correct
10 Correct 13 ms 6228 KB Output is correct
11 Correct 4 ms 1748 KB Output is correct
12 Correct 14 ms 6228 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 16 ms 6228 KB Output is correct
15 Correct 16 ms 6228 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 23 ms 7252 KB Output is correct
18 Correct 24 ms 7980 KB Output is correct
19 Correct 24 ms 8048 KB Output is correct
20 Correct 34 ms 7976 KB Output is correct
21 Correct 26 ms 8020 KB Output is correct
22 Correct 34 ms 9812 KB Output is correct
23 Correct 16 ms 6484 KB Output is correct
24 Correct 20 ms 7416 KB Output is correct
25 Correct 14 ms 6240 KB Output is correct
26 Correct 18 ms 6524 KB Output is correct
27 Execution timed out 1114 ms 566928 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 618 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 652 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -