제출 #1059912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059912		tolbi	축구 경기장 (IOI23_soccer)	C++17	0 / 100	4635 ms	1500512 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    vector<vector<vector<vector<int>>>> dp(2,vector<vector<vector<int>>>(N,vector<vector<int>>(N,vector<int>(N,0))));
    int ans = 0;
    for (int l = 0; l < N; l++){
        for (int r = l; r < N; r++){
            dp[0][N-1][l][r]=r-l+1;
            for (int i = l; i <= r; i++){
                if (F[N-1][i]==1){
                    dp[0][N-1][l][r]=0;
                    break;
                }
            }
            dp[1][N-1][l][r]=dp[0][N-1][l][r];
            ans=max(ans,dp[1][N-1][l][r]);
        }
    }
    for (int i = N-2; i >= 0; i--){
        for (int l = 0; l < N; l++){
            for (int r = N-1; r >= l; r--){
                dp[0][i][l][r]=r-l+1;
                for (int j = l; j <= r; j++){
                    if (F[i][j]==1){
                        dp[0][i][l][r]=0;
                        break;
                    }
                }
                if (dp[0][i][l][r]==0) {
                    dp[1][i][l][r]=0;
                    continue;
                }
                int cur = 0;
                int lel = l;
                for (int j = l; j <= r; j++){
                    if (F[i+1][j]==0){
                        cur=max(cur,dp[0][i+1][lel][j]);
                    }
                    else {
                        lel=j+1;
                    }
                }
                dp[0][i][l][r]+=cur;
                dp[1][i][l][r]=dp[0][i][l][r];
                if (l>0){
                    dp[1][i][l][r]=max(dp[1][i][l][r],dp[1][i][l-1][r]);
                }
                if (r+1<N){
                    dp[1][i][l][r]=max(dp[1][i][l][r],dp[1][i][l][r+1]);
                }
                dp[1][i][l][r]=max(dp[1][i][l][r],r-l+1+dp[1][i+1][l][r]);
                ans=max(ans,dp[1][i][l][r]);
            }
        }
    }
    return ans;
}

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