oj.uz

답안 #1056585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1056585 2024-08-13T10:11:03 Z aykhn 메기 농장 (IOI22_fish) C++17
35 / 100
 1000 ms 1050448 KB 
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

const int MXN = 5e3 + 5;

long long dp[2][MXN][MXN], val[MXN][MXN];
long long lft[MXN][MXN], rig[MXN][MXN], in[MXN][MXN];
long long pre[2][MXN][MXN], suf[2][MXN][MXN];
long long mx[MXN];

/*
0 = len[i] < len[i + 1];
1 = len[i] > len[i + 1];
*/
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) 
{
    #define int long long
    for (int i = 0; i < M; i++) val[X[i] + 1][Y[i] + 1] = 1LL * W[i];
    for (int i = 1; i <= N; i++) 
    {
        for (int j = 1; j <= N; j++)
        {
            lft[i][j] = lft[i][j - 1] + val[i - 1][j];
            rig[i][j] = rig[i][j - 1] + val[i + 1][j];
            in[i][j] = in[i][j - 1] + val[i][j];
        }
    }
    for (int i = 1; i <= N; i++)
    {
        for (int j = 1; j <= N; j++)
        {
            dp[0][i][j] = dp[1][i][j] = lft[i][j] + rig[i][j];
            if (i <= 1) continue;
            dp[0][i][j] = max(dp[0][i][j], pre[0][i - 1][j] + (lft[i][j] + rig[i][j]));
            dp[1][i][j] = max(dp[1][i][j], suf[0][i - 1][j] + (rig[i][j] - in[i][j]));
            if (i <= 2) continue;
            long long A = pre[1][i - 2][j] + lft[i][j] + rig[i][j];
            long long B = suf[1][i - 2][j] + rig[i][j];
            dp[0][i][j] = max({dp[0][i][j], A, B});
            dp[1][i][j] = max({dp[1][i][j], A, B});
            if (i <= 3) continue;
            dp[0][i][j] = max(dp[0][i][j], mx[i - 3] + lft[i][j] + rig[i][j]);
            dp[1][i][j] = max(dp[1][i][j], mx[i - 3] + lft[i][j] + rig[i][j]);
        }
        for (int j = 1; j <= N; j++) 
        {
            pre[0][i][j] = max(pre[0][i][j - 1], dp[0][i][j] - rig[i][j] - in[i][j]);
            pre[1][i][j] = max(pre[1][i][j - 1], max(dp[0][i][j], dp[1][i][j]) - rig[i][j]);
        }
        for (int j = N; j >= 1; j--)
        {
            suf[0][i][j] = max(suf[0][i][j + 1], dp[1][i][j]);
            suf[1][i][j] = max(suf[1][i][j + 1], max(dp[0][i][j], dp[1][i][j]));
        }
        for (int j = 1; j <= N; j++)
        {
            mx[i] = max({mx[i], dp[0][i][j], dp[1][i][j]});
        }
    }
    long long ans = 0;
    for (int i = 1; i <= N; i++) 
    {
        for (int j = 1; j <= N; j++) 
        {
            ans = max({ans, dp[0][i][j], dp[1][i][j]});
        }
    }
    return ans;
    #undef int
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1010 ms 746680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Execution timed out 1095 ms 784672 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1016 ms 729956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 6592 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8536 KB Output is correct
9 Correct 5 ms 32348 KB Output is correct
10 Correct 10 ms 60508 KB Output is correct
11 Correct 5 ms 32344 KB Output is correct
12 Correct 10 ms 60252 KB Output is correct
13 Correct 2 ms 19292 KB Output is correct
14 Correct 9 ms 60252 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 6592 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8536 KB Output is correct
9 Correct 5 ms 32348 KB Output is correct
10 Correct 10 ms 60508 KB Output is correct
11 Correct 5 ms 32344 KB Output is correct
12 Correct 10 ms 60252 KB Output is correct
13 Correct 2 ms 19292 KB Output is correct
14 Correct 9 ms 60252 KB Output is correct
15 Correct 9 ms 60252 KB Output is correct
16 Correct 2 ms 17244 KB Output is correct
17 Correct 15 ms 59368 KB Output is correct
18 Correct 16 ms 57432 KB Output is correct
19 Correct 19 ms 61528 KB Output is correct
20 Correct 15 ms 61532 KB Output is correct
21 Correct 15 ms 61528 KB Output is correct
22 Correct 22 ms 62556 KB Output is correct
23 Correct 14 ms 60508 KB Output is correct
24 Correct 13 ms 61088 KB Output is correct
25 Correct 11 ms 60588 KB Output is correct
26 Correct 10 ms 60504 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 6592 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 1 ms 8536 KB Output is correct
9 Correct 5 ms 32348 KB Output is correct
10 Correct 10 ms 60508 KB Output is correct
11 Correct 5 ms 32344 KB Output is correct
12 Correct 10 ms 60252 KB Output is correct
13 Correct 2 ms 19292 KB Output is correct
14 Correct 9 ms 60252 KB Output is correct
15 Correct 9 ms 60252 KB Output is correct
16 Correct 2 ms 17244 KB Output is correct
17 Correct 15 ms 59368 KB Output is correct
18 Correct 16 ms 57432 KB Output is correct
19 Correct 19 ms 61528 KB Output is correct
20 Correct 15 ms 61532 KB Output is correct
21 Correct 15 ms 61528 KB Output is correct
22 Correct 22 ms 62556 KB Output is correct
23 Correct 14 ms 60508 KB Output is correct
24 Correct 13 ms 61088 KB Output is correct
25 Correct 11 ms 60588 KB Output is correct
26 Correct 10 ms 60504 KB Output is correct
27 Correct 269 ms 1043488 KB Output is correct
28 Correct 69 ms 160172 KB Output is correct
29 Correct 290 ms 1001300 KB Output is correct
30 Incorrect 289 ms 1050448 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102426281544023'
31 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1016 ms 729956 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1010 ms 746680 KB Time limit exceeded
2 Halted 0 ms 0 KB -