Submission #1235510

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235510		k1r1t0	Soccer Stadium (IOI23_soccer)	C++20	6 / 100	188 ms	31772 KiB

soccer

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int biggest_stadium(int n, vector<vector<int>> f) {
	int it = -1, jt = -1;
	for (int i = 0; i < n; i++)
	for (int j = 0; j < n; j++)
		if (f[i][j]) it = i, jt = j;
	return n * n - min({(it + 1) * (jt + 1), (n - it) * (jt + 1), (it + 1) * (n - jt), (n - it) * (n - jt)});
}














/*
int main()
{
    int N;
    assert(1 == scanf("%d", &N));
    std::vector<std::vector<int>> F(N, std::vector<int>(N));
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            assert(1 == scanf("%d", &F[i][j]));
        }
    }
    fclose(stdin);

    int res = biggest_stadium(N, F);

    printf("%d\n", res);
    fclose(stdout);
    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