제출 #1064031

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

soccer

#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=2000+10;
int n,all[maxn][maxn],dpb[maxn][maxn],dpp[maxn][maxn];

void clear(){
    for(int i=0;i<=n+1;i++){
        for(int j=0;j<=n+1;j++){
            all[i][j]=dpb[i][j]=dpp[i][j]=0;
        }
    }
}

void calbal(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(all[i][j]==1){
                dpb[i][j]=0;
            }else{
                dpb[i][j]=dpb[i-1][j]+1;
            }
        }
    }
}

void calpaee(){
    for(int i=n;i>=1;i--){
        for(int j=1;j<=n;j++){
            if(all[i][j]==0){
                dpp[i][j]=dpp[i+1][j]+1;
            }else{
                dpp[i][j]=0;
            }
        }
    }
}

int cal(int r,int c){
    int ret=0;
    int mn1=n,mn2=n;
    for(int i=c;i>=1;i--){
        mn1=min(dpp[r][i],mn1);
        mn2=min(dpb[r][i],mn2);
        ret+=mn1+mn2;
        if(mn1!=0&&mn2!=0){
            ret--;
        }
    }
    mn1=n;
    mn2=n;
    for(int i=c;i<=n;i++){
        mn1=min(dpp[r][i],mn1);
        mn2=min(mn2,dpb[r][i]);
        if(i==c){
            continue;
        }
        ret+=mn1+mn2;
        if(mn1!=0&&mn2!=0){
            ret--;
        }
    }
    return ret;
}

int solve(){
    int ret=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            ret=max(ret,cal(i,j));
        }
    }
    clear();
    return ret;
}

int biggest_stadium(int N, std::vector<std::vector<int>> F)
{
    n=N;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            all[i][j]=F[i-1][j-1];
        }
    }
    calbal();
    calpaee();
    return solve();
}

• 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