oj.uz

답안 #991762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991762 2024-06-03T06:03:02 Z stdfloat 축구 경기장 (IOI23_soccer) C++17
6 / 100
 4500 ms 47396 KB 
#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;

#define pii pair<int, int>

int n, mx;

vector<vector<int>> a, v;

void f(int x) {
    if (x == n * n) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (!a[i][j]) continue;

                vector<vector<bool>> vis(n, vector<bool>(n));
                vis[i][j] = true;
                for (int z = 0; z < 2; z++) {
                    for (int k = 0; k < n; k++) {
                        for (int l = 0; l < n; l++) {
                            if (!vis[k][l]) continue;

                            for (int m = l - 1; m >= 0 && !a[k][m] && v[k][m]; m--)
                                vis[k][m] = true;
                            for (int m = l + 1; m < n && !a[k][m] && v[k][m]; m++)
                                v[k][m] = true;

                            for (int m = k - 1; m >= 0 && !a[m][l] && v[m][l]; m--)
                                vis[m][l] = true;
                            for (int m = k + 1; m < n && !a[m][l] && v[m][l]; m++)
                                vis[m][l] = true;
                        }
                    }
                }

                for (int k = 0; k < n; k++) {
                    for (int l = 0; l < n; l++)
                        if (v[k][l] && !vis[k][l]) return;
                }
            }
        }

        int cnt = 0;
        for (auto i : v)
            cnt += count(i.begin(), i.end(), 1);

        mx = max(mx, cnt);

        return;
    }

    for (int i = 0; i < 2; i++) {
        v[x / n][x % n] = i;
        f(x + 1);
    }
}

int biggest_stadium(int N, vector<vector<int>> F) {
    n = N; a = F;

    int cnt = 0;
    for (auto i : a)
        cnt += count(i.begin(), i.end(), 1);

    if (!cnt) return n * n;
    else if (cnt == 1) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (a[i][j] == 1)
                    return n * n - min({(n - i) * (n - j), (n - i) * (j + 1), (i + 1) * (n - j), (i + 1) * (j + 1)});
            }
        }
    }

    v.assign(n, vector<int>(n));
    f(0);

    return mx;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4509 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

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 1 ms 348 KB ok
8 Correct 14 ms 3420 KB ok
9 Correct 213 ms 47396 KB ok

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 1 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 0 ms 348 KB partial
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4509 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4509 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4509 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4509 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -