oj.uz

답안 #1017061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017061 2024-07-08T19:54:56 Z MilosMilutinovic 축구 경기장 (IOI23_soccer) C++17
70 / 100
 4500 ms 729668 KB 
#include "soccer.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int MAX = 2005;
const int LOG = 12;
 
int n, a[MAX][MAX];
int L[MAX][MAX];
int R[MAX][MAX];
int U[MAX][MAX];
int D[MAX][MAX];
int go[MAX][MAX];
int logs[MAX];
int st_U[MAX][MAX][LOG];
int st_D[MAX][MAX][LOG];
int res;
map<array<int, 4>, int> mx;
 
int query_U(int i, int l, int r) {
  int k = logs[r - l + 1];
  return max(st_U[i][l][k], st_U[i][r - (1 << k) + 1][k]);
}
 
int query_D(int i, int l, int r) {
  int k = logs[r - l + 1];
  return min(st_D[i][l][k], st_D[i][r - (1 << k) + 1][k]);
}
 
void rec(int xl, int xr, int yl, int yr, int side, int cur) {
  if (mx[{xl, xr, yl, yr}] >= cur) {
    return;
  }
  res = max(res, cur);
  mx[{xl, xr, yl, yr}] = cur;
  vector<array<int, 5>> f;
  if (xl > 0) {
    // up
    int ptr = yl;
    while (ptr <= yr) {
      if (a[xl - 1][ptr] == 1) {
        ptr = go[xl - 1][ptr];
        continue;
      }
      int t = min(yr, R[xl - 1][ptr]);
      int new_x = query_U(xl - 1, ptr, t);
      f.push_back({(t - ptr + 1) * (xl - new_x), new_x, xr, ptr, t});
      //rec(xl - 1, xr, ptr, t, 1, cur + t - ptr + 1);
      ptr = R[xl - 1][ptr] + 1;
    }
  }
  if (xr + 1 < n) {
    // down
    int ptr = yl;
    while (ptr <= yr) {
      if (a[xr + 1][ptr] == 1) {
        ptr = go[xr + 1][ptr];
        continue;
      }
      int t = min(yr, R[xr + 1][ptr]);
      int new_x = query_D(xr + 1, ptr, t);
      f.push_back({(t - ptr + 1) * (new_x - xr), xl, new_x, ptr, t});
      //rec(xl, xr + 1, ptr, t, 0, cur + t - ptr + 1);
      ptr = R[xr + 1][ptr] + 1;
    }
  }
  sort(f.rbegin(), f.rend());
  for (auto& p : f) {
    int sd = (p[1] == xl ? 0 : 1);
    rec(p[1], p[2], p[3], p[4], sd, cur + p[0]);
  }
}
 
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;
    }
  }
  for (int j = 0; j < n; j++) {
    for (int i = 0; i < n; i++) {
      if (a[i][j] == 1) {
        continue;
      }
      int p = i;
      while (p + 1 < n && a[p + 1][j] == 0) {
        p += 1;
      }
      for (int k = i; k <= p; k++) {
        U[k][j] = i;
        D[k][j] = p;
      }
      i = p;
    }
  }
  for (int i = 2; i <= n; i++) {
    logs[i] = logs[i >> 1] + 1;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      st_U[i][j][0] = U[i][j];
      st_D[i][j][0] = D[i][j];
    }
  }
  for (int k = 1; k < LOG; k++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j + (1 << k) <= n; j++) {
        st_U[i][j][k] = max(st_U[i][j][k - 1], st_U[i][j + (1 << (k - 1))][k - 1]);
        st_D[i][j][k] = min(st_D[i][j][k - 1], st_D[i][j + (1 << (k - 1))][k - 1]);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = n - 1; j >= 0; j--) {
      if (a[i][j] == 1) {
        go[i][j] = (j == n - 1 ? n : go[i][j + 1]);
      } else {
        go[i][j] = j;
      }
    }
  }
  res = 0;
  vector<array<int, 4>> s;
  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) {
        s.push_back({R[i][j] - j + 1, i, j, R[i][j]});
      }
    }
  }
  sort(s.rbegin(), s.rend());
  for (auto& p : s) {
    int i = p[1];
    int l = p[2], r = p[3];
    rec(i, i, l, r, -1, r - l + 1);
  }
  return res;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB ok

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16732 KB ok
2 Correct 2 ms 16868 KB ok
3 Correct 2 ms 16728 KB ok
4 Correct 2 ms 16732 KB ok
5 Correct 2 ms 14680 KB ok
6 Correct 2 ms 16728 KB ok
7 Correct 5 ms 37468 KB ok
8 Correct 30 ms 96652 KB ok
9 Correct 539 ms 511800 KB ok

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16732 KB ok
2 Correct 2 ms 16868 KB ok
3 Correct 2 ms 16732 KB ok
4 Correct 2 ms 16732 KB ok
5 Correct 1 ms 16732 KB ok
6 Correct 2 ms 16728 KB ok
7 Correct 2 ms 16732 KB ok
8 Correct 2 ms 16732 KB ok
9 Correct 2 ms 16732 KB ok
10 Correct 2 ms 16732 KB ok
11 Correct 1 ms 16844 KB ok
12 Correct 2 ms 16732 KB ok
13 Correct 1 ms 16732 KB ok

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB ok
2 Correct 2 ms 16732 KB ok
3 Correct 2 ms 16868 KB ok
4 Correct 2 ms 16732 KB ok
5 Correct 2 ms 16732 KB ok
6 Correct 1 ms 16732 KB ok
7 Correct 2 ms 16728 KB ok
8 Correct 2 ms 16732 KB ok
9 Correct 2 ms 16732 KB ok
10 Correct 2 ms 16732 KB ok
11 Correct 2 ms 16732 KB ok
12 Correct 1 ms 16844 KB ok
13 Correct 2 ms 16732 KB ok
14 Correct 1 ms 16732 KB ok
15 Correct 2 ms 16732 KB ok
16 Correct 2 ms 16732 KB ok
17 Correct 2 ms 16732 KB ok
18 Correct 2 ms 16732 KB ok
19 Correct 2 ms 16732 KB ok
20 Correct 2 ms 16732 KB ok
21 Correct 2 ms 16732 KB ok
22 Correct 2 ms 16988 KB ok
23 Correct 2 ms 16732 KB ok
24 Correct 2 ms 16732 KB ok
25 Correct 2 ms 16732 KB ok
26 Correct 2 ms 16732 KB ok

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB ok
2 Correct 2 ms 16732 KB ok
3 Correct 2 ms 16868 KB ok
4 Correct 2 ms 16728 KB ok
5 Correct 2 ms 16732 KB ok
6 Correct 2 ms 16732 KB ok
7 Correct 2 ms 16732 KB ok
8 Correct 1 ms 16732 KB ok
9 Correct 2 ms 16728 KB ok
10 Correct 2 ms 16732 KB ok
11 Correct 2 ms 16732 KB ok
12 Correct 2 ms 16732 KB ok
13 Correct 2 ms 16732 KB ok
14 Correct 1 ms 16844 KB ok
15 Correct 2 ms 16732 KB ok
16 Correct 1 ms 16732 KB ok
17 Correct 2 ms 16732 KB ok
18 Correct 2 ms 16732 KB ok
19 Correct 2 ms 16732 KB ok
20 Correct 2 ms 16732 KB ok
21 Correct 2 ms 16732 KB ok
22 Correct 2 ms 16732 KB ok
23 Correct 2 ms 16732 KB ok
24 Correct 2 ms 16988 KB ok
25 Correct 2 ms 16732 KB ok
26 Correct 2 ms 16732 KB ok
27 Correct 2 ms 16732 KB ok
28 Correct 2 ms 16732 KB ok
29 Correct 2 ms 16732 KB ok
30 Correct 3 ms 25016 KB ok
31 Correct 4 ms 25176 KB ok
32 Correct 3 ms 25024 KB ok
33 Correct 3 ms 24924 KB ok
34 Correct 3 ms 24924 KB ok
35 Correct 3 ms 24924 KB ok
36 Correct 2 ms 24924 KB ok
37 Correct 3 ms 24924 KB ok
38 Correct 2 ms 24924 KB ok
39 Correct 3 ms 24924 KB ok
40 Correct 3 ms 25080 KB ok
41 Correct 3 ms 25180 KB ok

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB ok
2 Correct 2 ms 16732 KB ok
3 Correct 2 ms 16868 KB ok
4 Correct 2 ms 16728 KB ok
5 Correct 2 ms 16732 KB ok
6 Correct 2 ms 16732 KB ok
7 Correct 2 ms 16732 KB ok
8 Correct 1 ms 16732 KB ok
9 Correct 2 ms 16728 KB ok
10 Correct 2 ms 16732 KB ok
11 Correct 2 ms 16732 KB ok
12 Correct 2 ms 16732 KB ok
13 Correct 2 ms 16732 KB ok
14 Correct 1 ms 16844 KB ok
15 Correct 2 ms 16732 KB ok
16 Correct 1 ms 16732 KB ok
17 Correct 2 ms 16732 KB ok
18 Correct 2 ms 16732 KB ok
19 Correct 2 ms 16732 KB ok
20 Correct 2 ms 16732 KB ok
21 Correct 2 ms 16732 KB ok
22 Correct 2 ms 16732 KB ok
23 Correct 2 ms 16732 KB ok
24 Correct 2 ms 16988 KB ok
25 Correct 2 ms 16732 KB ok
26 Correct 2 ms 16732 KB ok
27 Correct 2 ms 16732 KB ok
28 Correct 2 ms 16732 KB ok
29 Correct 2 ms 16732 KB ok
30 Correct 3 ms 25016 KB ok
31 Correct 4 ms 25176 KB ok
32 Correct 3 ms 25024 KB ok
33 Correct 3 ms 24924 KB ok
34 Correct 3 ms 24924 KB ok
35 Correct 3 ms 24924 KB ok
36 Correct 2 ms 24924 KB ok
37 Correct 3 ms 24924 KB ok
38 Correct 2 ms 24924 KB ok
39 Correct 3 ms 24924 KB ok
40 Correct 3 ms 25080 KB ok
41 Correct 3 ms 25180 KB ok
42 Correct 299 ms 124104 KB ok
43 Correct 230 ms 123080 KB ok
44 Correct 459 ms 130128 KB ok
45 Correct 482 ms 127828 KB ok
46 Correct 376 ms 128720 KB ok
47 Correct 41 ms 104784 KB ok
48 Correct 635 ms 109396 KB ok
49 Correct 375 ms 108092 KB ok
50 Correct 160 ms 125892 KB ok
51 Correct 143 ms 118476 KB ok
52 Correct 263 ms 103804 KB ok
53 Correct 36 ms 101456 KB ok
54 Correct 95 ms 103504 KB ok
55 Correct 214 ms 107864 KB ok
56 Correct 38 ms 104020 KB ok
57 Correct 110 ms 118612 KB ok
58 Correct 125 ms 116308 KB ok
59 Correct 124 ms 117108 KB ok

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16728 KB ok
2 Correct 2 ms 16732 KB ok
3 Correct 2 ms 16868 KB ok
4 Correct 2 ms 16728 KB ok
5 Correct 2 ms 16732 KB ok
6 Correct 2 ms 14680 KB ok
7 Correct 2 ms 16728 KB ok
8 Correct 5 ms 37468 KB ok
9 Correct 30 ms 96652 KB ok
10 Correct 539 ms 511800 KB ok
11 Correct 2 ms 16732 KB ok
12 Correct 2 ms 16732 KB ok
13 Correct 1 ms 16732 KB ok
14 Correct 2 ms 16728 KB ok
15 Correct 2 ms 16732 KB ok
16 Correct 2 ms 16732 KB ok
17 Correct 2 ms 16732 KB ok
18 Correct 2 ms 16732 KB ok
19 Correct 1 ms 16844 KB ok
20 Correct 2 ms 16732 KB ok
21 Correct 1 ms 16732 KB ok
22 Correct 2 ms 16732 KB ok
23 Correct 2 ms 16732 KB ok
24 Correct 2 ms 16732 KB ok
25 Correct 2 ms 16732 KB ok
26 Correct 2 ms 16732 KB ok
27 Correct 2 ms 16732 KB ok
28 Correct 2 ms 16732 KB ok
29 Correct 2 ms 16988 KB ok
30 Correct 2 ms 16732 KB ok
31 Correct 2 ms 16732 KB ok
32 Correct 2 ms 16732 KB ok
33 Correct 2 ms 16732 KB ok
34 Correct 2 ms 16732 KB ok
35 Correct 3 ms 25016 KB ok
36 Correct 4 ms 25176 KB ok
37 Correct 3 ms 25024 KB ok
38 Correct 3 ms 24924 KB ok
39 Correct 3 ms 24924 KB ok
40 Correct 3 ms 24924 KB ok
41 Correct 2 ms 24924 KB ok
42 Correct 3 ms 24924 KB ok
43 Correct 2 ms 24924 KB ok
44 Correct 3 ms 24924 KB ok
45 Correct 3 ms 25080 KB ok
46 Correct 3 ms 25180 KB ok
47 Correct 299 ms 124104 KB ok
48 Correct 230 ms 123080 KB ok
49 Correct 459 ms 130128 KB ok
50 Correct 482 ms 127828 KB ok
51 Correct 376 ms 128720 KB ok
52 Correct 41 ms 104784 KB ok
53 Correct 635 ms 109396 KB ok
54 Correct 375 ms 108092 KB ok
55 Correct 160 ms 125892 KB ok
56 Correct 143 ms 118476 KB ok
57 Correct 263 ms 103804 KB ok
58 Correct 36 ms 101456 KB ok
59 Correct 95 ms 103504 KB ok
60 Correct 214 ms 107864 KB ok
61 Correct 38 ms 104020 KB ok
62 Correct 110 ms 118612 KB ok
63 Correct 125 ms 116308 KB ok
64 Correct 124 ms 117108 KB ok
65 Execution timed out 4574 ms 729668 KB Time limit exceeded
66 Halted 0 ms 0 KB -