Submission #1233450

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233450		antonn	Soccer Stadium (IOI23_soccer)	C++20	0 / 100	1 ms	328 KiB

soccer

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

using namespace std;

typedef long long ll;

const int N = 1000 + 7;
const int M = 30 + 7;

int a[N][N], pref[N][N];

int biggest_stadium(int n, vector<vector<int>> f) {
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            a[i][j] = f[i - 1][j - 1];
            pref[i][j] = pref[i][j - 1] + a[i][j];
        }
    }
    
    int x = -1, y = -1;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (a[i][j]) x = i, y = j;
        }
    }
    if (x == -1) return n * n;
    if ((x == 1 || x == n) && (y == 1 || y == n)) return n * n - 1;
    if (x == 1 || x == n) return (n - 1) * n + max(y - 1, n - y);
    if (y == 1 || y == n) return (n - 1) * n + max(x - 1, n - x);
    return n * n - 1;
}

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