oj.uz

Submission #1067764

# Submission time Handle Problem Language Result Execution time Memory
1067764 2024-08-21T02:59:28 Z becaido Soccer Stadium (IOI23_soccer) C++17
77.5 / 100
 518 ms 753492 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "soccer.h"
#else
#include "grader.cpp"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 505;

int n, ans;
bool a[SIZE << 2][SIZE << 2];
int L[SIZE][SIZE][SIZE], R[SIZE][SIZE][SIZE], dp[SIZE][SIZE][SIZE];

int big() {
    int cnt = 0, x = 0, y = 0;
    FOR (i, 1, n) FOR (j, 1, n) if (a[i][j]) {
        cnt++;
        x = i, y = j;
    }
    if (cnt == 0) return n * n;
    if (cnt == 1) return n * n - min(x, n - x + 1) * min(y, n - y + 1);
    {
        vector<pair<int, int>> seg;
        FOR (i, 1, n) {
            vector<pair<int, int>> v;
            int l = 0;
            FOR (j, 1, n) if (a[i][j] == 0) {
                if (l == 0) l = j;
                if (j == n || a[i][j + 1]) {
                    v.pb(l, j);
                    l = 0;
                }
            }
            if (v.size() > 1) return 0;
            seg.insert(seg.end(), v.begin(), v.end());
        }
        sort(seg.begin(), seg.end(), [&](auto x, auto y) {
            return x.F != y.F ? x.F < y.F : x.S > y.S;
        });
        FOR (i, 1, seg.size() - 1) {
            auto [pl, pr] = seg[i - 1];
            auto [l, r] = seg[i];
            if (l < pl || r > pr) return 0;
        }
    }
    {
        vector<pair<int, int>> seg;
        FOR (i, 1, n) {
            vector<pair<int, int>> v;
            int l = 0;
            FOR (j, 1, n) if (a[j][i] == 0) {
                if (l == 0) l = j;
                if (j == n || a[j + 1][i]) {
                    v.pb(l, j);
                    l = 0;
                }
            }
            if (v.size() > 1) return 0;
            seg.insert(seg.end(), v.begin(), v.end());
        }
        sort(seg.begin(), seg.end(), [&](auto x, auto y) {
            return x.F != y.F ? x.F < y.F : x.S > y.S;
        });
        FOR (i, 1, seg.size() - 1) {
            auto [pl, pr] = seg[i - 1];
            auto [l, r] = seg[i];
            if (l < pl || r > pr) return 0;
        }
    }
    return n * n - cnt;
}

int biggest_stadium(int N, vector<vector<int>> F) {
    n = N;
    FOR (i, 1, n) FOR (j, 1, n) a[i][j] = F[i - 1][j - 1];
    if (n > 500) return big();
    FOR (i, 1, n) {
        FOR (j, 1, n) if (a[i][j] == 0) L[i][i][j] = (j > 1 && a[i][j - 1] == 0 ? L[i][i][j - 1] : j);
        for (int j = n; j >= 1; j--) if (a[i][j] == 0) R[i][i][j] = (j < n && a[i][j + 1] == 0 ? R[i][i][j + 1] : j);
    }
    FOR (u, 1, n) FOR (d, u + 1, n) FOR (j, 1, n) {
        if (L[u][d - 1][j] && L[d][d][j]) L[u][d][j] = max(L[u][d - 1][j], L[d][d][j]);
        if (R[u][d - 1][j] && R[d][d][j]) R[u][d][j] = min(R[u][d - 1][j], R[d][d][j]);
    }
    FOR (i, 1, n) FOR (j, 1, n) if (L[i][i][j]) dp[i][i][j] = R[i][i][j] - L[i][i][j] + 1, ans = max(ans, dp[i][i][j]);
    FOR (d, 1, n) for (int u = d - 1; u >= 1; u--) FOR (j, 1, n) if (L[u][d][j]) {
        dp[u][d][j] = max(dp[u][d - 1][j], dp[u + 1][d][j]) + R[u][d][j] - L[u][d][j] + 1;
        ans = max(ans, dp[u][d][j]);
    }
    return ans;
}

