Submission #1077987

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077987		idas	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	287 ms	63060 KiB

soccer

#include "bits/stdc++.h"
#include "soccer.h"

#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define pb push_back

using namespace std;
typedef vector<int> vi;

const int N=3e3+10;
int n, f[N][N];

int biggest_stadium(int N, std::vector<std::vector<int>> F) {
    n=N; FOR(i, 0, n) FOR(j, 0, n) f[i][j]=F[i][j];

    int ans=-1;
    FOR(i, 0, n) {
        FOR(j, 0, n) {
            if(f[i][j]) {
                ans=max(ans, n*n-1-(n-1-i)-(n-1-j));
                ans=max(ans, n*n-1-i-(n-1-j));
                ans=max(ans, n*n-1-j-(n-1-i));
                ans=max(ans, n*n-1-i-j);
            }
        }
    }

    return ans==-1?n*n:ans;
}
/*
5
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 1 0 0 0


0 0
0 0
*/

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