oj.uz

Submission #219820

# Submission time Handle Problem Language Result Execution time Memory
219820 2020-04-06T12:47:11 Z VEGAnn Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 788856 KB 
#include <bits/stdc++.h>
#include "rect.h"
#define all(x) x.begin(),x.end()
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 2510;
const int oo = 2e9;
const int PW = 13;
stack<int> stk;
bool mrk[N][N], cor[N];
int n, m, kol = 0, mx, my, Mx, My, lf[N][N], rt[N][N], up[N][N], down[N][N], spar[2][N][N][PW], po[N];
ll ans = 0, big = 0;

void dfs(int x, int y){
    if (mrk[x][y]) return;
    kol++;
    mrk[x][y] = 1;
    mx = min(mx, x);
    my = min(my, y);
    Mx = max(Mx, x);
    My = max(My, y);

    if (x > 0) dfs(x - 1, y);
    if (y > 0) dfs(x, y - 1);
    if (y < m - 1) dfs(x, y + 1);
    if (x < n - 1) dfs(x + 1, y);
}

int get(int tp, int i, int l, int r){
    int len = r - l + 1;
    int pw = po[len];

    if (tp == 1)
        return min(spar[tp][i][l][pw], spar[tp][i][r - (1 << pw) + 1][pw]);
    else return max(spar[tp][i][l][pw], spar[tp][i][r - (1 << pw) + 1][pw]);
}