/*
in1
5
0 0 0 0 0
1 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 1 0 0
out1
20
*/

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB ok

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 604 KB ok
4 Correct 0 ms 856 KB ok
5 Correct 1 ms 348 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 16 ms 31684 KB ok
8 Correct 510 ms 753444 KB ok
9 Correct 215 ms 35632 KB ok

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory 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 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 0 ms 348 KB ok
10 Correct 0 ms 344 KB ok
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB ok
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 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 0 ms 348 KB ok
9 Correct 1 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 604 KB ok
16 Correct 0 ms 604 KB ok
17 Correct 0 ms 604 KB ok
18 Correct 0 ms 604 KB ok
19 Correct 1 ms 600 KB ok
20 Correct 0 ms 604 KB ok
21 Correct 1 ms 604 KB ok
22 Correct 1 ms 604 KB ok
23 Correct 1 ms 604 KB ok
24 Correct 1 ms 348 KB ok
25 Correct 0 ms 604 KB ok
26 Correct 0 ms 604 KB ok

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 604 KB ok
5 Correct 0 ms 856 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 0 ms 348 KB ok
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 348 KB ok
13 Correct 0 ms 344 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 348 KB ok
16 Correct 0 ms 348 KB ok
17 Correct 0 ms 604 KB ok
18 Correct 0 ms 604 KB ok
19 Correct 0 ms 604 KB ok
20 Correct 0 ms 604 KB ok
21 Correct 1 ms 600 KB ok
22 Correct 0 ms 604 KB ok
23 Correct 1 ms 604 KB ok
24 Correct 1 ms 604 KB ok
25 Correct 1 ms 604 KB ok
26 Correct 1 ms 348 KB ok
27 Correct 0 ms 604 KB ok
28 Correct 0 ms 604 KB ok
29 Correct 0 ms 604 KB ok
30 Correct 2 ms 3420 KB ok
31 Correct 1 ms 3164 KB ok
32 Correct 2 ms 1372 KB ok
33 Correct 1 ms 860 KB ok
34 Correct 1 ms 3420 KB ok
35 Correct 1 ms 1716 KB ok
36 Correct 1 ms 1372 KB ok
37 Correct 1 ms 1628 KB ok
38 Correct 1 ms 1628 KB ok
39 Correct 1 ms 1884 KB ok
40 Correct 1 ms 2140 KB ok
41 Correct 2 ms 3420 KB ok

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 604 KB ok
5 Correct 0 ms 856 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 0 ms 348 KB ok
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 348 KB ok
13 Correct 0 ms 344 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 348 KB ok
16 Correct 0 ms 348 KB ok
17 Correct 0 ms 604 KB ok
18 Correct 0 ms 604 KB ok
19 Correct 0 ms 604 KB ok
20 Correct 0 ms 604 KB ok
21 Correct 1 ms 600 KB ok
22 Correct 0 ms 604 KB ok
23 Correct 1 ms 604 KB ok
24 Correct 1 ms 604 KB ok
25 Correct 1 ms 604 KB ok
26 Correct 1 ms 348 KB ok
27 Correct 0 ms 604 KB ok
28 Correct 0 ms 604 KB ok
29 Correct 0 ms 604 KB ok
30 Correct 2 ms 3420 KB ok
31 Correct 1 ms 3164 KB ok
32 Correct 2 ms 1372 KB ok
33 Correct 1 ms 860 KB ok
34 Correct 1 ms 3420 KB ok
35 Correct 1 ms 1716 KB ok
36 Correct 1 ms 1372 KB ok
37 Correct 1 ms 1628 KB ok
38 Correct 1 ms 1628 KB ok
39 Correct 1 ms 1884 KB ok
40 Correct 1 ms 2140 KB ok
41 Correct 2 ms 3420 KB ok
42 Correct 304 ms 181840 KB ok
43 Correct 213 ms 98196 KB ok
44 Correct 451 ms 753252 KB ok
45 Correct 518 ms 753488 KB ok
46 Correct 378 ms 385348 KB ok
47 Correct 479 ms 753488 KB ok
48 Correct 428 ms 733592 KB ok
49 Correct 428 ms 676176 KB ok
50 Correct 416 ms 753492 KB ok
51 Correct 304 ms 381264 KB ok
52 Correct 218 ms 240720 KB ok
53 Correct 137 ms 66644 KB ok
54 Correct 247 ms 269760 KB ok
55 Correct 372 ms 609732 KB ok
56 Correct 230 ms 187476 KB ok
57 Correct 450 ms 752976 KB ok
58 Correct 433 ms 747896 KB ok
59 Correct 419 ms 722480 KB ok

