oj.uz

답안 #1067763

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067763 2024-08-21T02:59:02 Z becaido 축구 경기장 (IOI23_soccer) C++17
29.5 / 100
 279 ms 43856 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 (1 || 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

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

Subtask #1
6.0 / 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 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 2 ms 604 KB ok
8 Correct 12 ms 3420 KB ok
9 Correct 199 ms 35616 KB ok

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 348 KB partial
4 Partially correct 0 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 600 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 344 KB partial
12 Partially correct 0 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 0 ms 348 KB partial
5 Partially correct 0 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 600 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 344 KB partial
13 Partially correct 0 ms 348 KB partial
14 Correct 0 ms 348 KB ok
15 Partially correct 1 ms 344 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 348 KB ok
22 Partially correct 0 ms 344 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

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 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 348 KB partial
7 Partially correct 0 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 600 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 344 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 344 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 348 KB ok
24 Partially correct 0 ms 344 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 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 1 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 348 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 348 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 348 KB partial
7 Partially correct 0 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 600 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 344 KB partial
15 Partially correct 0 ms 348 KB partial
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 344 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 348 KB ok
24 Partially correct 0 ms 344 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 348 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 344 KB partial
32 Partially correct 1 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 1 ms 348 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 13 ms 3420 KB partial
43 Partially correct 16 ms 3420 KB partial
44 Partially correct 14 ms 3420 KB partial
45 Partially correct 13 ms 3420 KB partial
46 Partially correct 12 ms 3236 KB partial
47 Partially correct 13 ms 3420 KB partial
48 Correct 13 ms 3420 KB ok
49 Partially correct 14 ms 3416 KB partial
50 Partially correct 13 ms 3420 KB partial
51 Partially correct 14 ms 3420 KB partial
52 Partially correct 13 ms 3420 KB partial
53 Partially correct 17 ms 3416 KB partial
54 Partially correct 13 ms 3420 KB partial
55 Partially correct 13 ms 3416 KB partial
56 Partially correct 13 ms 3420 KB partial
57 Partially correct 14 ms 3416 KB partial
58 Partially correct 14 ms 3420 KB partial
59 Partially correct 14 ms 3416 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 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 2 ms 604 KB ok
9 Correct 12 ms 3420 KB ok
10 Correct 199 ms 35616 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 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 600 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 344 KB partial
20 Partially correct 0 ms 348 KB partial
21 Correct 0 ms 348 KB ok
22 Partially correct 1 ms 344 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 348 KB ok
29 Partially correct 0 ms 344 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 348 KB partial
34 Partially correct 0 ms 348 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 344 KB partial
37 Partially correct 1 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 1 ms 348 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 13 ms 3420 KB partial
48 Partially correct 16 ms 3420 KB partial
49 Partially correct 14 ms 3420 KB partial
50 Partially correct 13 ms 3420 KB partial
51 Partially correct 12 ms 3236 KB partial
52 Partially correct 13 ms 3420 KB partial
53 Correct 13 ms 3420 KB ok
54 Partially correct 14 ms 3416 KB partial
55 Partially correct 13 ms 3420 KB partial
56 Partially correct 14 ms 3420 KB partial
57 Partially correct 13 ms 3420 KB partial
58 Partially correct 17 ms 3416 KB partial
59 Partially correct 13 ms 3420 KB partial
60 Partially correct 13 ms 3416 KB partial
61 Partially correct 13 ms 3420 KB partial
62 Partially correct 14 ms 3416 KB partial
63 Partially correct 14 ms 3420 KB partial
64 Partially correct 14 ms 3416 KB partial
65 Partially correct 244 ms 35672 KB partial
66 Partially correct 279 ms 35636 KB partial
67 Partially correct 206 ms 35636 KB partial
68 Partially correct 195 ms 35664 KB partial
69 Partially correct 204 ms 35636 KB partial
70 Partially correct 192 ms 35672 KB partial
71 Partially correct 192 ms 35616 KB partial
72 Partially correct 192 ms 35632 KB partial
73 Correct 214 ms 35668 KB ok
74 Correct 230 ms 43600 KB ok
75 Partially correct 213 ms 43556 KB partial
76 Partially correct 215 ms 43672 KB partial
77 Partially correct 208 ms 43600 KB partial
78 Partially correct 210 ms 43684 KB partial
79 Partially correct 203 ms 43556 KB partial
80 Partially correct 212 ms 43600 KB partial
81 Partially correct 210 ms 43600 KB partial
82 Partially correct 208 ms 43604 KB partial
83 Partially correct 214 ms 43604 KB partial
84 Partially correct 217 ms 43604 KB partial
85 Partially correct 203 ms 43604 KB partial
86 Partially correct 214 ms 43600 KB partial
87 Partially correct 210 ms 43600 KB partial
88 Partially correct 214 ms 43604 KB partial
89 Partially correct 203 ms 42576 KB partial
90 Partially correct 225 ms 43680 KB partial
91 Partially correct 220 ms 43544 KB partial
92 Partially correct 222 ms 43604 KB partial
93 Partially correct 233 ms 43856 KB partial
94 Partially correct 213 ms 43608 KB partial
95 Partially correct 240 ms 43420 KB partial
96 Partially correct 218 ms 43604 KB partial
97 Partially correct 203 ms 43600 KB partial
98 Partially correct 261 ms 43668 KB partial
99 Partially correct 213 ms 43540 KB partial
100 Partially correct 254 ms 43600 KB partial
101 Partially correct 211 ms 43556 KB partial
102 Partially correct 242 ms 43672 KB partial
103 Partially correct 209 ms 43424 KB partial
104 Partially correct 222 ms 43540 KB partial
105 Partially correct 231 ms 43428 KB partial
106 Partially correct 221 ms 43428 KB partial
107 Partially correct 213 ms 43456 KB partial
108 Partially correct 225 ms 43688 KB partial
109 Partially correct 274 ms 43548 KB partial