제출 #1327753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1327753		SpyrosAliv	Soccer Stadium (IOI23_soccer)	C++20	0 / 100	0 ms	332 KiB

soccer

#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;
    if (grid[0][0] || grid[n-1][0] || grid[0][n-1] || grid[n-1][n-1]) {
        return n * n - 1;
    }
    int r = 0, c = 0;
    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);
    return ans;
}

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