Submission #1206921

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206921		Pekiban	Soccer Stadium (IOI23_soccer)	C++20	6 / 100	187 ms	31772 KiB

soccer

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

using namespace std;

int biggest_stadium(int n, vector<vector<int>> F) {
    int x = -1, y = -1, c = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (F[i][j])    x = i, y = j, ++c;
        }
    }
    if (c == 1) {
        if (x == -1 && y == -1) return n*n;
        return n*n - min(x+1, n-x) * min(y+1, n-y);
    }
    int mn[n], mx[n];
    fill(mn, mn+n, 1e9);
    fill(mx, mx+n, -1);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (!F[i][j])    mn[i] = min(mn[i], j), mx[i] = max(mx[i], j);
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (F[i][j] && mn[i] <= j && j <= mx[i])    return 1;
        }
    }
    for (int i = 0; i < n-1; ++i) {
        if (!(mn[i] <= mn[i+1] && mx[i+1] <= mx[i]) && !(mn[i+1] <= mn[i] && mx[i] <= mx[i+1])) return 1;
    }
    fill(mn, mn+n, 1e9);
    fill(mx, mx+n, -1);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (!F[j][i])    mn[i] = min(mn[i], j), mx[i] = max(mx[i], j);
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (F[j][i] && mn[i] <= j && j <= mx[i])    return 1;
        }
    }
    for (int i = 0; i < n-1; ++i) {
        if (!(mn[i] <= mn[i+1] && mx[i+1] <= mx[i]) && !(mn[i+1] <= mn[i] && mx[i] <= mx[i+1])) return 1;
    }
    return n*n - c;
}

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