| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1066546 | 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=i;j<N;j++){
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-1;
while(fil>=0&&F[fil][columna]!=1){
int l=columna,r=columna;
while(true){
if(libre[{fil,l-1,r}]&&(l-1)>=almacen.back().first){
l--;
}
else if(libre[{fil,l,r+1}]&&(r+1)<=almacen.back().second){
r++;
}
else{
break;
}
}
almacen.push_back({l,r});
fil--;
}
almacen.push_back({i,j});
fil=fila+1;
int fila_extra=1;
int alm_ant=almacen.size()-1;
while(fil<N&&F[fil][columna]!=1){
if(fila_extra<alm_ant){
int l1=almacen[fila_extra].first,r1=almacen[fila_extra].second;
while(true){
if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first&&(l1-1)>=almacen[fila_extra-1].first){
l1--;
}
else if(libre[{fil,l1,r1+1}]&&(r1+1)<=almacen.back().second&&(r1+1)<=almacen[fila_extra-1].second){
r1++;
}
else{
break;
}
}
int l2=almacen[fila_extra-1].first,r2=almacen[fila_extra-1].second;
while(true){
if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first){
l1--;
}
else if(libre[{fil,l1,r1+1}]&&(r1+1)<=almacen.back().second){
r1++;
}
else{
break;
}
}
int l=columna,r=columna;
while(true){
if(libre[{fil,l-1,r}]&&(l-1)>=almacen[fila_extra].first&&(l-1)>=almacen.back().first&&(l-1)>=almacen[fila_extra-1].first){
l--;
}
else if(libre[{fil,l,r+1}]&&(r+1)<=almacen[fila_extra].second&&(r+1)<=almacen.back().second&&(r+1)<=almacen[fila_extra-1].second){
r++;
}
else{
break;
}
}
if(libre[{fil,l2,r2}]&&l2>=almacen.back().first&&r2<=almacen.back().second){
almacen.push_back({l2,r2});
}
else if(libre[{fil,l1,r1}]&&l1>=almacen.back().first&&r1<=almacen.back().second&&l1>=almacen[fila_extra-1].first&&r1<=almacen[fila_extra-1].second){
almacen.push_back({l1,r1});
}
else{
almacen.push_back({l,r});
}
}
else if(fila_extra==alm_ant){
int l=columna,r=columna;
while(true){
if(libre[{fil,l-1,r}]&&(l-1)>=almacen.back().first&&(l-1)>=almacen[fila_extra-1].first){
l--;
}
else if(libre[{fil,l,r+1}]&&(r+1)<=almacen.back().second&&(r+1)<=almacen[fila_extra-1].second){
r++;
}
else{
break;
}
}
int l2=almacen[fila_extra-1].first,r2=almacen[fila_extra-1].second;
while(true){
if(libre[{fil,l1-1,r1}]&&(l1-1)>=almacen.back().first){
l1--;
}
else if(libre[{fil,l1,r1+1}]&&(r1+1)<=almacen.back().second){
r1++;
}
else{
break;
}
}
if(libre[{fil,l2,r2}]&&l2>=almacen.back().first&&r2<=almacen.back().second){
almacen.push_back({l2,r2});
}
else{
almacen.push_back({l,r});
}
}
else{
int l=columna,r=columna;
while(true){
if(libre[{fil,l-1,r}]&&(l-1)>=almacen.back().first){
l--;
}
else if(libre[{fil,l,r+1}]&&(r+1)<=almacen.back().second){
r++;
}
else{
break;
}
}
almacen.push_back({l,r});
}
fil++;
fila_extra++;
}
for(auto[x,y]:almacen){
suma+=(y-x+1);
}
suma-=(j-i+1);
best=max(suma,best);
}
else{
continue;
}
}
}
}
}
return best;
}
/*
int main()
{
int N;
cin>>N;
vector<vector<int>> F(N, vector<int>(N));
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
cin>>F[i][j];
}
}
int res = biggest_stadium(N, F);
cout<<res<<"\n";
return 0;
}
*/