oj.uz

답안 #1056544

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

using namespace std;

const int MXN = 3e3 + 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) 
{
    for (int i = 0; i < M; i++) val[X[i] + 1][Y[i] + 1] = 1LL * 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;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 6492 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 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 4 ms 22216 KB Output is correct
10 Correct 8 ms 40580 KB Output is correct
11 Correct 4 ms 22140 KB Output is correct
12 Correct 8 ms 40516 KB Output is correct
13 Correct 2 ms 13148 KB Output is correct
14 Correct 8 ms 40540 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 6492 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 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 4 ms 22216 KB Output is correct
10 Correct 8 ms 40580 KB Output is correct
11 Correct 4 ms 22140 KB Output is correct
12 Correct 8 ms 40516 KB Output is correct
13 Correct 2 ms 13148 KB Output is correct
14 Correct 8 ms 40540 KB Output is correct
15 Correct 8 ms 40540 KB Output is correct
16 Correct 2 ms 13148 KB Output is correct
17 Correct 14 ms 41440 KB Output is correct
18 Correct 14 ms 41556 KB Output is correct
19 Correct 15 ms 41564 KB Output is correct
20 Correct 14 ms 41564 KB Output is correct
21 Correct 14 ms 41564 KB Output is correct
22 Correct 20 ms 42468 KB Output is correct
23 Correct 9 ms 40536 KB Output is correct
24 Correct 13 ms 41244 KB Output is correct
25 Correct 8 ms 40540 KB Output is correct
26 Correct 9 ms 40540 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 6492 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 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 4 ms 22216 KB Output is correct
10 Correct 8 ms 40580 KB Output is correct
11 Correct 4 ms 22140 KB Output is correct
12 Correct 8 ms 40516 KB Output is correct
13 Correct 2 ms 13148 KB Output is correct
14 Correct 8 ms 40540 KB Output is correct
15 Correct 8 ms 40540 KB Output is correct
16 Correct 2 ms 13148 KB Output is correct
17 Correct 14 ms 41440 KB Output is correct
18 Correct 14 ms 41556 KB Output is correct
19 Correct 15 ms 41564 KB Output is correct
20 Correct 14 ms 41564 KB Output is correct
21 Correct 14 ms 41564 KB Output is correct
22 Correct 20 ms 42468 KB Output is correct
23 Correct 9 ms 40536 KB Output is correct
24 Correct 13 ms 41244 KB Output is correct
25 Correct 8 ms 40540 KB Output is correct
26 Correct 9 ms 40540 KB Output is correct
27 Correct 183 ms 706388 KB Output is correct
28 Correct 66 ms 128592 KB Output is correct
29 Correct 230 ms 700288 KB Output is correct
30 Incorrect 231 ms 713344 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 1079 ms 338452 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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