Submission #1010382

#	Time	Username	Problem	Language	Result	Execution time	Memory
1010382		thinknoexit	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	229 ms	55380 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2020;
int n;
int f[N][N];
int biggest_stadium(int NN, vector<vector<int>> F) {
    n = NN;
    int empty_cell = 0;
    for (int i = 1;i <= n;i++) {
        f[0][i] = f[n + 1][i] = f[i][0] = f[i][n + 1] = 1;
        for (int j = 1;j <= n;j++) {
            f[i][j] = F[i - 1][j - 1];
            empty_cell += f[i][j] == 0;
        }
    }
    { // check if all empty cell are regular stadium
        bool ch = 1;
        for (int i = 1;i <= n;i++) {
            int cnt = 0;
            for (int j = 1;j <= n;j++) {
                cnt += f[i][j - 1] != f[i][j];
            }
            if (cnt > 2) ch = 0;
        }
        for (int j = 1;j <= n;j++) {
            int cnt = 0;
            for (int i = 1;i <= n;i++) {
                cnt += f[i - 1][j] != f[i][j];
            }
            if (cnt > 2) ch = 0;
        }
        if (ch) return empty_cell;
    }
    return 0;
}

• Subtask 0: 0 / 0
• Subtask 1: 1.5 / 6
• Subtask 2: 0 / 8
• Subtask 3: 0 / 22
• Subtask 4: 0 / 18
• Subtask 5: 0 / 16
• Subtask 6: 0 / 30