oj.uz

Submission #1069603

# Submission time Handle Problem Language Result Execution time Memory
1069603 2024-08-22T06:45:10 Z Faisal_Saqib Soccer Stadium (IOI23_soccer) C++17
6 / 100
 195 ms 37952 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;
	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 / 0.0

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

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 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 18 ms 2696 KB ok
9 Correct 195 ms 37952 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 Partially correct 0 ms 344 KB partial
4 Partially correct 1 ms 344 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 1 ms 348 KB partial
7 Partially correct 0 ms 344 KB partial
8 Incorrect 0 ms 348 KB wrong
9 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 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 0 ms 344 KB partial
5 Partially correct 1 ms 344 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 0 ms 344 KB partial
9 Incorrect 0 ms 348 KB wrong
10 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 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 344 KB partial
7 Partially correct 1 ms 344 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 KB partial
10 Partially correct 0 ms 344 KB partial
11 Incorrect 0 ms 348 KB wrong
12 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 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 344 KB partial
7 Partially correct 1 ms 344 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 1 ms 348 KB partial
10 Partially correct 0 ms 344 KB partial
11 Incorrect 0 ms 348 KB wrong
12 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 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 348 KB ok
9 Correct 18 ms 2696 KB ok
10 Correct 195 ms 37952 KB ok
11 Partially correct 0 ms 344 KB partial
12 Partially correct 1 ms 344 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 0 ms 344 KB partial
16 Incorrect 0 ms 348 KB wrong
17 Halted 0 ms 0 KB -