oj.uz

답안 #994136

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994136 2024-06-07T07:12:26 Z stdfloat 축구 경기장 (IOI23_soccer) C++17
0 / 100
 4500 ms 3840 KB 
#include <bits/stdc++.h>
#include "soccer.h"
using namespace std;
 
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 (!v[i][j]) continue;

                vector<vector<bool>> vis(n, vector<bool>(n));
                vis[i][j] = true;
                for (int z = 0; z < 2; z++) {
                    vector<vector<bool>> vis2(n, vector<bool>(n));
                    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 && v[k][m]; m--)
                                vis2[k][m] = true;
                            for (int m = l + 1; m < n && v[k][m]; m++)
                                vis2[k][m] = true;
 
                            for (int m = k - 1; m >= 0 && v[m][l]; m--)
                                vis2[m][l] = true;
                            for (int m = k + 1; m < n && v[m][l]; m++)
                                vis2[m][l] = true;
                        }
                    }

                    for (int k = 0; k < n; k++) {
                        for (int l = 0; l < n; l++)
                            if (vis2[k][l]) vis[k][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++) {
        if (i && a[x / n][x % n]) return;

        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);
 
    bool tr = true;
    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++) {
                vector<vector<bool>> vis2(n, vector<bool>(n));
                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]; m--)
                            vis2[k][m] = true;
                        for (int m = l + 1; m < n && !a[k][m]; m++)
                            vis2[k][m] = true;
 
                        for (int m = k - 1; m >= 0 && !a[m][l]; m--)
                            vis2[m][l] = true;
                        for (int m = k + 1; m < n && !a[m][l]; m++)
                            vis2[m][l] = true;
                    }
                }
 
                for (int k = 0; k < n; k++) {
                    for (int l = 0; l < n; l++)
                        if (vis2[k][l]) vis[k][l] = true;
                }
            }
 
            for (int k = 0; k < n; k++) {
                for (int l = 0; l < n; l++)
                    if (!a[k][l] && !vis[k][l]) tr = false;
            }
        }
    }
 
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            if (a[i][j] && 2 < ((i && !a[i - 1][j]) + (i + 1 < n && !a[i + 1][j]) + (j && !a[i][j - 1]) + (j + 1 < n && !a[i][j + 1]))) {
                assert(!tr);
                return 0;
            }
    }

    return n * n - cnt;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 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 Partially correct 0 ms 348 KB partial
7 Partially correct 1310 ms 768 KB partial
8 Execution timed out 4545 ms 3840 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ok
2 Correct 1 ms 348 KB ok
3 Partially correct 0 ms 600 KB partial
4 Partially correct 0 ms 348 KB partial
5 Incorrect 1 ms 372 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Partially correct 0 ms 600 KB partial
5 Partially correct 0 ms 348 KB partial
6 Incorrect 1 ms 372 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 600 KB partial
7 Partially correct 0 ms 348 KB partial
8 Incorrect 1 ms 372 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 348 KB ok
4 Correct 1 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Partially correct 0 ms 600 KB partial
7 Partially correct 0 ms 348 KB partial
8 Incorrect 1 ms 372 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 1 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 Partially correct 0 ms 348 KB partial
8 Partially correct 1310 ms 768 KB partial
9 Execution timed out 4545 ms 3840 KB Time limit exceeded
10 Halted 0 ms 0 KB -