제출 #996937

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996937		MilosMilutinovic	축구 경기장 (IOI23_soccer)	C++17	30 / 100	4548 ms	8528 KiB

soccer

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

using namespace std;

const int MAX = 2005;

int n, a[MAX][MAX];
int L[MAX][MAX];
int R[MAX][MAX];
int res;
map<array<int, 5>, bool> was;

void rec(int xl, int xr, int yl, int yr, int cur) {
  if (was[{xl, xr, yl, yr, cur}]) {
    return;
  }
  res = max(res, cur);
  was[{xl, xr, yl, yr}] = true;
  if (xl > 0) {
    // up
    for (int i = yl; i <= yr; i++) {
      if (a[xl - 1][i] == 1) {
        continue;
      }
      int t = min(yr, R[xl - 1][i]);
      rec(xl - 1, xr, i, t, cur + t - i + 1);
    }
  }
  if (xr + 1 < n) {
    // down
    for (int i = yl; i <= yr; i++) {
      if (a[xr + 1][i] == 1) {
        continue;
      }
      int t = min(yr, R[xr + 1][i]);
      rec(xl, xr + 1, i, t, cur + t - i + 1);
    }
  }
}

int biggest_stadium(int N, vector<vector<int>> F) {
  n = N;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      a[i][j] = F[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (a[i][j] == 1) {
        continue;
      }
      int p = j;
      while (p + 1 < n && a[i][p + 1] == 0) {
        p += 1;
      }
      for (int k = j; k <= p; k++) {
        L[i][k] = j;
        R[i][k] = p;
      }
      j = p;
    }
  }
  res = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (a[i][j] == 1) {
        continue;
      }
      if (j == 0 || a[i][j - 1] == 1) {
        rec(i, i, j, R[i][j], R[i][j] - j + 1);
      }
    }
  }
  return res;
}

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