oj.uz

Submission #681789

# Submission time Handle Problem Language Result Execution time Memory
681789 2023-01-14T10:03:42 Z Jarif_Rahman Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 2097152 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W){
    vector<vector<ll>> v(n, vector<ll>(n+1, 0));
    for(int i = 0; i < n; i++) v[X[i]][Y[i]+1]+=W[i];

    vector<vector<ll>> dp_up(n, vector<ll>(n+1, 0)), dp_down = dp_up;

    for(int i = n-1; i >= 0; i--) for(int j = 0; j <= n; j++){
        if(i == n-1){
            dp_down[i][j] = 0;
            dp_up[i][j] = 0;
            continue;
        }

        ll s = 0;
        for(int k = j; k <= n; k++){
            if(k > j) s+=v[i][k];
            dp_up[i][j] = max(dp_up[i][j], s+dp_up[i+1][k]);
        }
        s = 0;
        for(int k = j; k >= 0; k--){
            if(k < j) s+=v[i+1][k];
            dp_down[i][j] = max(dp_down[i][j], s+dp_down[i+1][k]);
        }

        s = 0;
        for(int k = j+1; k <= n; k++) s+=v[i][k];
        dp_up[i][j] = max(dp_up[i][j], s+dp_down[i+1][n]);

        dp_down[i][j] = max(dp_down[i][j], dp_up[i+1][j]);
    }

    return max(*max_element(dp_up[0].begin(), dp_up[0].end()), *max_element(dp_down[0].begin(), dp_down[0].end()));
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1181 ms 2083072 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 212 KB Output is correct
2 Runtime error 824 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 901 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 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '2022'
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '2022'
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '2022'
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 901 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 1181 ms 2083072 KB Time limit exceeded
2 Halted 0 ms 0 KB -