| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1066433 | aaaaaarroz | Soccer Stadium (IOI23_soccer) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, vector<vector<int>> F){
map<tuple<int,int,int>,bool>libre;
for(int fila=0;fila<N;fila++){
for(int i=0;i<N;i++){
for(int j=0;j<N;i++){
if(i==j){
libre[{fila,i,j}]=!F[fila][j];
}
else{
libre[{fila,i,j}]=(!F[fila][j])||libre[{fila,i,j-1}];
}
}
}
}
int best=0;
for(int fila=0;fila<N;fila++){
for(int columna=0;columna<N;columna++){
for(int i=0;i<=columna;i++){
for(int j=columna;j<N;j++){
if(libre[{fila,i,j}]){
vector<pair<int,int>>almacen;
almacen.push_back({i,j});
int suma=0;
int fil=fila;
while(fil>=0&&F[fila][columna]==1){
int l=columna,r=columna;
while(l>almacen.back().first&&r<almacen.back().second){
if(libre[{fil,l-1,r}]){
l--;
}
else if(libre[{fil,l,r+1}]){
r++;
}
else{
break;
}
}
almacen.push_back({l,r});
fil--;
}
almacen.push_back({i,j});
fil=fila;
int fila_extra=1;
int alm_ant=almacen.size()-1;
while(fil<N&&F[fila][columna]==1){
int l1=columna,r1=columna;
if(fila_extra<alm_ant){
l1=almacen[alm_ant].first;
r1=almacen[alm_ant]-second;
while(l1>almacen.back().first&&r1<almacen.back().second){
if(libre[{fil,l-1,r}]){
l--;
}
else if(libre[{fil,l,r+1}]){
r++;
}
else{
break;
}
}
}
int l=columna,r=columna;
while(l>almacen.back().first&&r<almacen.back().second){
if(libre[{fil,l-1,r}]){
l--;
}
else if(libre[{fil,l,r+1}]){
r++;
}
else{
break;
}
}
if(libre[{fil,l1,r1}]){
almacen.push_back({l1,r1});
}
else{
almacen.push_back({l,r});
}
fil++;
}
for(auto[x,y]:almacen){
suma+=(y-x+1);
}
suma-=(j-i+1);
best=max(suma,best);
}
else{
continue;
}
}
}
}
}
return best;
}