Submission #1069603

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069603		Faisal_Saqib	Soccer Stadium (IOI23_soccer)	C++17	6 / 100	195 ms	37952 KiB

soccer

#include <bits/stdc++.h>
using namespace std;
#define ll int
#define vll vector<ll>
#define pb push_back
int biggest_stadium(int n, std::vector<std::vector<int>> grid)
{
	vector<pair<int,int>> trees;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			if(grid[i][j])
			{
				trees.pb({i,j});
			}
		}
	}
	if(trees.size()==0)
	{
		return (n*n);
	}
	else if(trees.size()==1)
	{
		int x=trees[0].first;
		int y=trees[0].second;
		// if(x==0 or x==(n-1) or y==0 or y==(n-1))
		// {
			return (n*n)-min({(x+1)*(y+1),(n-x)*(y+1),(n-y)*(x+1),(n-y)*(n-x)});
		// }
		// else
		// 	return (n*n)-1;
	}
	else
	{

	}
	return 0;
}

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30