oj.uz

Submission #1076318

# Submission time Handle Problem Language Result Execution time Memory
1076318 2024-08-26T12:57:49 Z c2zi6 Soccer Stadium (IOI23_soccer) C++17
24 / 100
 4500 ms 54608 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;
VVI prefv;
VVI prefh;

bool canv(int ux, int uy, int vx, int vy) {
    int y = uy;
    int l, r;
    if (ux < vx) l = ux, r = vx;
    else l = vx, r = ux;
    return (prefv[r+1][y] - prefv[l][y]) == 0;
}

bool canh(int ux, int uy, int vx, int vy) {
    int x = ux;
    int l, r;
    if (uy < vy) l = uy, r = vy;
    else l = vy, r = uy;
    return (prefh[x][r+1] - prefh[x][l]) == 0;
}

bool can1(int ux, int uy, int vx, int vy) {
    return canv(ux, uy, vx, uy) && canh(vx, uy, vx, vy);
}
bool can2(int ux, int uy, int vx, int vy) {
    return canh(ux, uy, ux, vy) && canv(ux, vy, vx, vy);
}

bool can(int ux, int uy, int vx, int vy) {
    return can1(ux, uy, vx, vy) || can2(ux, uy, vx, vy);
}

bool can() {
    rep(ux, n) rep(uy, n) if (a[ux][uy] == 0) {
        rep(vx, n) rep(vy, n) if (a[vx][vy] == 0) {
            if (can(ux, uy, vx, vy));
            else return 0;
        }
    }
    return true;
}

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;
    }
    prefv = prefh = VVI(n+1, VI(n+1));
    rep(i, n) {
        rep(j, n) prefh[i][j+1] = prefh[i][j] + a[i][j];
    }
    rep(j, n) {
        rep(i, n) prefv[i+1][j] = prefv[i][j] + a[i][j];
    }


    if (N <= 3) {
        int ans = 0;
        VVI atmp = a;
        rep(s, (1<<(n*n))) {
            a = atmp;
            rep(i, n) rep(j, n) if (a[i][j] == 0) {
                a[i][j] = (s & (1<<(n*i+j)));
            }
            if (can()) {
                int cur = 0;
                rep(i, n) rep(j, n) if (a[i][j] == 0) cur++;
                setmax(ans, cur);
            }
        }
        return ans;
    }

    if (!can()) 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 1 ms 344 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 384 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 1 ms 344 KB ok
8 Correct 22 ms 3672 KB ok
9 Correct 210 ms 54608 KB ok

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 1 ms 344 KB ok
4 Correct 0 ms 348 KB ok
5 Correct 1 ms 408 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 0 ms 344 KB ok
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 436 KB ok
13 Correct 0 ms 348 KB ok

Subtask #3
5.5 / 22.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 1 ms 344 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 408 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 0 ms 348 KB ok
9 Correct 0 ms 344 KB ok
10 Correct 0 ms 348 KB ok
11 Correct 0 ms 348 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 436 KB ok
14 Correct 0 ms 348 KB ok
15 Partially correct 1 ms 344 KB partial
16 Partially correct 0 ms 348 KB partial
17 Partially correct 0 ms 348 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Correct 0 ms 348 KB ok
21 Correct 0 ms 344 KB ok
22 Partially correct 0 ms 344 KB partial
23 Partially correct 1 ms 348 KB partial
24 Partially correct 1 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 432 KB partial

