oj.uz

Submission #1066516

# Submission time Handle Problem Language Result Execution time Memory
1066516 2024-08-20T00:04:59 Z aaaaaarroz Soccer Stadium (IOI23_soccer) C++17
0 / 100
 1 ms 348 KB 
#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(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){
									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(l>=almacen[fila_extra].first&&r<=almacen[fila_extra].second&&l>=almacen.back().first&&r<=almacen.back().second){
									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);
						}
						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 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB wrong
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB wrong
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB partial
2 Incorrect 1 ms 348 KB wrong
3 Halted 0 ms 0 KB -