oj.uz

Submission #1076128

# Submission time Handle Problem Language Result Execution time Memory
1076128 2024-08-26T11:18:06 Z c2zi6 Soccer Stadium (IOI23_soccer) C++17
6 / 100
 257 ms 55300 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "soccer.h"

int n;
VVI a;

VPI harevan(int x, int y) {
    VPI ret;
    if (x) ret.pb({x-1, y});
    if (x<n-1) ret.pb({x+1, y});
    if (y) ret.pb({x, y-1});
    if (y<n-1) ret.pb({x, y+1});
    return ret;
}

VVI vis;
void dfs(int x, int y) {
    vis[x][y] = true;
    for (auto[vx, vy] : harevan(x, y)) if (!vis[vx][vy]) {
        if (a[vx][vy] == 1) continue;
        dfs(vx, vy);
    }
}

int biggest_stadium(int N, VVI A_ARG) {
    n = N;
    a = A_ARG;
    rep(_, 1) {
        int x, y;
        int cnt = 0;
        rep(i, n) rep(j, n) if (a[i][j] == 1) x = i, y = j, cnt++;
        if (cnt == 0) return n*n;
        if (cnt > 1) break;
        int ans = 0;
        setmax(ans, n*n - (x+1)*(y+1));
        setmax(ans, n*n - (x+1)*(n-y));
        setmax(ans, n*n - (n-x)*(y+1));
        setmax(ans, n*n - (n-x)*(n-y));
        return ans;
    }
    VVI el, er, eu, ed;
    el = er = eu = ed = VVI(n, VI(n));
    rep(i, n) {
        bool f;
        f = false;
        replr(j, 0, n-1) {
            if (a[i][j] == 0) f = true;
            el[i][j] = f;
        }
        f = false;
        reprl(j, n-1, 0) {
            if (a[i][j] == 0) f = true;
            er[i][j] = f;
        }
    }
    rep(j, n) {
        bool f;
        f = false;
        replr(i, 0, n-1) {
            if (a[i][j] == 0) f = true;
            eu[i][j] = f;
        }
        f = false;
        reprl(i, n-1, 0) {
            if (a[i][j] == 0) f = true;
            ed[i][j] = f;
        }
    }

    int comp = 0;
    vis = VVI(n, VI(n));
    rep(i, n) rep(j, n) if (a[i][j] == 0 && !vis[i][j]) {
        dfs(i, j);
        comp++;
    }
    if (comp > 1) return 0;
    rep(i, n) rep(j, n) {
        if (a[i][j] == 1) {
            if (ed[i][j] && eu[i][j]) return 0;
            if (el[i][j] && er[i][j]) return 0;
        }
    }

    int ans = 0;
    rep(i, n) rep(j, n) if (a[i][j] == 0) ans++;
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 432 KB ok
6 Correct 1 ms 348 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 14 ms 3672 KB ok
9 Correct 257 ms 55300 KB ok

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Partially correct 0 ms 348 KB partial
4 Partially correct 0 ms 348 KB partial
5 Incorrect 0 ms 348 KB wrong
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Partially correct 0 ms 348 KB partial
5 Partially correct 0 ms 348 KB partial
6 Incorrect 0 ms 348 KB wrong
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 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 0 ms 348 KB partial
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 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 0 ms 348 KB partial
8 Incorrect 0 ms 348 KB wrong
9 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 432 KB ok
7 Correct 1 ms 348 KB ok
8 Correct 1 ms 348 KB ok
9 Correct 14 ms 3672 KB ok
10 Correct 257 ms 55300 KB ok
11 Partially correct 0 ms 348 KB partial
12 Partially correct 0 ms 348 KB partial
13 Incorrect 0 ms 348 KB wrong
14 Halted 0 ms 0 KB -