Submission #848760

#	Time	Username	Problem	Language	Result	Execution time	Memory
848760		d4xn	Soccer Stadium (IOI23_soccer)	C++17	1.50 / 100	245 ms	47384 KiB

soccer

#include "soccer.h"
#include <bits/stdc++.h>

using namespace std;

int n, e;
vector<vector<int>> f;

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

    // se pueden coger todas las empty cells?
    bool ok = 1;
    e = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            e += !f[i][j];
            if (f[i][j] == 1) {
                if (i && i+1 < n && !f[i-1][j] && !f[i+1][j]) ok = 0;
                if (j && j+1 < n && !f[i][j-1] && !f[i][j+1]) ok = 0;
            }
        }
    }
    if (ok) return e;

    // hay solo un tree?

    // bruteforce?
    

    return 1e9;
}

• 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