Subtask #4
4.5 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 384 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 344 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 408 KB ok
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 436 KB ok
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 344 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 344 KB ok
24 Partially correct 0 ms 344 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 432 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 432 KB ok
35 Correct 1 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 384 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 1 ms 344 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 408 KB ok
9 Correct 0 ms 348 KB ok
10 Correct 0 ms 348 KB ok
11 Correct 0 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 0 ms 348 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 436 KB ok
16 Correct 0 ms 348 KB ok
17 Partially correct 1 ms 344 KB partial
18 Partially correct 0 ms 348 KB partial
19 Partially correct 0 ms 348 KB partial
20 Partially correct 0 ms 348 KB partial
21 Partially correct 0 ms 348 KB partial
22 Correct 0 ms 348 KB ok
23 Correct 0 ms 344 KB ok
24 Partially correct 0 ms 344 KB partial
25 Partially correct 1 ms 348 KB partial
26 Partially correct 1 ms 348 KB partial
27 Partially correct 0 ms 348 KB partial
28 Partially correct 0 ms 432 KB partial
29 Partially correct 0 ms 348 KB partial
30 Partially correct 0 ms 348 KB partial
31 Partially correct 0 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 348 KB partial
34 Correct 0 ms 432 KB ok
35 Correct 1 ms 348 KB ok
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 1 ms 348 KB partial
39 Partially correct 0 ms 348 KB partial
40 Partially correct 0 ms 348 KB partial
41 Partially correct 0 ms 348 KB partial
42 Partially correct 20 ms 5724 KB partial
43 Partially correct 16 ms 5724 KB partial
44 Partially correct 16 ms 5724 KB partial
45 Partially correct 18 ms 5724 KB partial
46 Partially correct 16 ms 5724 KB partial
47 Partially correct 19 ms 5720 KB partial
48 Execution timed out 4512 ms 5720 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB partial
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 348 KB ok
4 Correct 0 ms 384 KB ok
5 Correct 0 ms 348 KB ok
6 Correct 0 ms 348 KB ok
7 Correct 0 ms 348 KB ok
8 Correct 1 ms 344 KB ok
9 Correct 22 ms 3672 KB ok
10 Correct 210 ms 54608 KB ok
11 Correct 1 ms 344 KB ok
12 Correct 0 ms 348 KB ok
13 Correct 1 ms 408 KB ok
14 Correct 0 ms 348 KB ok
15 Correct 0 ms 348 KB ok
16 Correct 0 ms 344 KB ok
17 Correct 0 ms 348 KB ok
18 Correct 0 ms 348 KB ok
19 Correct 0 ms 348 KB ok
20 Correct 0 ms 436 KB ok
21 Correct 0 ms 348 KB ok
22 Partially correct 1 ms 344 KB partial
23 Partially correct 0 ms 348 KB partial
24 Partially correct 0 ms 348 KB partial
25 Partially correct 0 ms 348 KB partial
26 Partially correct 0 ms 348 KB partial
27 Correct 0 ms 348 KB ok
28 Correct 0 ms 344 KB ok
29 Partially correct 0 ms 344 KB partial
30 Partially correct 1 ms 348 KB partial
31 Partially correct 1 ms 348 KB partial
32 Partially correct 0 ms 348 KB partial
33 Partially correct 0 ms 432 KB partial
34 Partially correct 0 ms 348 KB partial
35 Partially correct 0 ms 348 KB partial
36 Partially correct 0 ms 348 KB partial
37 Partially correct 0 ms 348 KB partial
38 Partially correct 0 ms 348 KB partial
39 Correct 0 ms 432 KB ok
40 Correct 1 ms 348 KB ok
41 Partially correct 0 ms 348 KB partial
42 Partially correct 0 ms 348 KB partial
43 Partially correct 1 ms 348 KB partial
44 Partially correct 0 ms 348 KB partial
45 Partially correct 0 ms 348 KB partial
46 Partially correct 0 ms 348 KB partial
47 Partially correct 20 ms 5724 KB partial
48 Partially correct 16 ms 5724 KB partial
49 Partially correct 16 ms 5724 KB partial
50 Partially correct 18 ms 5724 KB partial
51 Partially correct 16 ms 5724 KB partial
52 Partially correct 19 ms 5720 KB partial
53 Execution timed out 4512 ms 5720 KB Time limit exceeded
54 Halted 0 ms 0 KB -