Submission #937309

#	Time	Username	Problem	Language	Result	Execution time	Memory
937309		Dan4Life	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	4582 ms	348 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

#define pf push_front
#define pb push_back
#define ll long long
#define vi vector<int>
#define sz(a) (int)a.size()
#define lb lower_bound
#define ub upper_bound
#define all(a) begin(a),end(a)

const int mxN = 2010;
int n;
vector<int> col[mxN];

int biggest_stadium(int N, vector<vi> a)
{
	n = N; int ans = 0;
	
	for(int i = 0; i < n; i++) 
		col[i].clear(), col[i].pb(-1);
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			if(a[i][j]) col[j].pb(i);
	for(int i = 0; i < n; i++) col[i].pb(n);
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			if(a[i][j]) continue;
			for(int k = i; k < n; k++){
				if(a[k][j]) break; 
				int mxJ = j;
				for (int l = j; l < n; l++){
					int pos = lb(all(col[l]),i)-begin(col[l]);
					if(col[l][pos]<=k) break; // if a[i][l]...a[k][l] contains forest
					mxJ = l;
				}
				
				for(int l = j; l <= mxJ; l++){
					int tot = 0;
					int pos = lb(all(col[l]),i)-begin(col[l]);
					if(col[l][pos]<=k) break; // if a[i][l]...a[k][l] contains forest
					
					int DOWN = i, UP = i;
					while(UP>0 and !a[UP-1][l]) UP--;   		// while we dont have forest, go up
					while(DOWN<n-1 and !a[DOWN+1][l]) DOWN++; 	//          " "               go down
					tot+=DOWN-UP+1;
					int up2 = UP, down2 = DOWN;
					
					for(int m = l-1; m >= j; m--){
						int pos = lb(all(col[m]),i)-begin(col[m]);
						int up = max(UP, col[m][pos-1]+1); 
						int down = min(DOWN, col[m][pos]-1);
						UP = up, DOWN = down; tot+=down-up+1;
					}
					UP = up2, DOWN = down2;
					for(int m = l+1; m <= mxJ; m++){
						int pos = lb(all(col[m]),i)-begin(col[m]);
						int up = max(UP, col[m][pos-1]+1); 
						int down = min(DOWN, col[m][pos]-1);
						UP = up, DOWN = down; tot+=down-up+1;
					}
					ans = max(ans, tot); 
					//cout << i << " " << j << " " << k << " " << l << " " << down2 << " " << up2 << " " << tot << "\n";
				}
			}
		}
	}
	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