oj.uz

답안 #1078863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078863 2024-08-28T07:23:04 Z PoPularPlusPlus 축구 경기장 (IOI23_soccer) C++17
25 / 100
 323 ms 43860 KB 
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(x) x.begin(),x.end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define vf first
#define vs second

int dx[4] = {1 , -1 , 0 , 0} , dy[4] = {0 , 0 , -1 , 1};

int biggest_stadium(int n, vector<vector<int>> f){
    bool vis[n][n];
    memset(vis,0,sizeof vis);
    int cnt = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(f[i][j] == 0 && !vis[i][j]){
                cnt++;
                vis[i][j] = 1;
                queue<pair<int,int>> q;
                q.push(mp(i , j));
                while(q.size()){
                    int r = q.front().vf , c = q.front().vs;
                    q.pop();
                    for(int tp = 0; tp < 4; tp++){
                        int nr = r + dx[tp] , nc = c + dy[tp];
                        if(nr >= 0 && nr < n && nc >= 0 && nc < n && f[nr][nc] == 0 && vis[nr][nc] == 0){
                            vis[nr][nc] = 1;
                            q.push(mp(nr,nc));
                        }
                    }
                }
            }
        }
    }

    if(cnt > 1)return 0;

    int mx_col[n] , mn_col[n];
    int pre_mx[n] , pre_mn[n] , suf_mx[n], suf_mn[n];
    for(int i = 0; i < n; i++){
        mx_col[i] = mn_col[i] = -1;
        for(int j = 0; j < n; j++){
            if(f[i][j] == 0){
                if(mx_col[i] == -1){
                    mx_col[i] = mn_col[i] = j;
                }
                else {
                    mx_col[i] = j;
                }
            }
        }

        for(int j = 0; j < n && mx_col[i] != -1; j++){
            if(f[i][j] == 1){
                if(j > mn_col[i] && j < mx_col[i]){
                    return 0;
                }
            }
        }
    }

    pre_mx[0] = mx_col[0];
    pre_mn[0] = mn_col[0];
    for(int i = 1; i < n; i++){
        if(pre_mn[i-1] == -1)pre_mn[i] = mn_col[i];
        else if(mn_col[i] == -1)pre_mn[i] = pre_mn[i-1];
        else pre_mn[i] = min(pre_mn[i-1] , mn_col[i]);

        pre_mx[i] = max(pre_mx[i-1] , mx_col[i]);
    }

    suf_mx[n-1] = mx_col[n-1];
    suf_mn[n-1] = mn_col[n-1];
    for(int i = n - 2; i >= 0; i--){
        if(suf_mn[i+1] == -1)suf_mn[i] = mn_col[i];
        else if(mn_col[i] == -1)suf_mn[i] = suf_mn[i+1];
        else suf_mn[i] = min(suf_mn[i+1] , mn_col[i]);

        suf_mx[i] = max(suf_mx[i+1] , mx_col[i]);
    }

    int ans = 0;

    int best_l[n] , best_r[n];
    for(int j = 0; j < n; j++){
        best_l[j] = -1;
        best_r[j] = -1;
        for(int i = 0; i < n; i++){
            if(f[i][j] == 0){
                if(best_l[j] == -1)best_l[j] = i;
                best_r[j] = i;
            }
        }
    }

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(f[i][j] == 1){
                if(best_l[j] != -1 && i > best_l[j] && i < best_r[j]){
                    return 0;
                }
            }
        }
    }

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(f[i][j] == 0){
                ans++;

                int left = best_l[j] - 1 , right = best_r[j] + 1;
                int r_min = mn_col[i] , r_max = mx_col[i];
                bool ok = 1;
                if(left >= 0){
                    if(pre_mn[left] != -1 && pre_mn[left] < r_min){
                        ok = 0;
                    }
                    if(pre_mx[left] != -1 && pre_mx[left] > r_max){
                        ok = 0;
                    }
                }
                if(right < n){
                    if(suf_mn[right]!= -1 && suf_mn[right] < r_min){
                        ok = 0;
                    }
                    if(suf_mx[right]!=-1 && suf_mx[right] > r_max){
                        ok = 0;
                    }
                }

                if(ok == 0){
                    return 0;
                }
            }
        }
    }
    return ans;
}

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 1 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 18 ms 3164 KB partial
9 Partially correct 301 ms 43656 KB partial

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 1 ms 344 KB partial
4 Partially correct 1 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 1 ms 344 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 344 KB partial
13 Correct 1 ms 344 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 1 ms 344 KB partial
5 Partially correct 1 ms 348 KB partial
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 344 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 344 KB partial
14 Correct 1 ms 344 KB ok
15 Partially correct 1 ms 348 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 1 ms 352 KB partial
19 Partially correct 0 ms 356 KB partial
20 Correct 0 ms 444 KB ok
21 Correct 1 ms 356 KB ok
22 Partially correct 1 ms 356 KB partial
23 Partially correct 0 ms 356 KB partial
24 Partially correct 0 ms 364 KB partial
25 Partially correct 0 ms 352 KB partial
26 Partially correct 1 ms 356 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 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 1 ms 344 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 1 ms 344 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 344 KB partial
16 Correct 1 ms 344 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 1 ms 352 KB partial
21 Partially correct 0 ms 356 KB partial
22 Correct 0 ms 444 KB ok
23 Correct 1 ms 356 KB ok
24 Partially correct 1 ms 356 KB partial
25 Partially correct 0 ms 356 KB partial
26 Partially correct 0 ms 364 KB partial
27 Partially correct 0 ms 352 KB partial
28 Partially correct 1 ms 356 KB partial
29 Partially correct 0 ms 356 KB partial
30 Partially correct 1 ms 356 KB partial
31 Partially correct 0 ms 352 KB partial
32 Partially correct 0 ms 356 KB partial
33 Partially correct 1 ms 356 KB partial
34 Correct 0 ms 356 KB ok
35 Correct 0 ms 352 KB ok
36 Partially correct 1 ms 356 KB partial
37 Partially correct 0 ms 356 KB partial
38 Partially correct 0 ms 352 KB partial
39 Partially correct 1 ms 352 KB partial
40 Partially correct 0 ms 436 KB partial
41 Partially correct 1 ms 344 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 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Partially correct 1 ms 344 KB partial
7 Partially correct 1 ms 348 KB partial
8 Partially correct 0 ms 348 KB partial
9 Partially correct 0 ms 348 KB partial
10 Partially correct 1 ms 344 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 344 KB partial
16 Correct 1 ms 344 KB ok
17 Partially correct 1 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 1 ms 352 KB partial
21 Partially correct 0 ms 356 KB partial
22 Correct 0 ms 444 KB ok
23 Correct 1 ms 356 KB ok
24 Partially correct 1 ms 356 KB partial
25 Partially correct 0 ms 356 KB partial
26 Partially correct 0 ms 364 KB partial
27 Partially correct 0 ms 352 KB partial
28 Partially correct 1 ms 356 KB partial
29 Partially correct 0 ms 356 KB partial
30 Partially correct 1 ms 356 KB partial
31 Partially correct 0 ms 352 KB partial
32 Partially correct 0 ms 356 KB partial
33 Partially correct 1 ms 356 KB partial
34 Correct 0 ms 356 KB ok
35 Correct 0 ms 352 KB ok
36 Partially correct 1 ms 356 KB partial
37 Partially correct 0 ms 356 KB partial
38 Partially correct 0 ms 352 KB partial
39 Partially correct 1 ms 352 KB partial
40 Partially correct 0 ms 436 KB partial
41 Partially correct 1 ms 344 KB partial
42 Partially correct 18 ms 2952 KB partial
43 Partially correct 21 ms 2908 KB partial
44 Partially correct 18 ms 2904 KB partial
45 Partially correct 17 ms 3076 KB partial
46 Partially correct 17 ms 2944 KB partial
47 Partially correct 17 ms 3160 KB partial
48 Correct 16 ms 3164 KB ok
49 Partially correct 16 ms 3148 KB partial
50 Partially correct 15 ms 3164 KB partial
51 Partially correct 17 ms 2908 KB partial
52 Partially correct 15 ms 3164 KB partial
53 Partially correct 13 ms 3160 KB partial
54 Partially correct 14 ms 3080 KB partial
55 Partially correct 15 ms 3160 KB partial
56 Partially correct 15 ms 3164 KB partial
57 Partially correct 18 ms 2908 KB partial
58 Partially correct 17 ms 3164 KB partial
59 Partially correct 17 ms 2908 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 1 ms 348 KB ok
5 Correct 1 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Partially correct 0 ms 348 KB partial
8 Partially correct 1 ms 348 KB partial
9 Partially correct 18 ms 3164 KB partial
10 Partially correct 301 ms 43656 KB partial
11 Partially correct 1 ms 344 KB partial
12 Partially correct 1 ms 348 KB partial
13 Partially correct 0 ms 348 KB partial
14 Partially correct 0 ms 348 KB partial
15 Partially correct 1 ms 344 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 344 KB partial
21 Correct 1 ms 344 KB ok
22 Partially correct 1 ms 348 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 1 ms 352 KB partial
26 Partially correct 0 ms 356 KB partial
27 Correct 0 ms 444 KB ok
28 Correct 1 ms 356 KB ok
29 Partially correct 1 ms 356 KB partial
30 Partially correct 0 ms 356 KB partial
31 Partially correct 0 ms 364 KB partial
32 Partially correct 0 ms 352 KB partial
33 Partially correct 1 ms 356 KB partial
34 Partially correct 0 ms 356 KB partial
35 Partially correct 1 ms 356 KB partial
36 Partially correct 0 ms 352 KB partial
37 Partially correct 0 ms 356 KB partial
38 Partially correct 1 ms 356 KB partial
39 Correct 0 ms 356 KB ok
40 Correct 0 ms 352 KB ok
41 Partially correct 1 ms 356 KB partial
42 Partially correct 0 ms 356 KB partial
43 Partially correct 0 ms 352 KB partial
44 Partially correct 1 ms 352 KB partial
45 Partially correct 0 ms 436 KB partial
46 Partially correct 1 ms 344 KB partial
47 Partially correct 18 ms 2952 KB partial
48 Partially correct 21 ms 2908 KB partial
49 Partially correct 18 ms 2904 KB partial
50 Partially correct 17 ms 3076 KB partial
51 Partially correct 17 ms 2944 KB partial
52 Partially correct 17 ms 3160 KB partial
53 Correct 16 ms 3164 KB ok
54 Partially correct 16 ms 3148 KB partial
55 Partially correct 15 ms 3164 KB partial
56 Partially correct 17 ms 2908 KB partial
57 Partially correct 15 ms 3164 KB partial
58 Partially correct 13 ms 3160 KB partial
59 Partially correct 14 ms 3080 KB partial
60 Partially correct 15 ms 3160 KB partial
61 Partially correct 15 ms 3164 KB partial
62 Partially correct 18 ms 2908 KB partial
63 Partially correct 17 ms 3164 KB partial
64 Partially correct 17 ms 2908 KB partial
65 Partially correct 315 ms 39752 KB partial
66 Partially correct 300 ms 43528 KB partial
67 Partially correct 229 ms 43348 KB partial
68 Partially correct 297 ms 40784 KB partial
69 Partially correct 311 ms 43656 KB partial
70 Partially correct 287 ms 43604 KB partial
71 Partially correct 307 ms 43604 KB partial
72 Partially correct 323 ms 43604 KB partial
73 Correct 271 ms 43604 KB ok
74 Correct 280 ms 43860 KB ok
75 Partially correct 279 ms 43600 KB partial
76 Partially correct 286 ms 43600 KB partial
77 Partially correct 276 ms 43360 KB partial
78 Partially correct 290 ms 43524 KB partial
79 Partially correct 218 ms 43604 KB partial
80 Partially correct 218 ms 43396 KB partial
81 Partially correct 230 ms 43396 KB partial
82 Partially correct 230 ms 43348 KB partial
83 Partially correct 266 ms 43348 KB partial
84 Partially correct 227 ms 43604 KB partial
85 Partially correct 245 ms 43604 KB partial
86 Partially correct 256 ms 43600 KB partial
87 Partially correct 239 ms 43528 KB partial
88 Partially correct 249 ms 43600 KB partial
89 Partially correct 310 ms 42828 KB partial
90 Partially correct 302 ms 43660 KB partial
91 Partially correct 280 ms 43600 KB partial
92 Partially correct 248 ms 43600 KB partial
93 Partially correct 250 ms 43536 KB partial
94 Partially correct 222 ms 43344 KB partial
95 Partially correct 216 ms 43604 KB partial
96 Partially correct 239 ms 43528 KB partial
97 Partially correct 223 ms 43604 KB partial
98 Partially correct 212 ms 43420 KB partial
99 Partially correct 282 ms 43348 KB partial
100 Partially correct 297 ms 43528 KB partial
101 Partially correct 297 ms 43604 KB partial
102 Partially correct 297 ms 43528 KB partial
103 Partially correct 280 ms 43732 KB partial
104 Partially correct 283 ms 43528 KB partial
105 Partially correct 288 ms 43600 KB partial
106 Partially correct 280 ms 43604 KB partial
107 Partially correct 270 ms 43604 KB partial
108 Partially correct 268 ms 43600 KB partial
109 Partially correct 287 ms 43600 KB partial