oj.uz

Submission #220177

# Submission time Handle Problem Language Result Execution time Memory
220177 2020-04-07T08:01:11 Z VEGAnn Rectangles (IOI19_rect) C++14
100 / 100
 2513 ms 674040 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())
#define pii pair<int,int>
#define MP make_pair
#define ft first
#define sd second
using namespace std;
typedef long long ll;
const int N = 2500;
const int oo = 2e9;
const int PW = 13;
vector<int> lst[N][N];
vector<int> qr[N];
stack<int> stk;
int n, m, kol = 0, mx, my, Mx, My;
short up[N][N], down[N][N], spar[2][N][N][PW], po[N];
int fen[N];
ll ans = 0, big = 0;

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]);
}

void upd(int x, int vl){
    for (; x < n; x = (x | (x + 1)))
        fen[x] += vl;
}

int sum(int x){
    int res = 0;
    for (; x >= 0; x = (x & (x + 1)) - 1)
        res += fen[x];
    return res;
}

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

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

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

        for (int j = 1; j < m; j++){
            bool was = 0;

            while (sz(stk) > 0 && a[i][stk.top()] <= a[i][j]) {
                if (a[i][stk.top()] == a[i][j]){
                    if (!was){
                        was = 1;
                        lst[stk.top() + 1][j - 1].PB(i);
                    }
                } else lst[stk.top() + 1][j - 1].PB(i);
                stk.pop();
            }

            if (sz(stk) && !was)
                lst[stk.top() + 1][j - 1].PB(i);

            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 it = 0; it < sz(lst[c1][c2]); ){
            int r1 = lst[c1][c2][it];
            int j = it + 1;

            while (j < sz(lst[c1][c2]) && lst[c1][c2][j] - 1 == lst[c1][c2][j - 1])
                j++;

            int i = lst[c1][c2][j - 1] + 1;

            for (int r2 = r1; r2 < i; r2++){
                int bd = min(n - 1, get(1, r2, c1, c2));

                qr[r2].PB(-bd);
            }

            for (int r2 = r1; r2 < i; r2++)
                qr[max(get(0, r2, c1, c2), r1 - 1)].PB(r2);

            for (int r2 = r1 - 1; r2 < i; r2++) {
                if (sz(qr[r2])) {
                    for (int cr : qr[r2])
                        if (cr < 0)
                            ans += sum(-cr - 1) - sum(r2 - 1);
                        else upd(cr, 1);

                    qr[r2].clear();
                }
            }

            for (int r2 = r1; r2 < i; r2++)
                upd(r2, -1);

            it = j;
        }
    }

	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 147192 KB Output is correct
