oj.uz

Submission #792771

# Submission time Handle Problem Language Result Execution time Memory
792771 2023-07-25T08:37:08 Z _martynas Rectangles (IOI19_rect) C++14
100 / 100
 3251 ms 881364 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define PB push_back

using ll = long long;
using pii = pair<int, int>;

vector<vector<pii>> good_pairs(vector<int> row) {
    vector<vector<pii>> P(row.size());
    stack<pii> st;
    for(int i = 0; i < (int)row.size(); i++) {
        while(!st.empty() && st.top().F < row[i]) {
            P[i].PB({st.top().S, 1});
            st.pop();
        }
        if(!st.empty()) {
            P[i].PB({st.top().S, 1});
            if(st.top().F == row[i]) st.pop();
        }
        st.push({row[i], i});
    }
    return P;
}

struct BIT {
    static const int mxn = 2505;
    int val[mxn]{};
    // 0-based input
    void add(int i, int x) {
        i++;
        while(i < mxn) {
            val[i] += x;
            i += i&(-i);
        }
    }
    int get(int i) {
        i++;
        int sum = 0;
        while(i) {
            sum += val[i];
            i -= i&(-i);
        }
        return sum;
    }
};


ll count_rectangles(vector<vector<int>> A) {
    int n = A.size(), m = A[0].size();
    vector<vector<vector<pii>>> rows(n), cols(m);
    //vector<vector<vector<int>>> rows_len(n), cols_len(m);
    for(int i = 0; i < n; i++) {
        rows[i] = good_pairs(A[i]);
        for(int j = 0; j < m; j++) {
            if(i) {
                for(int k = 0; k < rows[i][j].size(); k++) {
                    auto it = lower_bound(rows[i-1][j].begin(), rows[i-1][j].end(),
                                          pii{rows[i][j][k].F, 2505}, greater<pii>());
                    if(it != rows[i-1][j].end() && it->F == rows[i][j][k].F) {
                        rows[i][j][k].S += rows[i-1][j][distance(rows[i-1][j].begin(), it)].S;
                    }
                }
            }
            rows[i][j].shrink_to_fit();
        }
    }
    for(int i = 0; i < m; i++) {
        vector<int> col;
        for(int j = 0; j < n; j++) col.PB(A[j][i]);
        cols[i] = good_pairs(col);
        for(int j = 0; j < n; j++) {
            if(i) {
                for(int k = 0; k < cols[i][j].size(); k++) {
                    auto it = lower_bound(cols[i-1][j].begin(), cols[i-1][j].end(),
                                          pii{cols[i][j][k].F, 2505}, greater<pii>());
                    if(it != cols[i-1][j].end() && it->F == cols[i][j][k].F) {
                        cols[i][j][k].S += cols[i-1][j][distance(cols[i-1][j].begin(), it)].S;
                    }
                }
            }
            cols[i][j].shrink_to_fit();
        }
    }
    ll ans = 0;
    for(int i = 1; i < n; i++) {
        BIT bit;
        // look at rows (i-1, j) and cols of (i, j-1)
        for(int j = 1; j < m; j++) {
            assert(bit.get(m) == 0);
            vector<pii> rows_sort_len;
            for(int k = 1; k < rows[i-1][j].size(); k++) {
                rows_sort_len.PB({rows[i-1][j][k].S, rows[i-1][j][k].F});
            }
            sort(rows_sort_len.begin(), rows_sort_len.end());
            int added = 0;
            for(int k = cols[j-1][i].size()-1; k >= 0; k--) {
                int a = cols[j-1][i][k].F;
                while(!rows_sort_len.empty() && rows_sort_len.back().F >= i-a-1) {
                    bit.add(rows_sort_len.back().S, 1);
                    rows_sort_len.pop_back();
                    added++;
                }
                int b = cols[j-1][i][k].S;
                if(i-a > 1) {
                    int cnt = added;
                    if(j-2-b >= 0) cnt -= bit.get(j-2-b);
                    ans += cnt;

                }
            }
            for(int k = 1; k < rows[i-1][j].size(); k++) {
                bit.add(rows[i-1][j][k].F, -1);
            }
        }
    }
	return ans;
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:61:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |                 for(int k = 0; k < rows[i][j].size(); k++) {
      |                                ~~^~~~~~~~~~~~~~~~~~~
rect.cpp:78:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |                 for(int k = 0; k < cols[i][j].size(); k++) {
      |                                ~~^~~~~~~~~~~~~~~~~~~
rect.cpp:96:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |             for(int k = 1; k < rows[i-1][j].size(); k++) {
      |                            ~~^~~~~~~~~~~~~~~~~~~~~
rect.cpp:116:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |             for(int k = 1; k < rows[i-1][j].size(); k++) {
      |                            ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 3 ms 980 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 1108 KB Output is correct
29 Correct 2 ms 724 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 3 ms 1004 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 0 ms 296 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 10 ms 5844 KB Output is correct
31 Correct 12 ms 5844 KB Output is correct
32 Correct 10 ms 5844 KB Output is correct
33 Correct 10 ms 5076 KB Output is correct
34 Correct 18 ms 5292 KB Output is correct
35 Correct 16 ms 5420 KB Output is correct
36 Correct 15 ms 5508 KB Output is correct
37 Correct 18 ms 5452 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 3 ms 1004 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 10 ms 5844 KB Output is correct
26 Correct 12 ms 5844 KB Output is correct
27 Correct 10 ms 5844 KB Output is correct
28 Correct 10 ms 5076 KB Output is correct
29 Correct 18 ms 5292 KB Output is correct
30 Correct 16 ms 5420 KB Output is correct
31 Correct 15 ms 5508 KB Output is correct
32 Correct 18 ms 5452 KB Output is correct
33 Correct 0 ms 296 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 107 ms 63036 KB Output is correct
39 Correct 111 ms 60996 KB Output is correct
40 Correct 111 ms 61116 KB Output is correct
41 Correct 117 ms 59192 KB Output is correct
42 Correct 148 ms 66908 KB Output is correct
43 Correct 151 ms 66824 KB Output is correct
44 Correct 146 ms 67028 KB Output is correct
45 Correct 143 ms 62552 KB Output is correct
46 Correct 115 ms 58752 KB Output is correct
47 Correct 133 ms 59288 KB Output is correct
48 Correct 255 ms 62348 KB Output is correct
49 Correct 231 ms 62352 KB Output is correct
50 Correct 115 ms 31872 KB Output is correct
51 Correct 112 ms 31956 KB Output is correct
52 Correct 216 ms 62120 KB Output is correct
53 Correct 259 ms 62208 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1336 KB Output is correct
2 Correct 3 ms 1200 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 3 ms 1268 KB Output is correct
6 Correct 3 ms 1236 KB Output is correct
7 Correct 3 ms 1204 KB Output is correct
8 Correct 4 ms 1236 KB Output is correct
9 Correct 3 ms 1160 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 952 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 896 ms 338012 KB Output is correct
8 Correct 2678 ms 741684 KB Output is correct
9 Correct 1864 ms 746236 KB Output is correct
10 Correct 1854 ms 746644 KB Output is correct
11 Correct 735 ms 368796 KB Output is correct
12 Correct 1318 ms 700396 KB Output is correct
13 Correct 1335 ms 746628 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 2 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 3 ms 1004 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 10 ms 5844 KB Output is correct
26 Correct 12 ms 5844 KB Output is correct
27 Correct 10 ms 5844 KB Output is correct
28 Correct 10 ms 5076 KB Output is correct
29 Correct 18 ms 5292 KB Output is correct
30 Correct 16 ms 5420 KB Output is correct
31 Correct 15 ms 5508 KB Output is correct
32 Correct 18 ms 5452 KB Output is correct
33 Correct 107 ms 63036 KB Output is correct
34 Correct 111 ms 60996 KB Output is correct
35 Correct 111 ms 61116 KB Output is correct
36 Correct 117 ms 59192 KB Output is correct
37 Correct 148 ms 66908 KB Output is correct
38 Correct 151 ms 66824 KB Output is correct
39 Correct 146 ms 67028 KB Output is correct
40 Correct 143 ms 62552 KB Output is correct
41 Correct 115 ms 58752 KB Output is correct
42 Correct 133 ms 59288 KB Output is correct
43 Correct 255 ms 62348 KB Output is correct
44 Correct 231 ms 62352 KB Output is correct
45 Correct 115 ms 31872 KB Output is correct
46 Correct 112 ms 31956 KB Output is correct
47 Correct 216 ms 62120 KB Output is correct
48 Correct 259 ms 62208 KB Output is correct
49 Correct 3 ms 1336 KB Output is correct
50 Correct 3 ms 1200 KB Output is correct
51 Correct 2 ms 1108 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 3 ms 1268 KB Output is correct
54 Correct 3 ms 1236 KB Output is correct
55 Correct 3 ms 1204 KB Output is correct
56 Correct 4 ms 1236 KB Output is correct
57 Correct 3 ms 1160 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 2 ms 952 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 896 ms 338012 KB Output is correct
62 Correct 2678 ms 741684 KB Output is correct
63 Correct 1864 ms 746236 KB Output is correct
64 Correct 1854 ms 746644 KB Output is correct
65 Correct 735 ms 368796 KB Output is correct
66 Correct 1318 ms 700396 KB Output is correct
67 Correct 1335 ms 746628 KB Output is correct
68 Correct 0 ms 296 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 296 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 1731 ms 831132 KB Output is correct
74 Correct 1806 ms 806716 KB Output is correct
75 Correct 1767 ms 806636 KB Output is correct
76 Correct 1963 ms 781804 KB Output is correct
77 Correct 2624 ms 881364 KB Output is correct
78 Correct 1833 ms 479352 KB Output is correct
79 Correct 2111 ms 512712 KB Output is correct
80 Correct 3251 ms 798868 KB Output is correct
81 Correct 1892 ms 495128 KB Output is correct
82 Correct 2520 ms 660284 KB Output is correct
83 Correct 3196 ms 824804 KB Output is correct
84 Correct 1773 ms 486284 KB Output is correct
85 Correct 3122 ms 819676 KB Output is correct
86 Correct 3018 ms 798144 KB Output is correct
87 Correct 1453 ms 529472 KB Output is correct
88 Correct 2432 ms 873064 KB Output is correct
89 Correct 2336 ms 879388 KB Output is correct
90 Correct 2363 ms 877596 KB Output is correct