oj.uz

답안 #834642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834642 2023-08-22T16:23:39 Z tengiz05 메기 농장 (IOI22_fish) C++17
0 / 100
 767 ms 436980 KB 
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

constexpr int N = 3000;

i64 dp[N + 1][N + 1][2];
i64 pre[N + 1][N + 1];

void chmax(i64 &a, i64 b) {
    if (a < b) {
        a = b;
    }
}

long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    for (int i = 0; i < m; i++) {
        pre[X[i]][Y[i] + 1] += W[i];
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            pre[i][j + 1] += pre[i][j];
        }
    }
    
    memset(dp, 190, sizeof dp);
    
    for (int i = 0; i <= n; i++) {
        dp[0][i][0] = dp[0][i][1] = 0;
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j <= n; j++) {
            for (int k = j; k <= n; k++) {
                chmax(dp[i][k][0], dp[i - 1][j][0] + pre[i - 1][k] - pre[i - 1][j]);
            }
            for (int k = j; k >= 0; k--) {
                chmax(dp[i][k][1], dp[i - 1][j][1] + pre[i][j] - pre[i][k]);
            }
            if (i >= 2) {
                for (int k = 0; k <= n; k++) {
                    chmax(dp[i][k][0], dp[i - 2][j][1] + pre[i - 1][max(j, k)] - pre[i - 1][min(j, k)]);
                }
            }
        }
        for (int j = 0; j <= n; j++) {
            chmax(dp[i][j][1], dp[i][j][0]);
        }
        chmax(dp[i][0][0], dp[i][0][1]);
    }
    
    i64 ans = 0;
    for (int i = 0; i <= n; i++) {
        ans = max(ans, dp[n - 1][i][1]);
    }
    return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 763 ms 432956 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 141164 KB Output is correct
2 Runtime error 762 ms 436980 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 767 ms 429168 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 141208 KB Output is correct
2 Correct 47 ms 141272 KB Output is correct
3 Correct 44 ms 141224 KB Output is correct
4 Correct 45 ms 141292 KB Output is correct
5 Correct 52 ms 141260 KB Output is correct
6 Correct 45 ms 141244 KB Output is correct
7 Correct 46 ms 141220 KB Output is correct
8 Correct 54 ms 141176 KB Output is correct
9 Incorrect 63 ms 142192 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '326664473535'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 141208 KB Output is correct
2 Correct 47 ms 141272 KB Output is correct
3 Correct 44 ms 141224 KB Output is correct
4 Correct 45 ms 141292 KB Output is correct
5 Correct 52 ms 141260 KB Output is correct
6 Correct 45 ms 141244 KB Output is correct
7 Correct 46 ms 141220 KB Output is correct
8 Correct 54 ms 141176 KB Output is correct
9 Incorrect 63 ms 142192 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '326664473535'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 141208 KB Output is correct
2 Correct 47 ms 141272 KB Output is correct
3 Correct 44 ms 141224 KB Output is correct
4 Correct 45 ms 141292 KB Output is correct
5 Correct 52 ms 141260 KB Output is correct
6 Correct 45 ms 141244 KB Output is correct
7 Correct 46 ms 141220 KB Output is correct
8 Correct 54 ms 141176 KB Output is correct
9 Incorrect 63 ms 142192 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '326664473535'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 767 ms 429168 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 763 ms 432956 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -