| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1242096 | AlperenT_ | 축구 경기장 (IOI23_soccer) | C++20 | 0 ms | 0 KiB |
#include "soccer.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define pb push_back
#define F first
#define pii pair<int,int>
#define all(a) a.begin(),a.end()
#define S second
#define sz(a) (int)a.size()
#define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++)
#define per(i , a , b) for(int i = (a) ; i >= (b) ; i--)
#define ld double
#define int long long
using namespace std ;
const int maxn = 30 + 10 ,s = 1000 , inf = 1e9 , mod = 998244353;
int u[maxn] [maxn][maxn] , d[maxn][maxn][maxn] , pr[maxn];
int biggest_stadium(int n, std::vector<std::vector<int>> F){
rep(i , 0 ,n-1){
rep(j , 1 , n){
pr[j] = pr[j-1] + F[i][j-1] ;
}
rep(l1 , 1, n){
rep(r1 , l1 , n){
if(pr[r1]-pr[l1-1] !=0 ){
u[i][l1][r1] = -inf ;
continue ;
}
u[i][l1][r1] = r1-l1+1;
if(i)
rep(l2 , l1 , r1){
rep(r2 , l2 , r1){
u[i][l1][r1] = max(u[i][l1][r1] , u[i-1][l2][r2] + r1-l1+1) ;
}
}
}
}
}
per(i , n-1 , 0){
rep(j , 1 , n){
pr[j] = pr[j-1] + F[i][j-1] ;
}
rep(l1 , 1, n){
rep(r1 , l1 , n){
if(pr[r1]-pr[l1-1] !=0 ){
d[i][l1][r1] = -inf ;
continue ;
}
d[i][l1][r1] = r1-l1+1;
if(i!=n-1)
rep(l2 , l1 , r1){
rep(r2 , l2 , r1){
d[i][l1][r1] = max(d[i][l1][r1] , d[i+1][l2][r2] + r1-l1+1) ;
}
}
}
}
}
int ans =0 ;
rep(i ,0 ,n-1){
rep(l1 , 1 ,n){
rep(r1 , l1 , n){
ans = max(ans , d[i][l1][r1] + u[i][l1][r1] - (r1-l1+1)) ;
}
}
}
return ans;
}