oj.uz

답안 #1059684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059684 2024-08-15T07:08:00 Z mychecksedad 축구 경기장 (IOI23_soccer) C++17
25 / 100
 349 ms 134932 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long
#define ff first
#define ss second
const int N = 200005;

int arr[4][2]={
    {0, 1},
    {0, -1},
    {1, 0},
    {-1, 0}
};
int biggest_stadium(int n, std::vector<std::vector<int>> a)
{
  vector<vector<int>> U(n, vector<int>(n));
  vector<vector<int>> U2(n, vector<int>(n));
  vector<vector<int>> L(n, vector<int>(n));
  vector<vector<int>> L2(n, vector<int>(n));
  vector<vector<int>> R2(n, vector<int>(n));
  vector<vector<int>> pref(n, vector<int>(n));
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j){
      pref[i][j] = a[i][j] == 0;
      if(i > 0) pref[i][j] += pref[i - 1][j];
      if(j > 0) pref[i][j] += pref[i][j - 1];
      if(i > 0 && j > 0) pref[i][j] -= pref[i - 1][j - 1];
      
      if(i == 0){
        if(a[i][j] == 1) U[i][j] = i;
        else U[i][j] = -1;
      }else{
        if(a[i][j] == 1){
          if(a[i - 1][j] == 1) U[i][j] = U[i - 1][j];
          else U[i][j] = i;
        }else{
          U[i][j] = -1;
        }
      }
      if(j == 0){
        if(a[i][j] == 1) L[i][j] = j;
        else L[i][j] = -1;
      }else{
        if(a[i][j] == 1){
          if(a[i][j - 1] == 1) L[i][j] = L[i][j - 1];
          else L[i][j] = j;
        }else{
          L[i][j] = -1;
        }
      }

      if(i == 0){
        if(a[i][j] == 0) U2[i][j] = i;
        else U2[i][j] = -1;
      }else{
        if(a[i][j] == 0){
          if(a[i - 1][j] == 0) U2[i][j] = U2[i - 1][j];
          else U2[i][j] = i;
        }else{
          U2[i][j] = -1;
        }
      }
      if(j == 0){
        if(a[i][j] == 0) L2[i][j] = j;
        else L2[i][j] = -1;
      }else{
        if(a[i][j] == 0){
          if(a[i][j - 1] == 0) L2[i][j] = L2[i][j - 1];
          else L2[i][j] = j;
        }else{
          L2[i][j] = -1;
        }
      }
    }
    for(int j = n-1; j >= 0; --j){
      if(j == n-1){
        if(a[i][j] == 0) R2[i][j] = j;
        else R2[i][j] = -1;
      }else{
        if(a[i][j] == 0){
          if(a[i][j + 1] == 0) R2[i][j] = R2[i][j + 1];
          else R2[i][j] = j;
        }else{
          R2[i][j] = -1;
        }
      }
    }
  }
  queue<pair<int, int>> q;
  vector<vector<bool>> vis(n, vector<bool>(n));
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j){
      if(a[i][j] == 0){
        q.push({i, j});
        vis[i][j] = 1;
        break;
      }
    }
    if(q.size()) break;
  }
  int sz = 0;
  while(!q.empty()){
    int x = q.front().ff;
    int y = q.front().ss;
    q.pop();
    for(int i = 0; i < 4; ++i){
      int nx = x + arr[i][0];
      int ny = y + arr[i][1];
      if(nx >= 0 && ny >= 0 && nx < n && ny < n && !vis[nx][ny] && a[nx][ny] == 0){
        vis[nx][ny] = 1;
        q.push({nx, ny});
      }
    }
  }
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < n; ++j){
      if(a[i][j] == 0 && vis[i][j] == 0){
        return 0;
      }
      if(a[i][j] == 1) continue;
      ++sz;
      if(i > 0){
        if(a[i - 1][j] == 1){
          int pos = U[i - 1][j];
          if(pos > 0 && a[pos - 1][j] == 0){
            return 0;
          }
        }
      }
      if(j > 0){
        if(a[i][j - 1] == 1){
          int pos = L[i][j - 1];
          if(pos > 0 && a[i][pos - 1] == 0){
            return 0;
          }
        }
      }
      int lx = L2[i][j];
      int rx = R2[i][j];
      int dx = U2[i][j];
      // dx - 1, lx - 1
      // dx - 1, n - 1 / dx - 1, rx
      if(dx > 0 && lx > 0){
        if(pref[dx - 1][lx - 1] > 0) return 0;
      }
      if(dx > 0){
        if(pref[dx - 1][n - 1] - pref[dx - 1][rx] > 0) return 0;
      }
    }
  }

  return sz;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
1.5 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 436 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 748 KB partial
8 Partially correct 22 ms 8896 KB partial
9 Partially correct 299 ms 134932 KB partial

