Submission #1067698

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067698		aaaaaarroz	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	1 ms	348 KiB

soccer

#include <bits/stdc++.h>
using namespace std;
bool limites(int N, int i, int j){
	return i>=0&&i<N&&j>=0&&j<N;
}
bool comprobar(int N, vector<vector<int>> F){
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(F[i][j]==1||F[i][j]==0){
				continue;
			}
			priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>,greater<tuple<int,int,int>>>cola;
			int dx[]={1,0,-1,0};
			int dy[]={0,1,0,-1};
			vector<vector<int>>dist(N,vector<int>(N,INT_MAX));
			dist[i][j]=0;
			cola.push({0,i,j});
			while(!cola.empty()){
				auto[d,x,y]=cola.top();
				cola.pop();
				for(int dir=0;dir<4;dir++){
					int posi=x+dx[dir];
					int posj=y+dy[dir];
					while(true){
						if(!limites(N,posi,posj)||F[posi][posj]==1||F[posi][posj]==0)break;
						if((d+1)<dist[posi][posj]){
							dist[posi][posj]=d+1;
							cola.push({dist[posi][posj],posi,posj});
						}
						posi+=dx[dir];
						posj+=dy[dir];
					}
				}
			}
			for(int x=0;x<N;x++){
				for(int y=0;y<N;y++){
					if(F[x][y]==2&&(dist[x][y]>=3||dist[x][y]==-1)){
						return false;
					}
				}
			}
		}
	}
	return true;
}
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(l>=almacen.back().first&&r<=almacen.back().second){
									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=columna,r1=columna;
									l1=almacen[fila_extra].first;
									r1=almacen[fila_extra].second;
									while(l1>=almacen.back().first&&r1<=almacen.back().second&&l1>=almacen[fila_extra-1].first&&r1<=almacen[fila_extra-1].second){
										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 l=columna,r=columna;
									while(l>=almacen[fila_extra].first&&r<=almacen[fila_extra].second&&l>=almacen.back().first){
										if(libre[{fil,l-1,r}]&&(l-1)>=almacen[fila_extra].first&&(l-1)>=almacen.back().first){
											l--;
										}
										else if(libre[{fil,l,r+1}]&&(r+1)<=almacen[fila_extra].second&&(r+1)<=almacen.back().second){
											r++;
										}
										else{
											break;
										}
									}
									if(libre[{fil,l1,r1}]&&l1>=almacen.back().first&&r1<=almacen.back().second){
										almacen.push_back({l1,r1});
									}
									else{
										almacen.push_back({l,r});
									}
								}
								else{
									int l=columna,r=columna;
									while(l>=almacen.back().first&&r<=almacen.back().second){
										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);
							vector<vector<int>>grid=F;
							int cnt=0;
							fil=fila;
							while(fil>=0&&F[fil][columna]!=1){
								for(int y=almacen[cnt].first;y<=almacen[cnt].second;y++){
									grid[fil][y]=2;
								}
								fil--;
								cnt++;
							}
							fil=fila;
							while(fil<N&&F[fil][columna]!=1){
								for(int y=almacen[cnt].first;y<=almacen[cnt].second;y++){
									grid[fil][y]=2;
								}
								fil++;
								cnt++;
							}
							if(comprobar(N,grid)){
								best=max(suma,best);
							}
						}
						{
							vector<pair<int,int>>almacen;
							almacen.push_back({i,j});
							int suma=0;
							int fil=fila-1;
							while(fil<N&&F[fil][columna]!=1){
								int l=columna,r=columna;
								while(l>=almacen.back().first&&r<=almacen.back().second){
									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>=0&&F[fil][columna]!=1){
								if(fila_extra<alm_ant){
									int l1=columna,r1=columna;
									l1=almacen[fila_extra].first;
									r1=almacen[fila_extra].second;
									while(l1>=almacen.back().first&&r1<=almacen.back().second&&l1>=almacen[fila_extra-1].first&&r1<=almacen[fila_extra-1].second){
										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 l=columna,r=columna;
									while(l>=almacen[fila_extra].first&&r<=almacen[fila_extra].second&&l>=almacen.back().first){
										if(libre[{fil,l-1,r}]&&(l-1)>=almacen[fila_extra].first&&(l-1)>=almacen.back().first){
											l--;
										}
										else if(libre[{fil,l,r+1}]&&(r+1)<=almacen[fila_extra].second&&(r+1)<=almacen.back().second){
											r++;
										}
										else{
											break;
										}
									}
									if(libre[{fil,l1,r1}]&&l1>=almacen.back().first&&r1<=almacen.back().second){
										almacen.push_back({l1,r1});
									}
									else{
										almacen.push_back({l,r});
									}
								}
								else{
									int l=columna,r=columna;
									while(l>=almacen.back().first&&r<=almacen.back().second){
										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);
							vector<vector<int>>grid=F;
							int cnt=0;
							fil=fila;
							while(fil>=0&&F[fil][columna]!=1){
								for(int y=almacen[cnt].first;y<=almacen[cnt].second;y++){
									grid[fil][y]=2;
								}
								fil--;
								cnt++;
							}
							fil=fila;
							while(fil<N&&F[fil][columna]!=1){
								for(int y=almacen[cnt].first;y<=almacen[cnt].second;y++){
									grid[fil][y]=2;
								}
								fil++;
								cnt++;
							}
							if(comprobar(N,grid)){
								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;
}
*/

• 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