이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int biggest_stadium(int n, vector<vector<int>> F) {
int r = -1, c = -1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (F[i][j] == 1) {
r = i, c = j;
}
}
}
if (c == -1) {
return n * n;
}
//cout << "r, c: " << r << ' ' << c << endl;
int ans = (c + 1) * (r) + c; //top left
//cout << "topleft: " << (c + 1) * (r) + c << endl;
ans = max(ans, (c + 1) * (n - r - 1) + c);//bot left
//cout << "botleft: " << (c + 1) * (n - r - 1) + c << endl;
ans = max(ans, (n - c) * (r) + n - c - 1);//topright
//cout << "topright: " << (n - c) * (r) + n - c - 1 << endl;
ans = max(ans, (n - c) * (n - r - 1) + n - c - 1); //bot right
//cout << "botright: " << (n - c) * (n - r - 1) + n - c - 1 << endl;
return ans;
}
# | 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... |