oj.uz

답안 #1038065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038065 2024-07-29T12:38:06 Z erray 축구 경기장 (IOI23_soccer) C++17
29.5 / 100
 299 ms 39704 KB 
#include "soccer.h"
#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG 
  #include "/home/ioi/egoi2024/d2/debug.h"
#else 
  #define debug(...) void(37)
#endif

int biggest_stadium(int N, std::vector<std::vector<int>> F) {
  int tree_count = 0, one_tree_i, one_tree_j;
  for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
    if (F[i][j]) {
      tree_count++;
      one_tree_i = i, one_tree_j = j;
    }
  }
  if (tree_count <= 1) {
    if (tree_count == 0) return N * N;
    int i = one_tree_i;
    int j = one_tree_j;
    return N * N - min(i + 1, N - i) * min(j + 1, N - j);
  }
  if (true) {
    vector<int> T(N, -1), B(N, -1), L(N, -1), R(N, -1);
    for (int i = 0; i < N; ++i) {
      for (int j = 0; j < N; ++j) {
        if (F[i][j]) continue;
        if (T[j] == -1) T[j] = N - 1 - i;
        if (L[i] == -1) L[i] = N - 1 - j;
        B[j] = i;
        R[i] = j;
      }
    }
    int verc = 0, horc = 0;
    for (int i = 0; i < N; ++i) {
      if (L[i] != -1) {
        horc += 2 * (N - 1) - (L[i] + R[i]);
      } else {
        horc += N;
      }
      if (T[i] != -1) {
        verc += 2 * (N - 1) - (T[i] + B[i]);
      } else {
        verc += N;
      }
    }
    bool bad = (verc != tree_count || horc != tree_count);
    if (bad) {
      return 0;
    }
    debug(bad, L, R, B, T);
    int max_L = *max_element(L.begin(), L.end());
    int max_R = *max_element(R.begin(), R.end());
    int max_B = *max_element(B.begin(), B.end());
    int max_T = *max_element(T.begin(), T.end());
    int mx_H = -1;
    for (int i = 0; i < N; ++i) {
      if (L[i] == max_L && R[i] == max_R) mx_H = i;
    }
    if (mx_H == -1) bad = true;
    else {
      for (int i = 0; i < mx_H; ++i) {
        if (L[i] == -1) continue;
        if (L[i + 1] == -1 || L[i + 1] < L[i] || R[i + 1] < R[i]) bad = true;
      }    
      for (int i = mx_H + 1; i < N; ++i) {
        if (L[i] == -1) continue;
        if (L[i - 1] == -1 || L[i - 1] < L[i] || R[i - 1] < R[i]) bad = true;
      }
    } 
    vector<array<int, 2>> ranges;
    for (int i = 0; i < N; ++i) {
      if (L[i] != -1) ranges.push_back({L[i], R[i]});
    }
    sort(ranges.begin(), ranges.end());
    for (int i = 0; i < int(ranges.size()) - 1; ++i) {
      if (ranges[i + 1][1] < ranges[i][1]) bad = true;
    }
    if (bad) {
      return 0;
    } else {
      return N * N - tree_count;
    }
  }
    
}

Compilation message

soccer.cpp: In function 'int biggest_stadium(int, std::vector<std::vector<int> >)':
soccer.cpp:57:9: warning: unused variable 'max_B' [-Wunused-variable]
   57 |     int max_B = *max_element(B.begin(), B.end());
      |         ^~~~~
soccer.cpp:58:9: warning: unused variable 'max_T' [-Wunused-variable]
   58 |     int max_T = *max_element(T.begin(), T.end());
      |         ^~~~~
soccer.cpp:24:46: warning: 'one_tree_j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |     return N * N - min(i + 1, N - i) * min(j + 1, N - j);
      |                                            ~~^~~
soccer.cpp:24:26: warning: 'one_tree_i' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |     return N * N - min(i + 1, N - i) * min(j + 1, N - j);
      |                        ~~^~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 16 ms 2396 KB ok
9 Correct 200 ms 31824 KB ok

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 ms 348 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 372 KB partial
7 Partially correct 0 ms 348 KB partial
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 372 KB partial
8 Partially correct 0 ms 348 KB partial
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Partially correct 1 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 1 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Correct 1 ms 344 KB ok
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 344 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 1 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial

Subtask #4
4.5 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 372 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 1 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 1 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 1 ms 344 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 344 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 344 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 436 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 ms 344 KB partial
41 Partially correct 0 ms 348 KB partial

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 372 KB partial
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
18 Partially correct 1 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 1 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 1 ms 344 KB ok
23 Correct 0 ms 348 KB ok
24 Partially correct 0 ms 344 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 1 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 1 ms 348 KB partial
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 344 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 436 KB partial
39 Partially correct 1 ms 348 KB partial
40 Partially correct 1 ms 344 KB partial
41 Partially correct 0 ms 348 KB partial
42 Partially correct 17 ms 2908 KB partial
43 Partially correct 24 ms 2640 KB partial
44 Partially correct 20 ms 2824 KB partial
45 Partially correct 14 ms 2908 KB partial
46 Partially correct 19 ms 2908 KB partial
47 Partially correct 14 ms 2700 KB partial
48 Correct 12 ms 2904 KB ok
49 Partially correct 26 ms 2908 KB partial
50 Partially correct 26 ms 2904 KB partial
51 Partially correct 13 ms 2908 KB partial
52 Partially correct 17 ms 2908 KB partial
53 Partially correct 24 ms 2904 KB partial
54 Partially correct 13 ms 2904 KB partial
55 Partially correct 18 ms 2900 KB partial
56 Partially correct 12 ms 2908 KB partial
57 Partially correct 26 ms 2640 KB partial
58 Partially correct 16 ms 2904 KB partial
59 Partially correct 26 ms 2824 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 348 KB ok
9 Correct 16 ms 2396 KB ok
10 Correct 200 ms 31824 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 372 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Correct 0 ms 348 KB ok
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 1 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Correct 1 ms 344 KB ok
28 Correct 0 ms 348 KB ok
29 Partially correct 0 ms 344 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 1 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 1 ms 348 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Correct 0 ms 348 KB ok
40 Correct 0 ms 344 KB ok
41 Partially correct 0 ms 348 KB partial
42 Partially correct 0 ms 348 KB partial
43 Partially correct 1 ms 436 KB partial
44 Partially correct 1 ms 348 KB partial
45 Partially correct 1 ms 344 KB partial
46 Partially correct 0 ms 348 KB partial
47 Partially correct 17 ms 2908 KB partial
48 Partially correct 24 ms 2640 KB partial
49 Partially correct 20 ms 2824 KB partial
50 Partially correct 14 ms 2908 KB partial
51 Partially correct 19 ms 2908 KB partial
52 Partially correct 14 ms 2700 KB partial
53 Correct 12 ms 2904 KB ok
54 Partially correct 26 ms 2908 KB partial
55 Partially correct 26 ms 2904 KB partial
56 Partially correct 13 ms 2908 KB partial
57 Partially correct 17 ms 2908 KB partial
58 Partially correct 24 ms 2904 KB partial
59 Partially correct 13 ms 2904 KB partial
60 Partially correct 18 ms 2900 KB partial
61 Partially correct 12 ms 2908 KB partial
62 Partially correct 26 ms 2640 KB partial
63 Partially correct 16 ms 2904 KB partial
64 Partially correct 26 ms 2824 KB partial
65 Partially correct 250 ms 39504 KB partial
66 Partially correct 240 ms 39688 KB partial
67 Partially correct 255 ms 39560 KB partial
68 Partially correct 299 ms 39680 KB partial
69 Partially correct 225 ms 39688 KB partial
70 Partially correct 200 ms 39508 KB partial
71 Partially correct 197 ms 39556 KB partial
72 Partially correct 201 ms 39568 KB partial
73 Correct 258 ms 39560 KB ok
74 Correct 228 ms 39568 KB ok
75 Partially correct 211 ms 39564 KB partial
76 Partially correct 223 ms 39504 KB partial
77 Partially correct 235 ms 39508 KB partial
78 Partially correct 206 ms 39508 KB partial
79 Partially correct 221 ms 39560 KB partial
80 Partially correct 231 ms 39564 KB partial
81 Partially correct 198 ms 39688 KB partial
82 Partially correct 242 ms 39508 KB partial
83 Partially correct 222 ms 39504 KB partial
84 Partially correct 207 ms 39572 KB partial
85 Partially correct 198 ms 39576 KB partial
86 Partially correct 193 ms 39504 KB partial
87 Partially correct 194 ms 39508 KB partial
88 Partially correct 195 ms 39704 KB partial
89 Partially correct 211 ms 39696 KB partial
90 Partially correct 195 ms 39696 KB partial
91 Partially correct 196 ms 39508 KB partial
92 Partially correct 204 ms 39508 KB partial
93 Partially correct 215 ms 39504 KB partial
94 Partially correct 207 ms 39560 KB partial
95 Partially correct 197 ms 39504 KB partial
96 Partially correct 201 ms 39504 KB partial
97 Partially correct 243 ms 39560 KB partial
98 Partially correct 197 ms 39508 KB partial
99 Partially correct 207 ms 39564 KB partial
100 Partially correct 204 ms 39700 KB partial
101 Partially correct 201 ms 39696 KB partial
102 Partially correct 199 ms 39504 KB partial
103 Partially correct 197 ms 39504 KB partial
104 Partially correct 207 ms 39692 KB partial
105 Partially correct 197 ms 39508 KB partial
106 Partially correct 198 ms 39528 KB partial
107 Partially correct 201 ms 39564 KB partial
108 Partially correct 204 ms 39692 KB partial
109 Partially correct 203 ms 39572 KB partial