oj.uz

답안 #1078564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078564 2024-08-27T21:12:44 Z myst6 축구 경기장 (IOI23_soccer) C++17
25 / 100
 297 ms 55544 KB 
#include <bits/stdc++.h>

using namespace std;

bool dp[4][2005][2005];

int biggest_stadium(int N, vector<vector<int>> F) {
    for (int i=0; i<N; i++) {
        for (int j=0; j<N; j++) {
            bool tree = F[i][j] == 1;
            bool to = i == 0 || dp[0][i-1][j];
            bool le = j == 0 || dp[0][i][j-1];
            dp[0][i][j] = tree && to && le;
        }
    }
    for (int i=0; i<N; i++) {
        for (int j=N-1; j>=0; j--) {
            bool tree = F[i][j] == 1;
            bool to = i == 0 || dp[1][i-1][j];
            bool ri = j == N-1 || dp[1][i][j+1];
            dp[1][i][j] = tree && to && ri;
        }
    }
    for (int i=N-1; i>=0; i--) {
        for (int j=0; j<N; j++) {
            bool tree = F[i][j] == 1;
            bool bo = i == N-1 || dp[2][i+1][j];
            bool le = j == 0 || dp[2][i][j-1];
            dp[2][i][j] = tree && bo && le;
        }
    }
    for (int i=N-1; i>=0; i--) {
        for (int j=N-1; j>=0; j--) {
            bool tree = F[i][j] == 1;
            bool bo = i == N-1 || dp[3][i+1][j];
            bool ri = j == N-1 || dp[3][i][j+1];
            dp[3][i][j] = tree && bo && ri;
        }
    }

    bool entire = true;
    int sz = 0;

    for (int i=0; i<N; i++) {
        for (int j=0; j<N; j++) {
            bool tree = F[i][j] == 1;
            if (tree && !dp[0][i][j] && !dp[1][i][j] && !dp[2][i][j] && !dp[3][i][j]) {
                entire = false;
                // cout << i << "," << j << "\n";
                break;
            }
            sz += 1 - tree;
        }
    }

    // check row intervals work
    int i1 = 0, i2 = N-1;
    while (i1 < i2) {
        int tl = -1, tr = N;
        for (int j=0; j<N; j++) {
            if (dp[0][i1][j]) tl = j;
            else break;
        }
        for (int j=N-1; j>=0; j--) {
            if (dp[1][i1][j]) tr = j;
            else break;
        }

        int bl = -1, br = N;
        for (int j=0; j<N; j++) {
            if (dp[2][i2][j]) bl = j;
            else break;
        }
        for (int j=N-1; j>=0; j--) {
            if (dp[3][i2][j]) br = j;
            else break;
        }

        int l = max(bl, tl);
        int r = min(br, tr);
        
        if (l == tl && r == tr) i1++;
        else if (l == bl && r == br) i2--;
        else { entire = false; break; }
    }

    // check column intervals work
    int j1 = 0, j2 = N-1;
    while (j1 < j2) {
        int tl = -1, bl = N;
        for (int i=0; i<N; i++) {
            if (dp[0][i][j1]) tl = i;
            else break;
        }
        for (int i=N-1; i>=0; i--) {
            if (dp[2][i][j1]) bl = i;
            else break;
        }

        int tr = -1, br = N;
        for (int i=0; i<N; i++) {
            if (dp[1][i][j2]) tr = i;
            else break;
        }
        for (int i=N-1; i>=0; i--) {
            if (dp[3][i][j2]) br = i;
            else break;
        }

        int t = max(tl, tr);
        int b = min(bl, br);
            
        if (t == tr && b == br) j1++;
        else if (t == tl && b == bl) j2--;
        else { entire = false; break; }
    }

    if (entire) {
        return sz;
    } else {
        return 0;
    }
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 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 1 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 1 ms 344 KB ok
6 Partially correct 1 ms 348 KB partial
7 Partially correct 2 ms 1116 KB partial
8 Partially correct 16 ms 6748 KB partial
9 Partially correct 269 ms 55308 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 1 ms 600 KB partial
4 Partially correct 1 ms 348 KB partial
5 Partially correct 1 ms 348 KB partial
6 Partially correct 0 ms 444 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 1 ms 348 KB partial
11 Partially correct 1 ms 348 KB partial
12 Partially correct 1 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 0 ms 348 KB ok
4 Partially correct 1 ms 600 KB partial
5 Partially correct 1 ms 348 KB partial
6 Partially correct 1 ms 348 KB partial
7 Partially correct 0 ms 444 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 1 ms 348 KB partial
12 Partially correct 1 ms 348 KB partial
13 Partially correct 1 ms 348 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 1 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 444 KB partial
20 Correct 1 ms 348 KB ok
21 Correct 1 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 440 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 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 1 ms 600 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 0 ms 444 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 1 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 444 KB partial
22 Correct 1 ms 348 KB ok
23 Correct 1 ms 348 KB ok
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 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 440 KB partial
29 Partially correct 0 ms 344 KB partial
30 Partially correct 1 ms 604 KB partial
31 Partially correct 0 ms 600 KB partial
32 Partially correct 1 ms 604 KB partial
33 Partially correct 0 ms 604 KB partial
34 Correct 1 ms 604 KB ok
35 Correct 1 ms 604 KB ok
36 Partially correct 1 ms 604 KB partial
37 Partially correct 0 ms 604 KB partial
38 Partially correct 0 ms 700 KB partial
39 Partially correct 0 ms 704 KB partial
40 Partially correct 1 ms 604 KB partial
41 Partially correct 0 ms 604 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 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 1 ms 600 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 0 ms 444 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 1 ms 348 KB partial
14 Partially correct 1 ms 348 KB partial
15 Partially correct 1 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 444 KB partial
22 Correct 1 ms 348 KB ok
23 Correct 1 ms 348 KB ok
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 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 440 KB partial
29 Partially correct 0 ms 344 KB partial
30 Partially correct 1 ms 604 KB partial
31 Partially correct 0 ms 600 KB partial
32 Partially correct 1 ms 604 KB partial
33 Partially correct 0 ms 604 KB partial
34 Correct 1 ms 604 KB ok
35 Correct 1 ms 604 KB ok
36 Partially correct 1 ms 604 KB partial
37 Partially correct 0 ms 604 KB partial
38 Partially correct 0 ms 700 KB partial
39 Partially correct 0 ms 704 KB partial
40 Partially correct 1 ms 604 KB partial
41 Partially correct 0 ms 604 KB partial
42 Partially correct 18 ms 6748 KB partial
43 Partially correct 17 ms 6744 KB partial
44 Partially correct 17 ms 6660 KB partial
45 Partially correct 19 ms 6744 KB partial
46 Partially correct 17 ms 6744 KB partial
47 Partially correct 18 ms 6748 KB partial
48 Correct 19 ms 6748 KB ok
49 Partially correct 23 ms 6740 KB partial
50 Partially correct 17 ms 6740 KB partial
51 Partially correct 17 ms 6748 KB partial
52 Partially correct 18 ms 6748 KB partial
53 Partially correct 19 ms 6748 KB partial
54 Partially correct 25 ms 6812 KB partial
55 Partially correct 19 ms 6740 KB partial
56 Partially correct 18 ms 6744 KB partial
57 Partially correct 20 ms 6744 KB partial
58 Partially correct 20 ms 6744 KB partial
59 Partially correct 23 ms 6600 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 0 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 344 KB ok
7 Partially correct 1 ms 348 KB partial
8 Partially correct 2 ms 1116 KB partial
9 Partially correct 16 ms 6748 KB partial
10 Partially correct 269 ms 55308 KB partial
11 Partially correct 1 ms 600 KB partial
12 Partially correct 1 ms 348 KB partial
13 Partially correct 1 ms 348 KB partial
14 Partially correct 0 ms 444 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 1 ms 348 KB partial
19 Partially correct 1 ms 348 KB partial
20 Partially correct 1 ms 348 KB partial
21 Correct 0 ms 348 KB ok
22 Partially correct 1 ms 348 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 444 KB partial
27 Correct 1 ms 348 KB ok
28 Correct 1 ms 348 KB ok
29 Partially correct 0 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 0 ms 440 KB partial
34 Partially correct 0 ms 344 KB partial
35 Partially correct 1 ms 604 KB partial
36 Partially correct 0 ms 600 KB partial
37 Partially correct 1 ms 604 KB partial
38 Partially correct 0 ms 604 KB partial
39 Correct 1 ms 604 KB ok
40 Correct 1 ms 604 KB ok
41 Partially correct 1 ms 604 KB partial
42 Partially correct 0 ms 604 KB partial
43 Partially correct 0 ms 700 KB partial
44 Partially correct 0 ms 704 KB partial
45 Partially correct 1 ms 604 KB partial
46 Partially correct 0 ms 604 KB partial
47 Partially correct 18 ms 6748 KB partial
48 Partially correct 17 ms 6744 KB partial
49 Partially correct 17 ms 6660 KB partial
50 Partially correct 19 ms 6744 KB partial
51 Partially correct 17 ms 6744 KB partial
52 Partially correct 18 ms 6748 KB partial
53 Correct 19 ms 6748 KB ok
54 Partially correct 23 ms 6740 KB partial
55 Partially correct 17 ms 6740 KB partial
56 Partially correct 17 ms 6748 KB partial
57 Partially correct 18 ms 6748 KB partial
58 Partially correct 19 ms 6748 KB partial
59 Partially correct 25 ms 6812 KB partial
60 Partially correct 19 ms 6740 KB partial
61 Partially correct 18 ms 6744 KB partial
62 Partially correct 20 ms 6744 KB partial
63 Partially correct 20 ms 6744 KB partial
64 Partially correct 23 ms 6600 KB partial
65 Partially correct 258 ms 51536 KB partial
66 Partially correct 289 ms 55312 KB partial
67 Partially correct 270 ms 55184 KB partial
68 Partially correct 282 ms 52560 KB partial
69 Partially correct 243 ms 55376 KB partial
70 Partially correct 261 ms 55312 KB partial
71 Partially correct 263 ms 55184 KB partial
72 Partially correct 257 ms 55164 KB partial
73 Correct 282 ms 55376 KB ok
74 Correct 279 ms 55376 KB ok
75 Partially correct 277 ms 55184 KB partial
76 Partially correct 268 ms 55312 KB partial
77 Partially correct 260 ms 54868 KB partial
78 Partially correct 268 ms 55380 KB partial
79 Partially correct 273 ms 55384 KB partial
80 Partially correct 247 ms 55324 KB partial
81 Partially correct 259 ms 55380 KB partial
82 Partially correct 256 ms 55188 KB partial
83 Partially correct 249 ms 55376 KB partial
84 Partially correct 286 ms 55380 KB partial
85 Partially correct 297 ms 55180 KB partial
86 Partially correct 270 ms 55376 KB partial
87 Partially correct 275 ms 55380 KB partial
88 Partially correct 294 ms 55308 KB partial
89 Partially correct 253 ms 54608 KB partial
90 Partially correct 263 ms 55352 KB partial
91 Partially correct 256 ms 55376 KB partial
92 Partially correct 248 ms 55380 KB partial
93 Partially correct 267 ms 55380 KB partial
94 Partially correct 263 ms 55376 KB partial
95 Partially correct 268 ms 55192 KB partial
96 Partially correct 255 ms 55180 KB partial
97 Partially correct 274 ms 55316 KB partial
98 Partially correct 260 ms 55380 KB partial
99 Partially correct 258 ms 55180 KB partial
100 Partially correct 248 ms 55200 KB partial
101 Partially correct 250 ms 55380 KB partial
102 Partially correct 259 ms 55384 KB partial
103 Partially correct 289 ms 55376 KB partial
104 Partially correct 266 ms 55192 KB partial
105 Partially correct 258 ms 55380 KB partial
106 Partially correct 269 ms 55380 KB partial
107 Partially correct 249 ms 55184 KB partial
108 Partially correct 270 ms 55544 KB partial
109 Partially correct 261 ms 55200 KB partial