long long count_rectangles(std::vector<std::vector<int> > a) {
    n = sz(a);
    m = sz(a[0]);

    if (n < 3 || m < 3) return 0;

    bool ok = 1;

    for (int i = 0; i < n && ok; i++)
        for (int j = 0; j < m && ok; j++) {
            ok &= bool(a[i][j] < 2);
            mrk[i][j] = a[i][j];
        }

    if (ok){
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                if (!mrk[i][j]){
                    mx = my = oo;
                    Mx = My = -oo;
                    kol = 0;

                    dfs(i, j);

                    if ((Mx - mx + 1) * (My - my + 1) == kol && mx > 0 && my > 0 && Mx < n - 1 && My < m - 1)
                        ans++;
                }
        return ans;
    }

    for (int i = 0; i < n; i++){
        while (sz(stk)) stk.pop();
        stk.push(-1);

        for (int j = 0; j < m; j++){
            while (sz(stk) > 1 && a[i][stk.top()] < a[i][j])
                stk.pop();

            lf[i][j] = stk.top();
            stk.push(j);
        }

        while (sz(stk)) stk.pop();
        stk.push(m);

        for (int j = m - 1; j >= 0; j--){
            while (sz(stk) > 1 && a[i][stk.top()] < a[i][j])
                stk.pop();

            rt[i][j] = stk.top();
            stk.push(j);
        }
    }

    for (int j = 0; j < m; j++){
        while (sz(stk)) stk.pop();
        stk.push(-1);

        for (int i = 0; i < n; i++){
            while (sz(stk) > 1 && a[stk.top()][j] < a[i][j])
                stk.pop();

            up[i][j] = stk.top();
            stk.push(i);
        }

        while (sz(stk)) stk.pop();
        stk.push(n);

        for (int i = n - 1; i >= 0; i--){
            while (sz(stk) > 1 && a[stk.top()][j] < a[i][j])
                stk.pop();

            down[i][j] = stk.top();
            stk.push(i);
        }
    }

    po[0] = -1;
    for (int i = 1; i <= max(n, m); i++)
        po[i] = po[i >> 1] + 1;

    for (int i = 1; i < n - 1; i++){
        for (int j = 0; j < m; j++){
            spar[0][i][j][0] = up[i + 1][j];
            spar[1][i][j][0] = down[i - 1][j];
        }

        for (int pw = 1; pw < PW; pw++)
        for (int j = 0; j + (1 << pw) - 1 < m; j++){
            spar[0][i][j][pw] = max(spar[0][i][j][pw - 1], spar[0][i][j + (1 << (pw - 1))][pw - 1]);
            spar[1][i][j][pw] = min(spar[1][i][j][pw - 1], spar[1][i][j + (1 << (pw - 1))][pw - 1]);
        }
    }

    for (int c1 = 1; c1 < m - 1; c1++)
    for (int c2 = c1; c2 < m - 1; c2++){
        for (int i = 0; i < n; i++)
            cor[i] = (rt[i][c1 - 1] > c2 && lf[i][c2 + 1] < c1);

        for (int r1 = 1; r1 < n - 1; r1++){
            if (!cor[r1]) continue;

            int bd = min(n - 1, get(1, r1, c1, c2));

            for (int r2 = r1; r2 < bd; r2++) {
                if (!cor[r2]) break;

                if (get(0, r2, c1, c2) < r1)
                    ans++;
            }
        }
    }

	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 7 ms 3072 KB Output is correct
19 Correct 9 ms 3072 KB Output is correct
20 Correct 7 ms 3072 KB Output is correct
21 Correct 7 ms 3072 KB Output is correct
22 Correct 9 ms 3072 KB Output is correct
23 Correct 7 ms 3072 KB Output is correct
24 Correct 7 ms 2688 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 7 ms 3072 KB Output is correct
19 Correct 9 ms 3072 KB Output is correct
20 Correct 7 ms 3072 KB Output is correct
21 Correct 7 ms 3072 KB Output is correct
22 Correct 9 ms 3072 KB Output is correct
23 Correct 7 ms 3072 KB Output is correct
24 Correct 7 ms 2688 KB Output is correct
25 Correct 29 ms 10240 KB Output is correct
26 Correct 35 ms 10240 KB Output is correct
27 Correct 37 ms 10240 KB Output is correct
28 Correct 32 ms 10240 KB Output is correct
29 Correct 26 ms 10240 KB Output is correct
30 Correct 28 ms 10368 KB Output is correct
31 Correct 24 ms 10240 KB Output is correct
32 Correct 23 ms 10112 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 7 ms 3072 KB Output is correct
19 Correct 9 ms 3072 KB Output is correct
20 Correct 7 ms 3072 KB Output is correct
21 Correct 7 ms 3072 KB Output is correct
22 Correct 9 ms 3072 KB Output is correct
23 Correct 7 ms 3072 KB Output is correct
24 Correct 7 ms 2688 KB Output is correct
25 Correct 29 ms 10240 KB Output is correct
26 Correct 35 ms 10240 KB Output is correct
27 Correct 37 ms 10240 KB Output is correct
28 Correct 32 ms 10240 KB Output is correct
29 Correct 26 ms 10240 KB Output is correct
30 Correct 28 ms 10368 KB Output is correct
31 Correct 24 ms 10240 KB Output is correct
32 Correct 23 ms 10112 KB Output is correct
33 Correct 634 ms 78712 KB Output is correct
34 Correct 1166 ms 78712 KB Output is correct
35 Correct 698 ms 78584 KB Output is correct
36 Correct 1171 ms 78672 KB Output is correct
37 Correct 3163 ms 78584 KB Output is correct
38 Correct 3165 ms 78580 KB Output is correct
39 Correct 3219 ms 78676 KB Output is correct
40 Correct 2145 ms 73592 KB Output is correct
41 Correct 19 ms 5888 KB Output is correct
42 Correct 455 ms 78712 KB Output is correct
43 Correct 486 ms 78584 KB Output is correct
44 Correct 551 ms 78712 KB Output is correct
45 Correct 182 ms 48076 KB Output is correct
46 Correct 256 ms 39544 KB Output is correct
47 Correct 523 ms 78584 KB Output is correct
48 Correct 510 ms 78584 KB Output is correct
49 Correct 5 ms 256 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 768 KB Output is correct
2 Correct 17 ms 896 KB Output is correct
3 Correct 5 ms 768 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 24 ms 896 KB Output is correct
6 Correct 20 ms 896 KB Output is correct
7 Correct 21 ms 896 KB Output is correct
8 Correct 20 ms 896 KB Output is correct
9 Correct 21 ms 896 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 89 ms 25848 KB Output is correct
3 Correct 181 ms 56952 KB Output is correct
4 Correct 183 ms 57208 KB Output is correct
5 Correct 183 ms 57208 KB Output is correct
6 Correct 176 ms 113912 KB Output is correct
7 Correct 329 ms 269688 KB Output is correct
8 Correct 380 ms 319696 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 5 ms 1152 KB Output is correct
4 Correct 6 ms 1152 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 1152 KB Output is correct
7 Correct 5 ms 1152 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 1152 KB Output is correct
10 Correct 5 ms 1152 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 5 ms 1152 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3072 KB Output is correct
18 Correct 7 ms 3072 KB Output is correct
19 Correct 9 ms 3072 KB Output is correct
20 Correct 7 ms 3072 KB Output is correct
21 Correct 7 ms 3072 KB Output is correct
22 Correct 9 ms 3072 KB Output is correct
23 Correct 7 ms 3072 KB Output is correct
24 Correct 7 ms 2688 KB Output is correct
25 Correct 29 ms 10240 KB Output is correct
26 Correct 35 ms 10240 KB Output is correct
27 Correct 37 ms 10240 KB Output is correct
28 Correct 32 ms 10240 KB Output is correct
29 Correct 26 ms 10240 KB Output is correct
30 Correct 28 ms 10368 KB Output is correct
31 Correct 24 ms 10240 KB Output is correct
32 Correct 23 ms 10112 KB Output is correct
33 Correct 634 ms 78712 KB Output is correct
34 Correct 1166 ms 78712 KB Output is correct
35 Correct 698 ms 78584 KB Output is correct
36 Correct 1171 ms 78672 KB Output is correct
37 Correct 3163 ms 78584 KB Output is correct
38 Correct 3165 ms 78580 KB Output is correct
39 Correct 3219 ms 78676 KB Output is correct
40 Correct 2145 ms 73592 KB Output is correct
41 Correct 19 ms 5888 KB Output is correct
42 Correct 455 ms 78712 KB Output is correct
43 Correct 486 ms 78584 KB Output is correct
44 Correct 551 ms 78712 KB Output is correct
45 Correct 182 ms 48076 KB Output is correct
46 Correct 256 ms 39544 KB Output is correct
47 Correct 523 ms 78584 KB Output is correct
48 Correct 510 ms 78584 KB Output is correct
49 Correct 22 ms 768 KB Output is correct
50 Correct 17 ms 896 KB Output is correct
51 Correct 5 ms 768 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 24 ms 896 KB Output is correct
54 Correct 20 ms 896 KB Output is correct
55 Correct 21 ms 896 KB Output is correct
56 Correct 20 ms 896 KB Output is correct
57 Correct 21 ms 896 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 89 ms 25848 KB Output is correct
62 Correct 181 ms 56952 KB Output is correct
63 Correct 183 ms 57208 KB Output is correct
64 Correct 183 ms 57208 KB Output is correct
65 Correct 176 ms 113912 KB Output is correct
66 Correct 329 ms 269688 KB Output is correct
67 Correct 380 ms 319696 KB Output is correct
68 Execution timed out 5113 ms 788856 KB Time limit exceeded
69 Halted 0 ms 0 KB -