Submission #995784

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
995784	2024-06-09T23:02:13 Z	aaaaaarroz	Soccer Stadium (IOI23_soccer)	C++17	1.5 / 100	214 ms	31780 KB

soccer

#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, vector<vector<int>> F){
	int empty_cells=0;
	bool si_hay_arbol=false;
	pair<int,int>arbol;
	for(int i=0;i<N;i++){
		for(int j=0;j<N;j++){
			if(F[i][j]==0){
				empty_cells++;
			}
			else{
				arbol={i,j};
				si_hay_arbol=true;
			}
		}
	}
	if(!si_hay_arbol){
		return N*N;
	}
	else{
		int a=((arbol.first+1)*(arbol.second+1))+min((arbol.first+1),(arbol.second+1));
		int b=(((arbol.first+1)*(N-arbol.second))+min((arbol.first+1),(N-arbol.second)));
		int c=(((N-arbol.first)*(arbol.second+1))+min((N-arbol.first),(arbol.second+1)));
		int d=(((N-arbol.first)*(N-arbol.second))+min((N-arbol.first),(N-arbol.second)));
		int restar= min(min(a,b),min(c,d));
		return (N*N)-restar+1;
	}
}

Subtask #0

0.0 / 0.0

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

Subtask #1

1.5 / 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	344 KB	ok
5	Correct	0 ms	348 KB	ok
6	Partially correct	0 ms	348 KB	partial
7	Partially correct	1 ms	344 KB	partial
8	Partially correct	13 ms	2196 KB	partial
9	Partially correct	214 ms	31780 KB	partial

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