Subtask #6
7.5 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 604 KB ok
5 Correct 0 ms 856 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 16 ms 31684 KB ok
9 Correct 510 ms 753444 KB ok
10 Correct 215 ms 35632 KB ok
11 Correct 1 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 348 KB ok
16 Correct 1 ms 348 KB ok
17 Correct 0 ms 348 KB ok
18 Correct 0 ms 344 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 604 KB ok
23 Correct 0 ms 604 KB ok
24 Correct 0 ms 604 KB ok
25 Correct 0 ms 604 KB ok
26 Correct 1 ms 600 KB ok
27 Correct 0 ms 604 KB ok
28 Correct 1 ms 604 KB ok
29 Correct 1 ms 604 KB ok
30 Correct 1 ms 604 KB ok
31 Correct 1 ms 348 KB ok
32 Correct 0 ms 604 KB ok
33 Correct 0 ms 604 KB ok
34 Correct 0 ms 604 KB ok
35 Correct 2 ms 3420 KB ok
36 Correct 1 ms 3164 KB ok
37 Correct 2 ms 1372 KB ok
38 Correct 1 ms 860 KB ok
39 Correct 1 ms 3420 KB ok
40 Correct 1 ms 1716 KB ok
41 Correct 1 ms 1372 KB ok
42 Correct 1 ms 1628 KB ok
43 Correct 1 ms 1628 KB ok
44 Correct 1 ms 1884 KB ok
45 Correct 1 ms 2140 KB ok
46 Correct 2 ms 3420 KB ok
47 Correct 304 ms 181840 KB ok
48 Correct 213 ms 98196 KB ok
49 Correct 451 ms 753252 KB ok
50 Correct 518 ms 753488 KB ok
51 Correct 378 ms 385348 KB ok
52 Correct 479 ms 753488 KB ok
53 Correct 428 ms 733592 KB ok
54 Correct 428 ms 676176 KB ok
55 Correct 416 ms 753492 KB ok
56 Correct 304 ms 381264 KB ok
57 Correct 218 ms 240720 KB ok
58 Correct 137 ms 66644 KB ok
59 Correct 247 ms 269760 KB ok
60 Correct 372 ms 609732 KB ok
61 Correct 230 ms 187476 KB ok
62 Correct 450 ms 752976 KB ok
63 Correct 433 ms 747896 KB ok
64 Correct 419 ms 722480 KB ok
65 Partially correct 208 ms 35668 KB partial
66 Partially correct 222 ms 35664 KB partial
67 Partially correct 215 ms 35632 KB partial
68 Partially correct 203 ms 35620 KB partial
69 Partially correct 195 ms 35668 KB partial
70 Partially correct 219 ms 35664 KB partial
71 Partially correct 204 ms 35668 KB partial
72 Partially correct 197 ms 35664 KB partial
73 Correct 239 ms 35636 KB ok
74 Correct 238 ms 35872 KB ok
75 Partially correct 198 ms 35872 KB partial
76 Partially correct 197 ms 35664 KB partial
77 Partially correct 202 ms 35668 KB partial
78 Partially correct 193 ms 35668 KB partial
79 Partially correct 197 ms 35624 KB partial
80 Partially correct 216 ms 35616 KB partial
81 Partially correct 198 ms 35620 KB partial
82 Partially correct 197 ms 35668 KB partial
83 Partially correct 204 ms 35668 KB partial
84 Partially correct 206 ms 35664 KB partial
85 Partially correct 205 ms 35664 KB partial
86 Partially correct 195 ms 35664 KB partial
87 Partially correct 231 ms 35632 KB partial
88 Partially correct 207 ms 35672 KB partial
89 Partially correct 204 ms 35872 KB partial
90 Partially correct 206 ms 35668 KB partial
91 Partially correct 200 ms 35664 KB partial
92 Partially correct 216 ms 35664 KB partial
93 Partially correct 206 ms 35664 KB partial
94 Partially correct 216 ms 35632 KB partial
95 Partially correct 191 ms 35664 KB partial
96 Partially correct 200 ms 35640 KB partial
97 Partially correct 203 ms 35664 KB partial
98 Partially correct 202 ms 35668 KB partial
99 Partially correct 204 ms 35664 KB partial
100 Partially correct 196 ms 35664 KB partial
101 Partially correct 189 ms 35636 KB partial
102 Partially correct 198 ms 35668 KB partial
103 Partially correct 208 ms 35668 KB partial
104 Partially correct 208 ms 35616 KB partial
105 Partially correct 199 ms 35664 KB partial
106 Partially correct 268 ms 35668 KB partial
107 Partially correct 205 ms 35664 KB partial
108 Partially correct 212 ms 35668 KB partial
109 Partially correct 205 ms 35664 KB partial