oj.uz

Submission #1069623

# Submission time Handle Problem Language Result Execution time Memory
1069623 2024-08-22T07:20:20 Z Faisal_Saqib Soccer Stadium (IOI23_soccer) C++17
6 / 100
 252 ms 66896 KB 
#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;
	int row[n][n],col[n][n];
	bool vis[n][n];
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<n;j++)
		{
			row[i][j]=col[i][j]=-1;
			if(grid[i][j])
				trees.pb({i,j});
		}
		row[i][n-1]=-1;
		for(int j=n-2;j>=0;j--)
		{
			if(grid[i][j]!=grid[i][j+1])
			{
				row[i][j]=j+1;
			}
			else
			{
				row[i][j]=row[i][j+1];
			}
		}
	}
	for(int j=0;j<n;j++)
	{
		col[n-1][j]=-1;
		for(int i=n-2;i>=0;i--)
		{
			if(grid[i][j]!=grid[i+1][j])
			{
				col[i][j]=i+1;
			}
			else
			{
				col[i][j]=col[i+1][j];
			}
		}
	}
	if(trees.size()==0)
	{
		return (n*n);
	}
	else if(trees.size()==1)
	{
		int x=trees[0].first;
		int y=trees[0].second;
		return (n*n)-min({(x+1)*(y+1),(n-x)*(y+1),(n-y)*(x+1),(n-y)*(n-x)});
	}
	else
	{
		bool can=0;
		vector<pair<int,int>> dir={{-1,-1},{-1,1},{1,-1},{1,1}};
		for(auto [dx,dy]:dir)
		{
			for(int i=0;i<n;i++)
			{
				for(int j=0;j<n;j++)
				{
					vis[i][j]=0;
				}
			}
			for(auto [x,y]:trees)
			{
				for(int i=0;i<=n and (x+(dx*i))<n and 0<=(x+(dx*i));i++)
				{
					for(int j=0;j<=n and (y+(dy*i))<n and 0<=(y+(dy*i));j++)
					{
						vis[x][y]=1;
					}
				}
			}
			bool pl=1;
			for(int i=0;i<n;i++)
			{
				for(int j=0;j<n;j++)
				{
					if(vis[i][j] and grid[i][j]==0)
					{
						pl=0;
						break;
					}
				}
			}
			can|=pl;
		}
		// for(int i=0;i<n;i++)
		// {
		// 	for(int j=0;j<n;j++)
		// 	{
		// 		if(grid[i][j]==0)
		// 		{
		// 			if(row[i][j]!=-1 and col[i][row[i][j]]!=-1)
		// 			{
		// 				can=0;
		// 			}
		// 			if(col[i][j]!=-1 and row[col[i][j]][j]!=-1)
		// 			{
		// 				can=0;
		// 			}
		// 			if(row[i][j]!=-1 and row[i][row[i][j]]!=-1)
		// 			{
		// 				can=0;
		// 			}
		// 			if(col[i][j]!=-1 and col[col[i][j]][j]!=-1)
		// 			{
		// 				can=0;
		// 			}
		// 		}
		// 	}
		// }
		if(can)
		{
			return (n*n)-(int)trees.size();
		}
		else
		{
			return min(1,(n*n)-(int)trees.size());
		}
	}
	return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 ms 600 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 600 KB ok
8 Correct 14 ms 4500 KB ok
9 Correct 252 ms 66896 KB ok

Subtask #2
0.0 / 8.0

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

Subtask #3
0.0 / 22.0

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

Subtask #4
0.0 / 18.0

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

Subtask #5
0.0 / 16.0

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

Subtask #6
0.0 / 30.0

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