oj.uz

답안 #639378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639378 2022-09-09T18:05:55 Z SlavicG 메기 농장 (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;

const ll inf = 1e16;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    vector<vector<ll>> p(n, vector<ll>(n, 0));
    for(int i = 0; i < m; ++i) {
        p[x[i]][y[i]] += w[i];
    }
    for(int i = 0; i < n; ++i) {
        for(int j = 1; j < n; ++j) {
            p[i][j] += p[i][j - 1];
        }
    }

    vector<vector<vector<ll>>> dp(n + 1, vector<vector<ll>>(n + 1, vector<ll>(2, -inf)));
    for(int i = 0; i <= n; ++i) {
        dp[0][i][0] = dp[0][i][1] = 0;
    }

    //0 - increasing, 1 - decreasing
    for(int i = 1; i < n; ++i) {
        vector<ll> max0(n + 1, -inf), max1(n + 1, -inf);
        for(int lastlen = n; lastlen >= 0; --lastlen) {
            if(lastlen + 1 <= n) max1[lastlen] = max1[lastlen + 1];
            max1[lastlen] = max(max1[lastlen], dp[i - 1][lastlen][0] + (lastlen ? p[i][lastlen - 1] : 0));
            max1[lastlen] = max(max1[lastlen], dp[i - 1][lastlen][1] + (lastlen ? p[i][lastlen - 1] : 0));
        }
        for(int lastlen = 0; lastlen <= n; ++lastlen) {
            dp[i][0][0] = max({dp[i][0][0], dp[i - 1][lastlen][0], dp[i - 1][lastlen][1]});
            dp[i][0][1] = max({dp[i][0][1], dp[i - 1][lastlen][0], dp[i - 1][lastlen][1]});
            if(lastlen) {
                dp[i][0][1] = max(dp[i][0][1], dp[i - 1][lastlen][1] + p[i][lastlen - 1]);
                dp[i][0][1] = max(dp[i][0][1], dp[i - 1][lastlen][0] + p[i][lastlen - 1]);
            }
            if(lastlen) max0[lastlen] = max0[lastlen - 1];
            max0[lastlen] = max(max0[lastlen], dp[i - 1][lastlen][0] - (lastlen ? p[i - 1][lastlen - 1] : 0));
            for(int curlen = 1; curlen <= n; ++curlen) {
                if(curlen >= lastlen) {
                    dp[i][curlen][0] = max(dp[i][curlen][0], p[i - 1][curlen - 1] + max0[curlen]);
                }
                if(curlen <= lastlen) {
                    dp[i][curlen][1] = max(dp[i][curlen][1], max1[curlen] - p[i][curlen - 1]);
                }
            }
        }
    }
    ll ans = 0;
    for(int i = 0; i <= n; ++i) {
        ans = max({ans, dp[n - 1][i][0], dp[n - 1][i][1]});
    }
    return ans;
}
/*
5 4
0 2 5
1 1 2
4 4 1
3 3 3
*/

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 744 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 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 12 ms 1760 KB Output is correct
10 Correct 79 ms 6080 KB Output is correct
11 Correct 12 ms 1748 KB Output is correct
12 Correct 78 ms 5972 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 78 ms 5972 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 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 12 ms 1760 KB Output is correct
10 Correct 79 ms 6080 KB Output is correct
11 Correct 12 ms 1748 KB Output is correct
12 Correct 78 ms 5972 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 78 ms 5972 KB Output is correct
15 Correct 78 ms 6092 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 88 ms 7076 KB Output is correct
18 Correct 96 ms 6996 KB Output is correct
19 Correct 89 ms 6996 KB Output is correct
20 Correct 91 ms 6996 KB Output is correct
21 Correct 96 ms 7056 KB Output is correct
22 Correct 111 ms 8008 KB Output is correct
23 Correct 79 ms 6140 KB Output is correct
24 Correct 87 ms 6664 KB Output is correct
25 Correct 81 ms 5972 KB Output is correct
26 Correct 80 ms 6100 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 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 12 ms 1760 KB Output is correct
10 Correct 79 ms 6080 KB Output is correct
11 Correct 12 ms 1748 KB Output is correct
12 Correct 78 ms 5972 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 78 ms 5972 KB Output is correct
15 Correct 78 ms 6092 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 88 ms 7076 KB Output is correct
18 Correct 96 ms 6996 KB Output is correct
19 Correct 89 ms 6996 KB Output is correct
20 Correct 91 ms 6996 KB Output is correct
21 Correct 96 ms 7056 KB Output is correct
22 Correct 111 ms 8008 KB Output is correct
23 Correct 79 ms 6140 KB Output is correct
24 Correct 87 ms 6664 KB Output is correct
25 Correct 81 ms 5972 KB Output is correct
26 Correct 80 ms 6100 KB Output is correct
27 Execution timed out 1112 ms 564584 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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