This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int N, vector<vector<int>> F) {
int r = -1, c = -1;
for(int l = 0; l < N; l++) {
for(int i = 0; i < N; i++) {
if(F[l][i] == 0) continue;
r = l, c = i;
}
}
if(r == -1) return N * N;
return max({r * N + (N - r) * c, r * c + (N - r) * N, r * (N - c) + (N - r) * N, r * N + (N - r) * (N - c)});
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |