Submission #1195649

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195649		mannshah1211	축구 경기장 (IOI23_soccer)	C++20	1.50 / 100	187 ms	31772 KiB

soccer

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

using namespace std;

int biggest_stadium(int n, vector<vector<int>> f) {
  int tree_i = -1, tree_j = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (f[i][j] == 1) {
        tree_i = i; tree_j = j;
      }
    }
  }
  if (tree_i == -1 && tree_j == -1) {
    return n * n;
  }
  auto edging = [&](int x) {
    if (x == 0) {
      return true;
    }
    if (x == n - 1) {
      return true;
    }
    return false;
  };
  if (edging(tree_i) && edging(tree_j)) {
    return n * n - 1;
  }
  if (edging(tree_i)) {
    return n * n - n;
  }
  if (edging(tree_j)) {
    return n * n - n;
  }
  return n * max({tree_i, tree_j, n - 1 - tree_i, n - 1 - tree_j});
}

• 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