| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1327754 | SpyrosAliv | 축구 경기장 (IOI23_soccer) | C++20 | 181 ms | 47372 KiB |
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<vector<int>> grid;
int biggest_stadium(int N, std::vector<std::vector<int>> F) {
n = N;
grid = F;
int r = -1, c = -1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (grid[i][j]) {
r = i;
c = j;
}
}
}
int toL = c, toR = n - c - 1, toU = r, toD = n - r - 1;
int ans = toL * n + toU * n - toU * toL;
ans = max(ans, toU * n + toR * n - toU * toR);
ans = max(ans, toR * n + toD * n - toR * toD);
ans = max(ans, toD * n + toL * n - toD * toL);
if (r == -1) ans = n * n;
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... | ||||
