oj.uz

Submission #829265

# Submission time Handle Problem Language Result Execution time Memory
829265 2023-08-18T07:53:58 Z tolbi Catfish Farm (IOI22_fish) C++17
0 / 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,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,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)->int{
        if (dp[x][y][flag]!=-1) return dp[x][y][flag];
        if (flag==1){
            dp[x][y][flag]=0;
            if (y+1<N){
                ll crr = 0;
                if (x>0) crr = grid[x-1][y+1];
                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]+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+1<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));
            }
        }
        return dp[x][y][flag];
    };
    return f(0,0,2);
}//wa cunku y=0a gondermio

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 Execution timed out 1114 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 786 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 Execution timed out 1114 ms 2097152 KB Time limit exceeded
2 Halted 0 ms 0 KB -