oj.uz

Submission #290372

# Submission time Handle Problem Language Result Execution time Memory
290372 2020-09-03T17:03:10 Z evpipis Rectangles (IOI19_rect) C++17
100 / 100
 3604 ms 275960 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ii, int> inter;

const int len = 2505, mx = 2500;
int mat[len][len], po[len], n, m;
int bit[len][len];
vector<inter> row[len], col[len];

void upd(int i, int j, int v){
    while (j <= mx)
        bit[i][j] += v, j += j&(-j);
}

int ask(int i, int j){
    int ans = 0;
    while (j > 0)
        ans += bit[i][j], j -= j&(-j);
    return ans;
}

vector<inter> make_inter(vector<int> vec){
    vector<inter> res;

    vector<int> stck;
    for (int i = 0; i < vec.size(); i++){
        while (!stck.empty() && vec[i] > vec[stck.back()])
            stck.pop_back();

        if (!stck.empty() && stck.back() < i-1)
            res.pb(mp(mp(stck.back()+1, i-1), 1));

        stck.pb(i);
    }

    stck.clear();
    for (int i = (int)vec.size()-1; i >= 0; i--){
        while (!stck.empty() && vec[i] > vec[stck.back()])
            stck.pop_back();

        if (!stck.empty() && stck.back() > i+1)
            res.pb(mp(mp(i+1, stck.back()-1), 1));

        stck.pb(i);
    }

    sort(res.begin(), res.end());
    res.erase(unique(res.begin(), res.end()), res.end());
    return res;
}

bool comp1(inter a, inter b){
    return (a.se > b.se);
}

bool comp2(inter a, inter b){
    return (a.fi.se-a.fi.fi > b.fi.se-b.fi.fi);
}

ll count_rectangles(vector<vector<int> > M) {
    n = M.size(), m = M[0].size();
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            mat[i][j] = M[i][j];

    for (int i = n-1; i >= 0; i--){
        vector<int> vec;
        for (int j = 0; j < m; j++)
            vec.pb(mat[i][j]);
        row[i] = make_inter(vec);

        for (int k = 0, l = 0; k < row[i].size(); k++){
            while (l < row[i+1].size() && row[i+1][l].fi < row[i][k].fi)
                l++;

            if (l < row[i+1].size() && row[i+1][l].fi == row[i][k].fi)
                row[i][k].se += row[i+1][l].se;
        }

        /*printf("row#%d\n", i);
        for (auto cur: row[i])
            printf("[(%d, %d), %d] ", cur.fi.fi, cur.fi.se, cur.se);
        printf("\n");*/
    }

    for (int j = m-1; j >= 0; j--){
        vector<int> vec;
        for (int i = 0; i < n; i++)
            vec.pb(mat[i][j]);
        col[j] = make_inter(vec);

        for (int k = 0, l = 0; k < col[j].size(); k++){
            while (l < col[j+1].size() && col[j+1][l].fi < col[j][k].fi)
                l++;

            if (l < col[j+1].size() && col[j+1][l].fi == col[j][k].fi)
                col[j][k].se += col[j+1][l].se;
        }

        /*printf("col#%d\n", j);
        for (auto cur: col[j])
            printf("[(%d, %d), %d] ", cur.fi.fi, cur.fi.se, cur.se);
        printf("\n");*/
    }

    ll ans = 0;
    for (int j = 0; j < m; j++)
        po[j] = 0;
    for (int row1 = 0; row1 < n; row1++){
        vector<inter> vec;
        for (int j = 0; j < m; j++)
            while (po[j] < col[j].size() && col[j][po[j]].fi.fi == row1)
                vec.pb(mp(mp(j, col[j][po[j]].fi.se), col[j][po[j]].se)), po[j]++;
        sort(vec.begin(), vec.end(), comp1);

        sort(row[row1].begin(), row[row1].end(), comp2);

        //printf("after sort: row1 = %d\n", row1);

        int j = 0;
        for (int i = 0; i < row[row1].size(); i++){
            int col1 = row[row1][i].fi.fi, col2 = row[row1][i].fi.se;
            int row2 = row1+row[row1][i].se-1;

            while (j < vec.size() && vec[j].se >= col2-col1+1)
                upd(vec[j].fi.fi, vec[j].fi.se, +1), j++;

            ans += ask(col1, row2);
        }

        while (j > 0){
            j--;
            upd(vec[j].fi.fi, vec[j].fi.se, -1);
        }
    }

	return ans;
}

/*
10 10
3 2 2 2 5 1 1 1 1 1
3 1 1 1 2 1 1 1 1 1
6 2 2 2 3 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
*/

