oj.uz

답안 #1011973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011973 2024-07-01T12:58:42 Z mdn2002 축구 경기장 (IOI23_soccer) C++17
29.5 / 100
 3388 ms 220216 KB 
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int dp[8000006];
int biggest_stadium(int N, vector<vector<int>> F) {
    int n = N;
    vector<vector<int>> a = F, next(n, vector<int>(n)), sum(n, vector<int>(n));
    map<vector<int>, int> mp;
    vector<vector<int>> v(n), vv;

    function<int(int, int, int, int)> summ = [&] (int l, int r, int x, int y) {
        long long ans = sum[y][r];
        if (x - 1 >= 0) ans -= sum[x - 1][r];
        if (l - 1 >= 0) ans -= sum[y][l - 1];
        if (x - 1 >= 0 && l - 1 >= 0) ans += sum[x - 1][l - 1];
        return ans;
    };

    int cnt = 0;

    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            sum[i][j] += a[i][j];
            if (j) sum[i][j] += sum[i][j - 1];
            if (a[i][j] == 0) v[i].push_back(j);
        }
        v[i].push_back(n + 1);
    }
    for (int i = 1; i < n; i ++) {
        for (int j = 0; j < n; j ++) sum[i][j] += sum[i - 1][j];
    }
    for (int i = 0; i < n; i ++) {
        if (a[i][n - 1] == 0) next[i][n - 1] = n - 1;
        else next[i][n - 1] = n - 2;
        for (int j = n - 2; j >= 0; j --) {
            if (a[i][j]) next[i][j] = j - 1;
            else next[i][j] = next[i][j + 1];
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            if (a[i][j]) continue;
            int ll = i, rr = n, mid, x, y;
            while (ll < rr) {
                mid = (ll + rr) / 2;
                if (summ(j, next[i][j], i, mid) == 0) ll = mid + 1;
                else rr = mid;
            }
            ll --;
            y = ll;

            ll = 0, rr = i;
            while (ll < rr) {
                mid = (ll + rr) / 2;
                if (summ(j, next[i][j], mid, i) == 0) rr = mid;
                else ll = mid + 1;
            }
            x = ll;
            vector<int> vvv = {j, next[i][j], x, y};
            if (mp[vvv] == 0) {
                vv.push_back(vvv);
                mp[vvv] = ++ cnt;
            }
            j = next[i][j];
        }
    }

    function<bool(vector<int>, vector<int>)> cmp = [&](vector<int> a, vector<int> b) {
        int siz1 = (a[1] - a[0] + 1), siz2 = (b[1] - b[0] + 1);
        return (siz1 > siz2);
    };
    sort(vv.begin(), vv.end(), cmp);

    for (auto xx : vv) {
        if (mp.count(xx) == 0) mp[xx] = ++ cnt;
        int id = mp[xx];
        dp[id] = max(dp[id], (xx[1] - xx[0] + 1) * (xx[3] - xx[2] + 1));
        ans = max(ans, dp[id]);

        int l = xx[0], r = xx[1], x = xx[2], y = xx[3];

        if (x - 1 >= 0) {
            for (int j = l; j <= r; j ++) {
                int z = min(r, next[x - 1][j]);
                if (a[x - 1][j] == 0) {

                    int ll = y, rr = n, mid, nx, ny;
                    while (ll < rr) {
                        mid = (ll + rr) / 2;
                        if (summ(j, z, x, mid) == 0) ll = mid + 1;
                        else rr = mid;
                    }
                    ll --;
                    ny = ll;

                    ll = 0, rr = x;
                    while (ll < rr) {
                        mid = (ll + rr) / 2;
                        if (summ(j, z, mid, y) == 0) rr = mid;
                        else ll = mid + 1;
                    }
                    nx = ll;

                    vector<int> xxx = {j, z, nx, ny};
                    if (mp.count(xxx) == 0) mp[xxx] = ++ cnt;
                    int idd = mp[xxx];
                    dp[idd] = max(dp[idd], dp[id] + (z - j + 1) * (x - nx + ny - y));
                }
                j = *upper_bound(v[x - 1].begin(), v[x - 1].end(), z) - 1;
            }
        }
        if (y + 1 < n) {
            for (int j = l; j <= r; j ++) {
                int z = min(r, next[y + 1][j]);
                if (a[y + 1][j] == 0) {
                    int ll = y, rr = n, mid, nx, ny;
                    while (ll < rr) {
                        mid = (ll + rr) / 2;
                        if (summ(j, z, x, mid) == 0) ll = mid + 1;
                        else rr = mid;
                    }
                    ll --;
                    ny = ll;

                    ll = 0, rr = x;
                    while (ll < rr) {
                        mid = (ll + rr) / 2;
                        if (summ(j, z, mid, y) == 0) rr = mid;
                        else ll = mid + 1;
                    }
                    nx = ll;

                    vector<int> xxx = {j, z, nx, ny};
                    if (mp.count(xxx) == 0) mp[xxx] = ++ cnt;
                    int idd = mp[xxx];
                    dp[idd] = max(dp[idd], dp[id] + (z - j + 1) * (x - nx + ny - y));
                }
                j = *upper_bound(v[y + 1].begin(), v[y + 1].end(), z) - 1;
            }
        }
    }
    return ans;
}
/*
3
0 0 0
0 1 0
0 0 0
*/

