Submission #1242090

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242090		AlperenT_	Soccer Stadium (IOI23_soccer)	C++20	0 / 100	101 ms	764 KiB

soccer

#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 ll 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; 
                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; 
                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;
}

• 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