Compilation message

rect.cpp: In function 'std::vector<std::pair<std::pair<int, int>, int> > make_inter(std::vector<int>)':
rect.cpp:35:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (int i = 0; i < vec.size(); i++){
      |                     ~~^~~~~~~~~~~~
rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:81:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for (int k = 0, l = 0; k < row[i].size(); k++){
      |                                ~~^~~~~~~~~~~~~~~
rect.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             while (l < row[i+1].size() && row[i+1][l].fi < row[i][k].fi)
      |                    ~~^~~~~~~~~~~~~~~~~
rect.cpp:85:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |             if (l < row[i+1].size() && row[i+1][l].fi == row[i][k].fi)
      |                 ~~^~~~~~~~~~~~~~~~~
rect.cpp:101:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for (int k = 0, l = 0; k < col[j].size(); k++){
      |                                ~~^~~~~~~~~~~~~~~
rect.cpp:102:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |             while (l < col[j+1].size() && col[j+1][l].fi < col[j][k].fi)
      |                    ~~^~~~~~~~~~~~~~~~~
rect.cpp:105:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |             if (l < col[j+1].size() && col[j+1][l].fi == col[j][k].fi)
      |                 ~~^~~~~~~~~~~~~~~~~
rect.cpp:121:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |             while (po[j] < col[j].size() && col[j][po[j]].fi.fi == row1)
      |                    ~~~~~~^~~~~~~~~~~~~~~
rect.cpp:130:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |         for (int i = 0; i < row[row1].size(); i++){
      |                         ~~^~~~~~~~~~~~~~~~~~
rect.cpp:134:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |             while (j < vec.size() && vec[j].se >= col2-col1+1)
      |                    ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 928 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 416 KB Output is correct
17 Correct 3 ms 1920 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 4 ms 1792 KB Output is correct
21 Correct 6 ms 1920 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 4 ms 1920 KB Output is correct
24 Correct 3 ms 1280 KB Output is correct
25 Correct 1 ms 416 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 896 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 928 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 416 KB Output is correct
17 Correct 3 ms 1920 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 4 ms 1792 KB Output is correct
21 Correct 6 ms 1920 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 4 ms 1920 KB Output is correct
24 Correct 3 ms 1280 KB Output is correct
25 Correct 18 ms 5120 KB Output is correct
26 Correct 14 ms 5120 KB Output is correct
27 Correct 15 ms 5120 KB Output is correct
28 Correct 12 ms 4736 KB Output is correct
29 Correct 20 ms 4992 KB Output is correct
30 Correct 21 ms 5248 KB Output is correct
31 Correct 21 ms 5120 KB Output is correct
32 Correct 21 ms 5112 KB Output is correct
33 Correct 1 ms 416 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 896 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 512 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 928 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 416 KB Output is correct
17 Correct 3 ms 1920 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 4 ms 1792 KB Output is correct
21 Correct 6 ms 1920 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 4 ms 1920 KB Output is correct
24 Correct 3 ms 1280 KB Output is correct
25 Correct 18 ms 5120 KB Output is correct
26 Correct 14 ms 5120 KB Output is correct
27 Correct 15 ms 5120 KB Output is correct
28 Correct 12 ms 4736 KB Output is correct
29 Correct 20 ms 4992 KB Output is correct
30 Correct 21 ms 5248 KB Output is correct
31 Correct 21 ms 5120 KB Output is correct
32 Correct 21 ms 5112 KB Output is correct
33 Correct 100 ms 25464 KB Output is correct
34 Correct 98 ms 24952 KB Output is correct
35 Correct 99 ms 24952 KB Output is correct
36 Correct 95 ms 25204 KB Output is correct
37 Correct 182 ms 33436 KB Output is correct
38 Correct 181 ms 33528 KB Output is correct
39 Correct 176 ms 33416 KB Output is correct
40 Correct 169 ms 32300 KB Output is correct
41 Correct 97 ms 25464 KB Output is correct
42 Correct 141 ms 25336 KB Output is correct
43 Correct 252 ms 33804 KB Output is correct
44 Correct 253 ms 33784 KB Output is correct
45 Correct 120 ms 19064 KB Output is correct
46 Correct 137 ms 21112 KB Output is correct
47 Correct 236 ms 33016 KB Output is correct
48 Correct 240 ms 33016 KB Output is correct
49 Correct 1 ms 416 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 1 ms 896 KB Output is correct
52 Correct 1 ms 512 KB Output is correct
53 Correct 1 ms 512 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 25344 KB Output is correct
2 Correct 15 ms 21632 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 9 ms 10368 KB Output is correct
6 Correct 9 ms 10112 KB Output is correct
7 Correct 9 ms 9856 KB Output is correct
8 Correct 8 ms 9088 KB Output is correct
9 Correct 8 ms 8704 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 3 ms 768 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 577 ms 106744 KB Output is correct
3 Correct 1263 ms 203128 KB Output is correct
4 Correct 1275 ms 204104 KB Output is correct
5 Correct 1261 ms 204152 KB Output is correct
6 Correct 137 ms 42872 KB Output is correct
7 Correct 284 ms 82556 KB Output is correct
8 Correct 305 ms 86392 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 928 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 416 KB Output is correct
17 Correct 3 ms 1920 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 4 ms 1792 KB Output is correct
21 Correct 6 ms 1920 KB Output is correct
22 Correct 6 ms 1920 KB Output is correct
23 Correct 4 ms 1920 KB Output is correct
24 Correct 3 ms 1280 KB Output is correct
25 Correct 18 ms 5120 KB Output is correct
26 Correct 14 ms 5120 KB Output is correct
27 Correct 15 ms 5120 KB Output is correct
28 Correct 12 ms 4736 KB Output is correct
29 Correct 20 ms 4992 KB Output is correct
30 Correct 21 ms 5248 KB Output is correct
31 Correct 21 ms 5120 KB Output is correct
32 Correct 21 ms 5112 KB Output is correct
33 Correct 100 ms 25464 KB Output is correct
34 Correct 98 ms 24952 KB Output is correct
35 Correct 99 ms 24952 KB Output is correct
36 Correct 95 ms 25204 KB Output is correct
37 Correct 182 ms 33436 KB Output is correct
38 Correct 181 ms 33528 KB Output is correct
39 Correct 176 ms 33416 KB Output is correct
40 Correct 169 ms 32300 KB Output is correct
41 Correct 97 ms 25464 KB Output is correct
42 Correct 141 ms 25336 KB Output is correct
43 Correct 252 ms 33804 KB Output is correct
44 Correct 253 ms 33784 KB Output is correct
45 Correct 120 ms 19064 KB Output is correct
46 Correct 137 ms 21112 KB Output is correct
47 Correct 236 ms 33016 KB Output is correct
48 Correct 240 ms 33016 KB Output is correct
49 Correct 16 ms 25344 KB Output is correct
50 Correct 15 ms 21632 KB Output is correct
51 Correct 2 ms 640 KB Output is correct
52 Correct 1 ms 512 KB Output is correct
53 Correct 9 ms 10368 KB Output is correct
54 Correct 9 ms 10112 KB Output is correct
55 Correct 9 ms 9856 KB Output is correct
56 Correct 8 ms 9088 KB Output is correct
57 Correct 8 ms 8704 KB Output is correct
58 Correct 2 ms 640 KB Output is correct
59 Correct 3 ms 768 KB Output is correct
60 Correct 1 ms 512 KB Output is correct
61 Correct 577 ms 106744 KB Output is correct
62 Correct 1263 ms 203128 KB Output is correct
63 Correct 1275 ms 204104 KB Output is correct
64 Correct 1261 ms 204152 KB Output is correct
65 Correct 137 ms 42872 KB Output is correct
66 Correct 284 ms 82556 KB Output is correct
67 Correct 305 ms 86392 KB Output is correct
68 Correct 1462 ms 190584 KB Output is correct
69 Correct 1203 ms 188024 KB Output is correct
70 Correct 1203 ms 190072 KB Output is correct
71 Correct 1156 ms 190072 KB Output is correct
72 Correct 2196 ms 275960 KB Output is correct
73 Correct 2063 ms 186232 KB Output is correct
74 Correct 2125 ms 186488 KB Output is correct
75 Correct 3487 ms 267384 KB Output is correct
76 Correct 2145 ms 178192 KB Output is correct
77 Correct 2811 ms 227128 KB Output is correct
78 Correct 3604 ms 269160 KB Output is correct
79 Correct 2012 ms 171292 KB Output is correct
80 Correct 3369 ms 259208 KB Output is correct
81 Correct 3319 ms 262960 KB Output is correct
82 Correct 1253 ms 169976 KB Output is correct
83 Correct 2224 ms 255536 KB Output is correct
84 Correct 2216 ms 255504 KB Output is correct
85 Correct 2257 ms 255488 KB Output is correct
86 Correct 1 ms 416 KB Output is correct
87 Correct 1 ms 512 KB Output is correct
88 Correct 1 ms 896 KB Output is correct
89 Correct 1 ms 512 KB Output is correct
90 Correct 1 ms 512 KB Output is correct