Subtask #2
2.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 0 ms 344 KB partial
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 388 KB partial
6 Partially correct 0 ms 348 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 344 KB partial
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

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

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 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 Partially correct 0 ms 344 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 0 ms 388 KB partial
9 Partially correct 0 ms 348 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 344 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 0 ms 348 KB partial
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 Partially correct 0 ms 348 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 436 KB ok
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 344 KB partial
26 Partially correct 0 ms 344 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 348 KB partial
29 Partially correct 0 ms 344 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 436 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 344 KB ok
35 Correct 0 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial
42 Partially correct 21 ms 8840 KB partial
43 Partially correct 31 ms 8844 KB partial
44 Partially correct 19 ms 8792 KB partial
45 Partially correct 19 ms 8796 KB partial
46 Partially correct 24 ms 8792 KB partial
47 Partially correct 19 ms 8796 KB partial
48 Correct 18 ms 8796 KB ok
49 Partially correct 17 ms 8836 KB partial
50 Partially correct 24 ms 8796 KB partial
51 Partially correct 15 ms 8796 KB partial
52 Partially correct 16 ms 8796 KB partial
53 Partially correct 18 ms 8804 KB partial
54 Partially correct 16 ms 8804 KB partial
55 Partially correct 16 ms 8844 KB partial
56 Partially correct 17 ms 8792 KB partial
57 Partially correct 23 ms 8936 KB partial
58 Partially correct 18 ms 8796 KB partial
59 Partially correct 17 ms 8792 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB partial
2 Correct 0 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 436 KB ok
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 748 KB partial
9 Partially correct 22 ms 8896 KB partial
10 Partially correct 299 ms 134932 KB partial
11 Partially correct 0 ms 344 KB partial
12 Partially correct 0 ms 348 KB partial
13 Partially correct 0 ms 388 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 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 344 KB partial
21 Correct 0 ms 348 KB ok
22 Partially correct 0 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Correct 0 ms 348 KB ok
28 Correct 0 ms 436 KB ok
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 344 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Partially correct 0 ms 344 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 436 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 1 ms 344 KB ok
40 Correct 0 ms 348 KB ok
41 Partially correct 0 ms 348 KB partial
42 Partially correct 0 ms 348 KB partial
43 Partially correct 0 ms 348 KB partial
44 Partially correct 0 ms 348 KB partial
45 Partially correct 0 ms 348 KB partial
46 Partially correct 0 ms 348 KB partial
47 Partially correct 21 ms 8840 KB partial
48 Partially correct 31 ms 8844 KB partial
49 Partially correct 19 ms 8792 KB partial
50 Partially correct 19 ms 8796 KB partial
51 Partially correct 24 ms 8792 KB partial
52 Partially correct 19 ms 8796 KB partial
53 Correct 18 ms 8796 KB ok
54 Partially correct 17 ms 8836 KB partial
55 Partially correct 24 ms 8796 KB partial
56 Partially correct 15 ms 8796 KB partial
57 Partially correct 16 ms 8796 KB partial
58 Partially correct 18 ms 8804 KB partial
59 Partially correct 16 ms 8804 KB partial
60 Partially correct 16 ms 8844 KB partial
61 Partially correct 17 ms 8792 KB partial
62 Partially correct 23 ms 8936 KB partial
63 Partially correct 18 ms 8796 KB partial
64 Partially correct 17 ms 8792 KB partial
65 Partially correct 323 ms 134580 KB partial
66 Partially correct 292 ms 134480 KB partial
67 Partially correct 306 ms 134540 KB partial
68 Partially correct 311 ms 134736 KB partial
69 Partially correct 293 ms 134576 KB partial
70 Partially correct 345 ms 134536 KB partial
71 Partially correct 292 ms 134552 KB partial
72 Partially correct 349 ms 134736 KB partial
73 Correct 319 ms 134540 KB ok
74 Correct 283 ms 134740 KB ok
75 Partially correct 266 ms 134616 KB partial
76 Partially correct 320 ms 134740 KB partial
77 Partially correct 304 ms 134680 KB partial
78 Partially correct 243 ms 134668 KB partial
79 Partially correct 267 ms 134544 KB partial
80 Partially correct 251 ms 134484 KB partial
81 Partially correct 247 ms 134664 KB partial
82 Partially correct 255 ms 134484 KB partial
83 Partially correct 258 ms 134480 KB partial
84 Partially correct 271 ms 134484 KB partial
85 Partially correct 267 ms 134676 KB partial
86 Partially correct 257 ms 134672 KB partial
87 Partially correct 255 ms 134716 KB partial
88 Partially correct 259 ms 134480 KB partial
89 Partially correct 281 ms 134484 KB partial
90 Partially correct 285 ms 134484 KB partial
91 Partially correct 281 ms 134744 KB partial
92 Partially correct 258 ms 134740 KB partial
93 Partially correct 264 ms 134480 KB partial
94 Partially correct 247 ms 134480 KB partial
95 Partially correct 254 ms 134484 KB partial
96 Partially correct 243 ms 134676 KB partial
97 Partially correct 257 ms 134484 KB partial
98 Partially correct 248 ms 134480 KB partial
99 Partially correct 256 ms 134484 KB partial
100 Partially correct 280 ms 134668 KB partial
101 Partially correct 245 ms 134484 KB partial
102 Partially correct 240 ms 134484 KB partial
103 Partially correct 281 ms 134484 KB partial
104 Partially correct 249 ms 134676 KB partial
105 Partially correct 250 ms 134548 KB partial
106 Partially correct 281 ms 134480 KB partial
107 Partially correct 280 ms 134480 KB partial
108 Partially correct 250 ms 134484 KB partial
109 Partially correct 255 ms 134484 KB partial