Subtask #0
0.0 / 0.0

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

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 344 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 604 KB ok
8 Correct 15 ms 6748 KB ok
9 Correct 214 ms 102804 KB ok

Subtask #2
2.0 / 8.0

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

Subtask #3
5.5 / 22.0

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

Subtask #5
4.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 344 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 0 ms 456 KB ok
9 Correct 0 ms 348 KB ok
10 Partially correct 0 ms 348 KB partial
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 1 ms 348 KB ok
14 Correct 0 ms 344 KB ok
15 Correct 1 ms 344 KB ok
16 Correct 0 ms 344 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 Correct 0 ms 348 KB ok
21 Correct 0 ms 348 KB ok
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 348 KB ok
24 Correct 0 ms 348 KB ok
25 Correct 0 ms 344 KB ok
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 0 ms 344 KB partial
30 Correct 0 ms 348 KB ok
31 Correct 1 ms 444 KB ok
32 Correct 1 ms 348 KB ok
33 Correct 0 ms 348 KB ok
34 Correct 0 ms 348 KB ok
35 Correct 0 ms 468 KB ok
36 Correct 0 ms 348 KB ok
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 344 KB partial
39 Partially correct 1 ms 348 KB partial
40 Correct 1 ms 348 KB ok
41 Partially correct 0 ms 348 KB partial
42 Partially correct 107 ms 13320 KB partial
43 Partially correct 149 ms 15884 KB partial
44 Partially correct 28 ms 8020 KB partial
45 Partially correct 21 ms 7508 KB partial
46 Partially correct 63 ms 10568 KB partial
47 Partially correct 15 ms 6856 KB partial
48 Correct 15 ms 6492 KB ok
49 Partially correct 15 ms 6492 KB partial
50 Correct 45 ms 6744 KB ok
51 Correct 46 ms 9968 KB ok
52 Partially correct 17 ms 6028 KB partial
53 Partially correct 21 ms 6172 KB partial
54 Partially correct 14 ms 5980 KB partial
55 Partially correct 16 ms 6228 KB partial
56 Correct 14 ms 6236 KB ok
57 Partially correct 16 ms 7004 KB partial
58 Partially correct 16 ms 7004 KB partial
59 Partially correct 14 ms 7004 KB partial

