oj.uz

답안 #1011893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011893 2024-07-01T10:46:03 Z mdn2002 축구 경기장 (IOI23_soccer) C++17
48 / 100
 25 ms 18524 KB 
#include "soccer.h"
#include<bits/stdc++.h>
using namespace std;
int dp[33][33][33][33];
int biggest_stadium(int N, vector<vector<int>> F) {
    memset(dp, -1, sizeof dp);
    int n = N;
    vector<vector<int>> a = F, next(n, vector<int>(n));
    //vector dp(n, vector(n, vector(n, vector<int>(n, -1))));

    function<int(int, int, int, int)> f = [&] (int l, int r, int x, int y) {
        int ans = 0;
        if (dp[l][r][x][y] != -1) return dp[l][r][x][y];
        if (x - 1 >= 0) {
            for (int j = l; j <= r; j ++) {
                if (a[x - 1][j]) continue;
                int z = min(r, next[x - 1][j]);
                ans = max(ans, f(j, z, x - 1, y) + z - j + 1);
                j = z;
            }
        }
        if (y + 1 < n) {
            for (int j = l; j <= r; j ++) {
                if (a[y + 1][j]) continue;
                int z = min(r, next[y + 1][j]);
                ans = max(ans, f(j, z, x, y + 1) + z - j + 1);
                j = z;
            }
        }

        return dp[l][r][x][y] = ans;
    };

    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;
            ans = max(ans, f(j, next[i][j], i, i) + next[i][j] - j + 1);
            j = next[i][j];
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB ok
2 Correct 2 ms 5032 KB ok
3 Correct 3 ms 4956 KB ok
4 Correct 2 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Runtime error 6 ms 10332 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB ok
2 Correct 2 ms 5032 KB ok
3 Correct 2 ms 4956 KB ok
4 Correct 2 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Correct 2 ms 4956 KB ok
9 Correct 2 ms 5084 KB ok
10 Correct 2 ms 4956 KB ok
11 Correct 2 ms 4956 KB ok
12 Correct 2 ms 4956 KB ok
13 Correct 2 ms 4956 KB ok

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB ok
2 Correct 2 ms 4956 KB ok
3 Correct 2 ms 5032 KB ok
4 Correct 2 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Correct 2 ms 4956 KB ok
9 Correct 2 ms 4956 KB ok
10 Correct 2 ms 5084 KB ok
11 Correct 2 ms 4956 KB ok
12 Correct 2 ms 4956 KB ok
13 Correct 2 ms 4956 KB ok
14 Correct 2 ms 4956 KB ok
15 Correct 2 ms 4956 KB ok
16 Correct 3 ms 4956 KB ok
17 Correct 2 ms 4956 KB ok
18 Correct 2 ms 4956 KB ok
19 Correct 2 ms 4956 KB ok
20 Correct 2 ms 4956 KB ok
21 Correct 2 ms 4956 KB ok
22 Correct 2 ms 4956 KB ok
23 Correct 2 ms 4956 KB ok
24 Correct 2 ms 4924 KB ok
25 Correct 2 ms 4956 KB ok
26 Correct 2 ms 4956 KB ok

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB ok
2 Correct 2 ms 4956 KB ok
3 Correct 2 ms 5032 KB ok
4 Correct 3 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Correct 2 ms 4956 KB ok
9 Correct 2 ms 4956 KB ok
10 Correct 2 ms 4956 KB ok
11 Correct 2 ms 4956 KB ok
12 Correct 2 ms 5084 KB ok
13 Correct 2 ms 4956 KB ok
14 Correct 2 ms 4956 KB ok
15 Correct 2 ms 4956 KB ok
16 Correct 2 ms 4956 KB ok
17 Correct 2 ms 4956 KB ok
18 Correct 3 ms 4956 KB ok
19 Correct 2 ms 4956 KB ok
20 Correct 2 ms 4956 KB ok
21 Correct 2 ms 4956 KB ok
22 Correct 2 ms 4956 KB ok
23 Correct 2 ms 4956 KB ok
24 Correct 2 ms 4956 KB ok
25 Correct 2 ms 4956 KB ok
26 Correct 2 ms 4924 KB ok
27 Correct 2 ms 4956 KB ok
28 Correct 2 ms 4956 KB ok
29 Correct 2 ms 4956 KB ok
30 Correct 2 ms 4956 KB ok
31 Correct 2 ms 4956 KB ok
32 Correct 2 ms 4956 KB ok
33 Correct 2 ms 4956 KB ok
34 Correct 2 ms 4952 KB ok
35 Correct 2 ms 4956 KB ok
36 Correct 3 ms 4956 KB ok
37 Correct 2 ms 5212 KB ok
38 Correct 2 ms 4952 KB ok
39 Correct 2 ms 4952 KB ok
40 Correct 2 ms 5008 KB ok
41 Correct 2 ms 4956 KB ok

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB ok
2 Correct 2 ms 4956 KB ok
3 Correct 2 ms 5032 KB ok
4 Correct 3 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Correct 2 ms 4956 KB ok
9 Correct 2 ms 4956 KB ok
10 Correct 2 ms 4956 KB ok
11 Correct 2 ms 4956 KB ok
12 Correct 2 ms 5084 KB ok
13 Correct 2 ms 4956 KB ok
14 Correct 2 ms 4956 KB ok
15 Correct 2 ms 4956 KB ok
16 Correct 2 ms 4956 KB ok
17 Correct 2 ms 4956 KB ok
18 Correct 3 ms 4956 KB ok
19 Correct 2 ms 4956 KB ok
20 Correct 2 ms 4956 KB ok
21 Correct 2 ms 4956 KB ok
22 Correct 2 ms 4956 KB ok
23 Correct 2 ms 4956 KB ok
24 Correct 2 ms 4956 KB ok
25 Correct 2 ms 4956 KB ok
26 Correct 2 ms 4924 KB ok
27 Correct 2 ms 4956 KB ok
28 Correct 2 ms 4956 KB ok
29 Correct 2 ms 4956 KB ok
30 Correct 2 ms 4956 KB ok
31 Correct 2 ms 4956 KB ok
32 Correct 2 ms 4956 KB ok
33 Correct 2 ms 4956 KB ok
34 Correct 2 ms 4952 KB ok
35 Correct 2 ms 4956 KB ok
36 Correct 3 ms 4956 KB ok
37 Correct 2 ms 5212 KB ok
38 Correct 2 ms 4952 KB ok
39 Correct 2 ms 4952 KB ok
40 Correct 2 ms 5008 KB ok
41 Correct 2 ms 4956 KB ok
42 Runtime error 25 ms 18524 KB Execution killed with signal 11
43 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB ok
2 Correct 2 ms 4956 KB ok
3 Correct 2 ms 5032 KB ok
4 Correct 3 ms 4956 KB ok
5 Correct 2 ms 4956 KB ok
6 Correct 2 ms 4956 KB ok
7 Correct 2 ms 4956 KB ok
8 Runtime error 6 ms 10332 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -