제출 #1018587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1018587		tinjyu	Soccer Stadium (IOI23_soccer)	C++17	48 / 100	74 ms	114032 KiB

soccer

#include "soccer.h"
#include <iostream>
long long int dp[105][105][505];
long long int dp_left[105][505][505], dp_right[105][105][505];
long long int left_bound[505][505], right_bound[505][505];

using namespace std;

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{

    long long int ans = 0;
    for (int i = 0; i < N; i++)
    {
        int lf = -1;
        for (int j = 0; j < N; j++)
        {
            if (F[i][j] == 1)
            {
                lf = j;
            }
            left_bound[i][j] = lf;
        }
        int rf = N;
        for (int j = N - 1; j >= 0; j--)
        {
            if (F[i][j] == 1)
            {
                rf = j;
            }
            right_bound[i][j] = rf;
        }
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (F[i][j] == 1)
            {
                dp[i][i][j] = -1;
            }
            else
            {
                dp[i][i][j] = right_bound[i][j] - left_bound[i][j] - 1;
                dp_left[i][i][j] = left_bound[i][j];
                dp_right[i][i][j] = right_bound[i][j];
            }
            ans = max(ans, dp[i][i][j]);
        }
    }

    for (int len = 2; len <= N; len++)
    {
        for (int i = 0; i + len - 1 < N; i++)
        {
            for (int col = 0; col < N; col++)
            {

                int up = i, down = i + len - 1;
                // cout << dp[up][down][col] << " " << up << " " << down << " " << col << endl;

                if (F[up][col] == 0)
                {
                    int lf = max(dp_left[up + 1][down][col], left_bound[up][col]);
                    int ri = min(dp_right[up + 1][down][col], right_bound[up][col]);
                    dp[up][down][col] = dp[up + 1][down][col] + ri - lf - 1;
                    dp_left[up][down][col] = lf;
                    dp_right[up][down][col] = ri;
                }
                if (F[down][col] == 0)
                {
                    int lf = max(dp_left[up][down - 1][col], left_bound[down][col]);
                    int ri = min(dp_right[up][down - 1][col], right_bound[down][col]);
                    if (dp[up][down - 1][col] + ri - lf - 1 > dp[up][down][col])
                    {

                        dp[up][down][col] = max(dp[up][down - 1][col] + ri - lf - 1, dp[up][down][col]);
                        dp_left[up][down][col] = lf;
                        dp_right[up][down][col] = ri;
                    }
                }
                // cout << dp[up][down][col] << " " << up << " " << down << " " << col << endl;
                ans = max(ans, dp[up][down][col]);
            }
        }
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 8 / 8
• Subtask 3: 22 / 22
• Subtask 4: 18 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30