2 Correct 81 ms 147704 KB Output is correct
3 Correct 84 ms 147704 KB Output is correct
4 Correct 82 ms 147704 KB Output is correct
5 Correct 82 ms 147704 KB Output is correct
6 Correct 85 ms 147704 KB Output is correct
7 Correct 90 ms 147704 KB Output is correct
8 Correct 84 ms 147320 KB Output is correct
9 Correct 82 ms 147704 KB Output is correct
10 Correct 83 ms 147704 KB Output is correct
11 Correct 82 ms 147708 KB Output is correct
12 Correct 83 ms 147704 KB Output is correct
13 Correct 86 ms 147192 KB Output is correct
14 Correct 81 ms 147192 KB Output is correct
15 Correct 87 ms 147448 KB Output is correct
16 Correct 82 ms 147196 KB Output is correct
17 Correct 81 ms 147140 KB Output is correct
18 Correct 83 ms 147192 KB Output is correct
19 Correct 84 ms 147728 KB Output is correct
20 Correct 89 ms 147704 KB Output is correct
21 Correct 83 ms 147192 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 147192 KB Output is correct
2 Correct 81 ms 147704 KB Output is correct
3 Correct 84 ms 147704 KB Output is correct
4 Correct 82 ms 147704 KB Output is correct
5 Correct 82 ms 147704 KB Output is correct
6 Correct 85 ms 147704 KB Output is correct
7 Correct 90 ms 147704 KB Output is correct
8 Correct 84 ms 147320 KB Output is correct
9 Correct 82 ms 147704 KB Output is correct
10 Correct 83 ms 147704 KB Output is correct
11 Correct 82 ms 147708 KB Output is correct
12 Correct 83 ms 147704 KB Output is correct
13 Correct 86 ms 147192 KB Output is correct
14 Correct 81 ms 147192 KB Output is correct
15 Correct 87 ms 147448 KB Output is correct
16 Correct 82 ms 147196 KB Output is correct
17 Correct 86 ms 148984 KB Output is correct
18 Correct 84 ms 148984 KB Output is correct
19 Correct 85 ms 148984 KB Output is correct
20 Correct 84 ms 148984 KB Output is correct
21 Correct 85 ms 148856 KB Output is correct
22 Correct 85 ms 148984 KB Output is correct
23 Correct 83 ms 148984 KB Output is correct
24 Correct 85 ms 148728 KB Output is correct
25 Correct 81 ms 147140 KB Output is correct
26 Correct 83 ms 147192 KB Output is correct
27 Correct 84 ms 147728 KB Output is correct
28 Correct 89 ms 147704 KB Output is correct
29 Correct 83 ms 147192 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 147192 KB Output is correct
2 Correct 81 ms 147704 KB Output is correct
3 Correct 84 ms 147704 KB Output is correct
4 Correct 82 ms 147704 KB Output is correct
5 Correct 82 ms 147704 KB Output is correct
6 Correct 85 ms 147704 KB Output is correct
7 Correct 90 ms 147704 KB Output is correct
8 Correct 84 ms 147320 KB Output is correct
9 Correct 82 ms 147704 KB Output is correct
10 Correct 83 ms 147704 KB Output is correct
11 Correct 82 ms 147708 KB Output is correct
12 Correct 83 ms 147704 KB Output is correct
13 Correct 86 ms 147192 KB Output is correct
14 Correct 81 ms 147192 KB Output is correct
15 Correct 87 ms 147448 KB Output is correct
16 Correct 82 ms 147196 KB Output is correct
17 Correct 86 ms 148984 KB Output is correct
18 Correct 84 ms 148984 KB Output is correct
19 Correct 85 ms 148984 KB Output is correct
20 Correct 84 ms 148984 KB Output is correct
21 Correct 85 ms 148856 KB Output is correct
22 Correct 85 ms 148984 KB Output is correct
23 Correct 83 ms 148984 KB Output is correct
24 Correct 85 ms 148728 KB Output is correct
25 Correct 93 ms 153320 KB Output is correct
26 Correct 90 ms 153336 KB Output is correct
27 Correct 91 ms 153276 KB Output is correct
28 Correct 89 ms 153208 KB Output is correct
29 Correct 94 ms 153464 KB Output is correct
30 Correct 96 ms 153592 KB Output is correct
31 Correct 93 ms 153336 KB Output is correct
32 Correct 96 ms 153340 KB Output is correct
33 Correct 81 ms 147140 KB Output is correct
34 Correct 83 ms 147192 KB Output is correct
35 Correct 84 ms 147728 KB Output is correct
36 Correct 89 ms 147704 KB Output is correct
37 Correct 83 ms 147192 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 147192 KB Output is correct
2 Correct 81 ms 147704 KB Output is correct
3 Correct 84 ms 147704 KB Output is correct
4 Correct 82 ms 147704 KB Output is correct
5 Correct 82 ms 147704 KB Output is correct
6 Correct 85 ms 147704 KB Output is correct
7 Correct 90 ms 147704 KB Output is correct
8 Correct 84 ms 147320 KB Output is correct
9 Correct 82 ms 147704 KB Output is correct
10 Correct 83 ms 147704 KB Output is correct
11 Correct 82 ms 147708 KB Output is correct
12 Correct 83 ms 147704 KB Output is correct
13 Correct 86 ms 147192 KB Output is correct
14 Correct 81 ms 147192 KB Output is correct
15 Correct 87 ms 147448 KB Output is correct
16 Correct 82 ms 147196 KB Output is correct
17 Correct 86 ms 148984 KB Output is correct
18 Correct 84 ms 148984 KB Output is correct
19 Correct 85 ms 148984 KB Output is correct
20 Correct 84 ms 148984 KB Output is correct
21 Correct 85 ms 148856 KB Output is correct
22 Correct 85 ms 148984 KB Output is correct
23 Correct 83 ms 148984 KB Output is correct
24 Correct 85 ms 148728 KB Output is correct
25 Correct 93 ms 153320 KB Output is correct
26 Correct 90 ms 153336 KB Output is correct
27 Correct 91 ms 153276 KB Output is correct
28 Correct 89 ms 153208 KB Output is correct
29 Correct 94 ms 153464 KB Output is correct
30 Correct 96 ms 153592 KB Output is correct
31 Correct 93 ms 153336 KB Output is correct
32 Correct 96 ms 153340 KB Output is correct
33 Correct 220 ms 198904 KB Output is correct
34 Correct 183 ms 199032 KB Output is correct
35 Correct 224 ms 198904 KB Output is correct
36 Correct 176 ms 198904 KB Output is correct
37 Correct 241 ms 194168 KB Output is correct
38 Correct 230 ms 194044 KB Output is correct
39 Correct 241 ms 194040 KB Output is correct
40 Correct 224 ms 191352 KB Output is correct
41 Correct 184 ms 191992 KB Output is correct
42 Correct 183 ms 192504 KB Output is correct
43 Correct 243 ms 194528 KB Output is correct
44 Correct 241 ms 194552 KB Output is correct
45 Correct 158 ms 176760 KB Output is correct
46 Correct 162 ms 171128 KB Output is correct
47 Correct 225 ms 193912 KB Output is correct
48 Correct 231 ms 194040 KB Output is correct
49 Correct 81 ms 147140 KB Output is correct
50 Correct 83 ms 147192 KB Output is correct
51 Correct 84 ms 147728 KB Output is correct
52 Correct 89 ms 147704 KB Output is correct
53 Correct 83 ms 147192 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 147704 KB Output is correct
2 Correct 93 ms 147576 KB Output is correct
3 Correct 95 ms 147524 KB Output is correct
4 Correct 81 ms 147192 KB Output is correct
5 Correct 96 ms 147576 KB Output is correct
6 Correct 99 ms 147576 KB Output is correct
7 Correct 95 ms 147576 KB Output is correct
8 Correct 95 ms 147576 KB Output is correct
9 Correct 95 ms 147596 KB Output is correct
10 Correct 83 ms 147192 KB Output is correct
11 Correct 87 ms 147320 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 147320 KB Output is correct
2 Correct 720 ms 360824 KB Output is correct
3 Correct 1455 ms 584120 KB Output is correct
4 Correct 1473 ms 586428 KB Output is correct
5 Correct 1450 ms 586232 KB Output is correct
6 Correct 573 ms 360372 KB Output is correct
7 Correct 1063 ms 570360 KB Output is correct
8 Correct 1108 ms 575896 KB Output is correct
9 Correct 81 ms 147140 KB Output is correct
10 Correct 83 ms 147192 KB Output is correct
11 Correct 84 ms 147728 KB Output is correct
12 Correct 89 ms 147704 KB Output is correct
13 Correct 83 ms 147192 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 147192 KB Output is correct
2 Correct 81 ms 147704 KB Output is correct
3 Correct 84 ms 147704 KB Output is correct
4 Correct 82 ms 147704 KB Output is correct
5 Correct 82 ms 147704 KB Output is correct
6 Correct 85 ms 147704 KB Output is correct
7 Correct 90 ms 147704 KB Output is correct
8 Correct 84 ms 147320 KB Output is correct
9 Correct 82 ms 147704 KB Output is correct
10 Correct 83 ms 147704 KB Output is correct
11 Correct 82 ms 147708 KB Output is correct
12 Correct 83 ms 147704 KB Output is correct
13 Correct 86 ms 147192 KB Output is correct
14 Correct 81 ms 147192 KB Output is correct
15 Correct 87 ms 147448 KB Output is correct
16 Correct 82 ms 147196 KB Output is correct
17 Correct 86 ms 148984 KB Output is correct
18 Correct 84 ms 148984 KB Output is correct
19 Correct 85 ms 148984 KB Output is correct
20 Correct 84 ms 148984 KB Output is correct
21 Correct 85 ms 148856 KB Output is correct
22 Correct 85 ms 148984 KB Output is correct
23 Correct 83 ms 148984 KB Output is correct
24 Correct 85 ms 148728 KB Output is correct
25 Correct 93 ms 153320 KB Output is correct
26 Correct 90 ms 153336 KB Output is correct
27 Correct 91 ms 153276 KB Output is correct
28 Correct 89 ms 153208 KB Output is correct
29 Correct 94 ms 153464 KB Output is correct
30 Correct 96 ms 153592 KB Output is correct
31 Correct 93 ms 153336 KB Output is correct
32 Correct 96 ms 153340 KB Output is correct
33 Correct 220 ms 198904 KB Output is correct
34 Correct 183 ms 199032 KB Output is correct
35 Correct 224 ms 198904 KB Output is correct
36 Correct 176 ms 198904 KB Output is correct
37 Correct 241 ms 194168 KB Output is correct
38 Correct 230 ms 194044 KB Output is correct
39 Correct 241 ms 194040 KB Output is correct
40 Correct 224 ms 191352 KB Output is correct
41 Correct 184 ms 191992 KB Output is correct
42 Correct 183 ms 192504 KB Output is correct
43 Correct 243 ms 194528 KB Output is correct
44 Correct 241 ms 194552 KB Output is correct
45 Correct 158 ms 176760 KB Output is correct
46 Correct 162 ms 171128 KB Output is correct
47 Correct 225 ms 193912 KB Output is correct
48 Correct 231 ms 194040 KB Output is correct
49 Correct 102 ms 147704 KB Output is correct
50 Correct 93 ms 147576 KB Output is correct
51 Correct 95 ms 147524 KB Output is correct
52 Correct 81 ms 147192 KB Output is correct
53 Correct 96 ms 147576 KB Output is correct
54 Correct 99 ms 147576 KB Output is correct
55 Correct 95 ms 147576 KB Output is correct
56 Correct 95 ms 147576 KB Output is correct
57 Correct 95 ms 147596 KB Output is correct
58 Correct 83 ms 147192 KB Output is correct
59 Correct 87 ms 147320 KB Output is correct
60 Correct 83 ms 147320 KB Output is correct
61 Correct 720 ms 360824 KB Output is correct
62 Correct 1455 ms 584120 KB Output is correct
63 Correct 1473 ms 586428 KB Output is correct
64 Correct 1450 ms 586232 KB Output is correct
65 Correct 573 ms 360372 KB Output is correct
66 Correct 1063 ms 570360 KB Output is correct
67 Correct 1108 ms 575896 KB Output is correct
68 Correct 2387 ms 674040 KB Output is correct
69 Correct 1663 ms 673404 KB Output is correct
70 Correct 2376 ms 673912 KB Output is correct
71 Correct 1650 ms 673784 KB Output is correct
72 Correct 2333 ms 613152 KB Output is correct
73 Correct 1448 ms 426172 KB Output is correct
74 Correct 1529 ms 470756 KB Output is correct
75 Correct 2415 ms 613092 KB Output is correct
76 Correct 1520 ms 427216 KB Output is correct
77 Correct 1963 ms 545656 KB Output is correct
78 Correct 2513 ms 614240 KB Output is correct
79 Correct 1389 ms 422008 KB Output is correct
80 Correct 2405 ms 609796 KB Output is correct
81 Correct 2329 ms 597976 KB Output is correct
82 Correct 1435 ms 456952 KB Output is correct
83 Correct 2315 ms 613092 KB Output is correct
84 Correct 2374 ms 613136 KB Output is correct
85 Correct 2348 ms 613196 KB Output is correct
86 Correct 81 ms 147140 KB Output is correct
87 Correct 83 ms 147192 KB Output is correct
88 Correct 84 ms 147728 KB Output is correct
89 Correct 89 ms 147704 KB Output is correct
90 Correct 83 ms 147192 KB Output is correct