Subtask #6
7.5 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 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 604 KB ok
9 Correct 15 ms 6748 KB ok
10 Correct 214 ms 102804 KB ok
11 Correct 1 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 456 KB ok
14 Correct 0 ms 348 KB ok
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Correct 0 ms 348 KB ok
18 Correct 1 ms 348 KB ok
19 Correct 0 ms 344 KB ok
20 Correct 1 ms 344 KB ok
21 Correct 0 ms 344 KB ok
22 Correct 0 ms 348 KB ok
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Correct 0 ms 348 KB ok
26 Correct 0 ms 348 KB ok
27 Correct 0 ms 348 KB ok
28 Correct 0 ms 348 KB ok
29 Correct 0 ms 348 KB ok
30 Correct 0 ms 344 KB ok
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 0 ms 344 KB partial
35 Correct 0 ms 348 KB ok
36 Correct 1 ms 444 KB ok
37 Correct 1 ms 348 KB ok
38 Correct 0 ms 348 KB ok
39 Correct 0 ms 348 KB ok
40 Correct 0 ms 468 KB ok
41 Correct 0 ms 348 KB ok
42 Partially correct 0 ms 348 KB partial
43 Partially correct 0 ms 344 KB partial
44 Partially correct 1 ms 348 KB partial
45 Correct 1 ms 348 KB ok
46 Partially correct 0 ms 348 KB partial
47 Partially correct 107 ms 13320 KB partial
48 Partially correct 149 ms 15884 KB partial
49 Partially correct 28 ms 8020 KB partial
50 Partially correct 21 ms 7508 KB partial
51 Partially correct 63 ms 10568 KB partial
52 Partially correct 15 ms 6856 KB partial
53 Correct 15 ms 6492 KB ok
54 Partially correct 15 ms 6492 KB partial
55 Correct 45 ms 6744 KB ok
56 Correct 46 ms 9968 KB ok
57 Partially correct 17 ms 6028 KB partial
58 Partially correct 21 ms 6172 KB partial
59 Partially correct 14 ms 5980 KB partial
60 Partially correct 16 ms 6228 KB partial
61 Correct 14 ms 6236 KB ok
62 Partially correct 16 ms 7004 KB partial
63 Partially correct 16 ms 7004 KB partial
64 Partially correct 14 ms 7004 KB partial
65 Partially correct 3388 ms 206308 KB partial
66 Correct 2937 ms 220216 KB ok
67 Correct 1195 ms 145188 KB ok
68 Partially correct 265 ms 105240 KB partial
69 Partially correct 600 ms 120456 KB partial
70 Partially correct 1097 ms 138752 KB partial
71 Partially correct 254 ms 104272 KB partial
72 Partially correct 229 ms 102992 KB partial
73 Correct 249 ms 97572 KB ok
74 Correct 237 ms 97876 KB ok
75 Partially correct 236 ms 97828 KB partial
76 Correct 810 ms 99344 KB ok
77 Correct 760 ms 99092 KB ok
78 Partially correct 606 ms 129272 KB partial
79 Correct 406 ms 99072 KB ok
80 Partially correct 363 ms 95708 KB partial
81 Partially correct 384 ms 95756 KB partial
82 Partially correct 445 ms 103172 KB partial
83 Partially correct 1235 ms 138040 KB partial
84 Partially correct 201 ms 89300 KB partial
85 Partially correct 213 ms 88212 KB partial
86 Partially correct 226 ms 90200 KB partial
87 Partially correct 220 ms 90452 KB partial
88 Correct 219 ms 93988 KB ok
89 Partially correct 209 ms 102992 KB partial
90 Partially correct 235 ms 103056 KB partial
91 Partially correct 223 ms 101456 KB partial
92 Correct 788 ms 120376 KB ok
93 Correct 990 ms 125792 KB ok
94 Correct 405 ms 100868 KB ok
95 Correct 323 ms 95056 KB ok
96 Partially correct 296 ms 93196 KB partial
97 Partially correct 276 ms 91984 KB partial
98 Partially correct 249 ms 89488 KB partial
99 Correct 816 ms 142028 KB ok
100 Partially correct 236 ms 103764 KB partial
101 Partially correct 255 ms 103848 KB partial
102 Partially correct 249 ms 103824 KB partial
103 Partially correct 248 ms 103760 KB partial
104 Partially correct 221 ms 103832 KB partial
105 Partially correct 231 ms 103764 KB partial
106 Partially correct 231 ms 103764 KB partial
107 Correct 219 ms 104016 KB ok
108 Correct 410 ms 110372 KB ok
109 Correct 424 ms 109664 KB ok