제출 #866157

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
866157	2023-10-25 13:35:49	vjudge1	Soccer Stadium (IOI23_soccer)	C++17	0 / 100	0 ms	600 KiB

soccer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "soccer.h"
using namespace std;
int biggest_stadium(int n, vector<vector<int>> f)
{
  vector<vector<int>> a(n+2, vector<int>(n+2, 1));
  vector<vector<int>> u(n+2, vector<int>(n+2, 0));// how many empty up
  vector<vector<int>> l(n+2, vector<int>(n+2, 0));// left
  vector<vector<int>> r(n+2, vector<int>(n+2, 0));// right
  vector<vector<int>> d(n+2, vector<int>(n+2, 0));// down
  for (int i = 0; i < n; i++){
    for (int j = 0; j < n; j++){
      a[i+1][j+1] = f[i][j];
    }
  }
  for (int i = 1; i <= n; i++){
    for (int j = 1; j <= n; j++){
      if (a[i][j]) continue;
      l[i][j] = l[i][j - 1] + 1;
      u[i][j] = u[i - 1][j] + 1;
    }
  }
  for (int i = n; i >= 1; i--){
    for (int j = n; j >= 1; j--){
      if (a[i][j]) continue;
      r[i][j] = r[i][j + 1] + 1;
      d[i][j] = d[i + 1][j] + 1;
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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