Submission #1069574

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

soccer

#include <vector>
using namespace std;
int biggest_stadium(int N, vector<vector<int>> F)
{
	int n=F.size(),m=F[0].size();
	for (int i=0;i<n;i++)
		for (int j=0;j<m;j++)
			F[i][j]^=1;
	int pre[n+1][m+1]={};
	for (int i=0;i<n;i++)
		for (int j=0;j<m;j++)
			pre[i+1][j+1]=pre[i+1][j]+pre[i][j+1]+F[i][j];
	int cnt=0;
	for (int i=0;i<n;i++)
		for (int j=0;j<m;j++)
			if (F[i][j]==0)
			{
				cnt++;
				int a=i+1,b=1,c=i+1,d=j+1;
				if (pre[c][d]-pre[a-1][d]-pre[c][b-1]+pre[a-1][b-1]>0)
				{
					a=c,b=d;
					c=i+1,d=m;
					if (pre[c][d]-pre[a-1][d]-pre[c][b-1]+pre[a-1][b-1]>0)	
						return 69;
				}
				a=1,b=j+1,c=i+1,d=j+1;
				if (pre[c][d]-pre[a-1][d]-pre[c][b-1]+pre[a-1][b-1]>0)
				{
					a=c,b=d;
					c=n,d=j+1;
					if (pre[c][d]-pre[a-1][d]-pre[c][b-1]+pre[a-1][b-1]>0)	
						return 69;
				}
			}
	return N*N-cnt;	
}

• 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