oj.uz

Submission #310122

# Submission time Handle Problem Language Result Execution time Memory
310122 2020-10-05T21:33:38 Z fivefourthreeone Rectangles (IOI19_rect) C++17
100 / 100
 3520 ms 444696 KB 
#include "rect.h"
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
const int mxN = 2501;
int n, m;
vector<vector<int>> arr;
vector<int> atrow[mxN][mxN];
vector<pair<int, int>> atcol[mxN];
vector<int> len[mxN];
vector<int> ch[mxN];
int BIT[mxN][mxN];
void upd(int num, int pos, int del) {
    pos++;
    while(pos<mxN) {
        BIT[num][pos]+=del;
        pos+=pos&-pos;
    }
}
int sum(int num, int pos) {
    int res = 0;
    pos++;
    while(pos) {
        res+=BIT[num][pos];
        pos-=pos&-pos;
    }
    return res;
}
ll count_rectangles(vector<vector<int>> A) {
    arr = A;
    n = A.size();
    m = A[0].size();
    for(int i = 1; i < m-1; ++i) {
        vector<int> stk;
        for(int j = 0; j < n; ++j) {
            while(stk.size() && arr[stk.back()][i] < arr[j][i])stk.pop_back();
            if(stk.size() && j - stk.back() > 1) {
                atcol[i].emplace_back(stk.back(), j);
            }
            stk.push_back(j);
        }
        stk.clear();
        for(int j = n-1; j >= 0; --j) {
            while(stk.size() && arr[stk.back()][i] < arr[j][i])stk.pop_back();
            if(stk.size() && stk.back() - j > 1) {
                atcol[i].emplace_back(j, stk.back());
            }
            stk.push_back(j);
        }
        sort(atcol[i].begin(), atcol[i].end());
        atcol[i].resize(unique(atcol[i].begin(), atcol[i].end()) - atcol[i].begin());
    }
    for(int i = 1; i < n-1; ++i) {
        vector<int> stk;
        vector<pair<int, int>> ex;
        for(int j = 0; j < m; ++j) {
            while(stk.size() && arr[i][stk.back()] < arr[i][j])stk.pop_back();
            if(stk.size() && j - stk.back() > 1) {
                ex.emplace_back(stk.back(), j);
            }
            stk.push_back(j);
        }
        stk.clear();
        for(int j = m-1; j >= 0; --j) {
            while(stk.size() && arr[i][stk.back()] < arr[i][j])stk.pop_back();
            if(stk.size() && stk.back() - j > 1) {
                ex.emplace_back(j, stk.back());
            }
            stk.push_back(j);
        }
        sort(ex.begin(), ex.end());
        ex.resize(unique(ex.begin(), ex.end()) - ex.begin());
        for(auto p: ex) {
            atrow[p.first][p.second].push_back(i);
        }
    }
    for(int j = m-1; j >= 1; --j) {
        len[j].resize(atcol[j].size());
        for(int i = 0; i < atcol[j].size(); ++i) {
            int above = lower_bound(atcol[j+1].begin(), atcol[j+1].end(), atcol[j][i]) - atcol[j+1].begin();
            if(above==atcol[j+1].size() || atcol[j+1][above]!=atcol[j][i]) {
                len[j][i] = 1;
            }else {
                len[j][i] = len[j+1][above] + 1;
            }
        }
    }
    ll res = 0;
    for(int i = 1; i < m-1; ++i) {
        for(int j = i; j < m-1; ++j) {
            ch[j].clear();
        }
        for(int j = 0; j < atcol[i].size(); ++j) {
            upd(atcol[i][j].second, atcol[i][j].first, 1);
            ch[i + len[i][j] - 1].push_back(j);
            //cout<<atcol[i][j].first<<" "<<atcol[i][j].second<<" "<<len[i][j]<<"\n";
        }
        for(int j = i; j < m-1; ++j) {
            int prv = 1;
            for(int k = 0; k < atrow[i-1][j+1].size(); ++k) {
                if(k && atrow[i-1][j+1][k-1]==atrow[i-1][j+1][k]-1)prv++;
                else prv = 1;
                //cout<<atrow[i-1][j+1][k]<<" "<<i<<" "<<j<<" "<<prv<<"\n";
                //cout<<sum(atrow[i-1][j+1][k] - prv, atrow[i-1][j+1][k]+1)<<"\n";
                int val = sum(atrow[i-1][j+1][k] + 1, atrow[i-1][j+1][k] + 1) - 
                (atrow[i-1][j+1][k]-prv == 0 ? 0 : sum(atrow[i-1][j+1][k] + 1, atrow[i-1][j+1][k] - prv - 1));
                //cout<<val<<"\n";
                res += val;
            }
            for(int k: ch[j]) {
                upd(atcol[i][k].second, atcol[i][k].first, -1);
            }
        }
    }
    return res;
}

Compilation message

rect.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
rect.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:83:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for(int i = 0; i < atcol[j].size(); ++i) {
      |                        ~~^~~~~~~~~~~~~~~~~
rect.cpp:85:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |             if(above==atcol[j+1].size() || atcol[j+1][above]!=atcol[j][i]) {
      |                ~~~~~^~~~~~~~~~~~~~~~~~~
rect.cpp:97:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         for(int j = 0; j < atcol[i].size(); ++j) {
      |                        ~~^~~~~~~~~~~~~~~~~
rect.cpp:104:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |             for(int k = 0; k < atrow[i-1][j+1].size(); ++k) {
      |                            ~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 147452 KB Output is correct
2 Correct 90 ms 147448 KB Output is correct
3 Correct 92 ms 147448 KB Output is correct
4 Correct 90 ms 147448 KB Output is correct
5 Correct 90 ms 147320 KB Output is correct
6 Correct 91 ms 147704 KB Output is correct
7 Correct 91 ms 147704 KB Output is correct
8 Correct 92 ms 147576 KB Output is correct
9 Correct 91 ms 147704 KB Output is correct
10 Correct 92 ms 147656 KB Output is correct
11 Correct 91 ms 147704 KB Output is correct
12 Correct 91 ms 147832 KB Output is correct
13 Correct 90 ms 147320 KB Output is correct
14 Correct 90 ms 147448 KB Output is correct
15 Correct 90 ms 147320 KB Output is correct
16 Correct 89 ms 147360 KB Output is correct
17 Correct 90 ms 147320 KB Output is correct
18 Correct 92 ms 147320 KB Output is correct
19 Correct 93 ms 147704 KB Output is correct
20 Correct 91 ms 147400 KB Output is correct
21 Correct 91 ms 147324 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 147452 KB Output is correct
2 Correct 90 ms 147448 KB Output is correct
3 Correct 92 ms 147448 KB Output is correct
4 Correct 90 ms 147448 KB Output is correct
5 Correct 90 ms 147320 KB Output is correct
6 Correct 91 ms 147704 KB Output is correct
7 Correct 91 ms 147704 KB Output is correct
8 Correct 92 ms 147576 KB Output is correct
9 Correct 91 ms 147704 KB Output is correct
10 Correct 92 ms 147656 KB Output is correct
11 Correct 91 ms 147704 KB Output is correct
12 Correct 91 ms 147832 KB Output is correct
13 Correct 90 ms 147320 KB Output is correct
14 Correct 90 ms 147448 KB Output is correct
15 Correct 90 ms 147320 KB Output is correct
16 Correct 89 ms 147360 KB Output is correct
17 Correct 93 ms 147704 KB Output is correct
18 Correct 94 ms 147704 KB Output is correct
19 Correct 92 ms 147704 KB Output is correct
20 Correct 92 ms 148344 KB Output is correct
21 Correct 93 ms 148476 KB Output is correct
22 Correct 94 ms 148472 KB Output is correct
23 Correct 93 ms 148344 KB Output is correct
24 Correct 94 ms 148344 KB Output is correct
25 Correct 90 ms 147320 KB Output is correct
26 Correct 92 ms 147320 KB Output is correct
27 Correct 93 ms 147704 KB Output is correct
28 Correct 91 ms 147400 KB Output is correct
29 Correct 91 ms 147324 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 147452 KB Output is correct
2 Correct 90 ms 147448 KB Output is correct
3 Correct 92 ms 147448 KB Output is correct
4 Correct 90 ms 147448 KB Output is correct
5 Correct 90 ms 147320 KB Output is correct
6 Correct 91 ms 147704 KB Output is correct
7 Correct 91 ms 147704 KB Output is correct
8 Correct 92 ms 147576 KB Output is correct
9 Correct 91 ms 147704 KB Output is correct
10 Correct 92 ms 147656 KB Output is correct
11 Correct 91 ms 147704 KB Output is correct
12 Correct 91 ms 147832 KB Output is correct
13 Correct 90 ms 147320 KB Output is correct
14 Correct 90 ms 147448 KB Output is correct
15 Correct 90 ms 147320 KB Output is correct
16 Correct 89 ms 147360 KB Output is correct
17 Correct 93 ms 147704 KB Output is correct
18 Correct 94 ms 147704 KB Output is correct
19 Correct 92 ms 147704 KB Output is correct
20 Correct 92 ms 148344 KB Output is correct
21 Correct 93 ms 148476 KB Output is correct
22 Correct 94 ms 148472 KB Output is correct
23 Correct 93 ms 148344 KB Output is correct
24 Correct 94 ms 148344 KB Output is correct
25 Correct 99 ms 148856 KB Output is correct
26 Correct 101 ms 148856 KB Output is correct
27 Correct 100 ms 148984 KB Output is correct
28 Correct 101 ms 150520 KB Output is correct
29 Correct 109 ms 151032 KB Output is correct
30 Correct 110 ms 151160 KB Output is correct
31 Correct 108 ms 151032 KB Output is correct
32 Correct 107 ms 151060 KB Output is correct
33 Correct 90 ms 147320 KB Output is correct
34 Correct 92 ms 147320 KB Output is correct
35 Correct 93 ms 147704 KB Output is correct
36 Correct 91 ms 147400 KB Output is correct
37 Correct 91 ms 147324 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 147452 KB Output is correct
2 Correct 90 ms 147448 KB Output is correct
3 Correct 92 ms 147448 KB Output is correct
4 Correct 90 ms 147448 KB Output is correct
5 Correct 90 ms 147320 KB Output is correct
6 Correct 91 ms 147704 KB Output is correct
7 Correct 91 ms 147704 KB Output is correct
8 Correct 92 ms 147576 KB Output is correct
9 Correct 91 ms 147704 KB Output is correct
10 Correct 92 ms 147656 KB Output is correct
11 Correct 91 ms 147704 KB Output is correct
12 Correct 91 ms 147832 KB Output is correct
13 Correct 90 ms 147320 KB Output is correct
14 Correct 90 ms 147448 KB Output is correct
15 Correct 90 ms 147320 KB Output is correct
16 Correct 89 ms 147360 KB Output is correct
17 Correct 93 ms 147704 KB Output is correct
18 Correct 94 ms 147704 KB Output is correct
19 Correct 92 ms 147704 KB Output is correct
20 Correct 92 ms 148344 KB Output is correct
21 Correct 93 ms 148476 KB Output is correct
22 Correct 94 ms 148472 KB Output is correct
23 Correct 93 ms 148344 KB Output is correct
24 Correct 94 ms 148344 KB Output is correct
25 Correct 99 ms 148856 KB Output is correct
26 Correct 101 ms 148856 KB Output is correct
27 Correct 100 ms 148984 KB Output is correct
28 Correct 101 ms 150520 KB Output is correct
29 Correct 109 ms 151032 KB Output is correct
30 Correct 110 ms 151160 KB Output is correct
31 Correct 108 ms 151032 KB Output is correct
32 Correct 107 ms 151060 KB Output is correct
33 Correct 188 ms 176120 KB Output is correct
34 Correct 178 ms 176120 KB Output is correct
35 Correct 194 ms 176120 KB Output is correct
36 Correct 177 ms 176120 KB Output is correct
37 Correct 205 ms 166904 KB Output is correct
38 Correct 203 ms 166904 KB Output is correct
39 Correct 202 ms 167160 KB Output is correct
40 Correct 197 ms 166776 KB Output is correct
41 Correct 172 ms 165868 KB Output is correct
42 Correct 209 ms 166520 KB Output is correct
43 Correct 318 ms 175336 KB Output is correct
44 Correct 320 ms 177400 KB Output is correct
45 Correct 203 ms 165880 KB Output is correct
46 Correct 202 ms 162552 KB Output is correct
47 Correct 297 ms 174300 KB Output is correct
48 Correct 298 ms 175340 KB Output is correct
49 Correct 90 ms 147320 KB Output is correct
50 Correct 92 ms 147320 KB Output is correct
51 Correct 93 ms 147704 KB Output is correct
52 Correct 91 ms 147400 KB Output is correct
53 Correct 91 ms 147324 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 147704 KB Output is correct
2 Correct 103 ms 147704 KB Output is correct
3 Correct 107 ms 147576 KB Output is correct
4 Correct 90 ms 147348 KB Output is correct
5 Correct 106 ms 147576 KB Output is correct
6 Correct 108 ms 147576 KB Output is correct
7 Correct 105 ms 147576 KB Output is correct
8 Correct 108 ms 147576 KB Output is correct
9 Correct 110 ms 147576 KB Output is correct
10 Correct 104 ms 147364 KB Output is correct
11 Correct 104 ms 147448 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 147448 KB Output is correct
2 Correct 632 ms 223684 KB Output is correct
3 Correct 1301 ms 300032 KB Output is correct
4 Correct 1307 ms 300040 KB Output is correct
5 Correct 1323 ms 300472 KB Output is correct
6 Correct 229 ms 183800 KB Output is correct
7 Correct 411 ms 216440 KB Output is correct
8 Correct 440 ms 221016 KB Output is correct
9 Correct 90 ms 147320 KB Output is correct
10 Correct 92 ms 147320 KB Output is correct
11 Correct 93 ms 147704 KB Output is correct
12 Correct 91 ms 147400 KB Output is correct
13 Correct 91 ms 147324 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 147452 KB Output is correct
2 Correct 90 ms 147448 KB Output is correct
3 Correct 92 ms 147448 KB Output is correct
4 Correct 90 ms 147448 KB Output is correct
5 Correct 90 ms 147320 KB Output is correct
6 Correct 91 ms 147704 KB Output is correct
7 Correct 91 ms 147704 KB Output is correct
8 Correct 92 ms 147576 KB Output is correct
9 Correct 91 ms 147704 KB Output is correct
10 Correct 92 ms 147656 KB Output is correct
11 Correct 91 ms 147704 KB Output is correct
12 Correct 91 ms 147832 KB Output is correct
13 Correct 90 ms 147320 KB Output is correct
14 Correct 90 ms 147448 KB Output is correct
15 Correct 90 ms 147320 KB Output is correct
16 Correct 89 ms 147360 KB Output is correct
17 Correct 93 ms 147704 KB Output is correct
18 Correct 94 ms 147704 KB Output is correct
19 Correct 92 ms 147704 KB Output is correct
20 Correct 92 ms 148344 KB Output is correct
21 Correct 93 ms 148476 KB Output is correct
22 Correct 94 ms 148472 KB Output is correct
23 Correct 93 ms 148344 KB Output is correct
24 Correct 94 ms 148344 KB Output is correct
25 Correct 99 ms 148856 KB Output is correct
26 Correct 101 ms 148856 KB Output is correct
27 Correct 100 ms 148984 KB Output is correct
28 Correct 101 ms 150520 KB Output is correct
29 Correct 109 ms 151032 KB Output is correct
30 Correct 110 ms 151160 KB Output is correct
31 Correct 108 ms 151032 KB Output is correct
32 Correct 107 ms 151060 KB Output is correct
33 Correct 188 ms 176120 KB Output is correct
34 Correct 178 ms 176120 KB Output is correct
35 Correct 194 ms 176120 KB Output is correct
36 Correct 177 ms 176120 KB Output is correct
37 Correct 205 ms 166904 KB Output is correct
38 Correct 203 ms 166904 KB Output is correct
39 Correct 202 ms 167160 KB Output is correct
40 Correct 197 ms 166776 KB Output is correct
41 Correct 172 ms 165868 KB Output is correct
42 Correct 209 ms 166520 KB Output is correct
43 Correct 318 ms 175336 KB Output is correct
44 Correct 320 ms 177400 KB Output is correct
45 Correct 203 ms 165880 KB Output is correct
46 Correct 202 ms 162552 KB Output is correct
47 Correct 297 ms 174300 KB Output is correct
48 Correct 298 ms 175340 KB Output is correct
49 Correct 106 ms 147704 KB Output is correct
50 Correct 103 ms 147704 KB Output is correct
51 Correct 107 ms 147576 KB Output is correct
52 Correct 90 ms 147348 KB Output is correct
53 Correct 106 ms 147576 KB Output is correct
54 Correct 108 ms 147576 KB Output is correct
55 Correct 105 ms 147576 KB Output is correct
56 Correct 108 ms 147576 KB Output is correct
57 Correct 110 ms 147576 KB Output is correct
58 Correct 104 ms 147364 KB Output is correct
59 Correct 104 ms 147448 KB Output is correct
60 Correct 91 ms 147448 KB Output is correct
61 Correct 632 ms 223684 KB Output is correct
62 Correct 1301 ms 300032 KB Output is correct
63 Correct 1307 ms 300040 KB Output is correct
64 Correct 1323 ms 300472 KB Output is correct
65 Correct 229 ms 183800 KB Output is correct
66 Correct 411 ms 216440 KB Output is correct
67 Correct 440 ms 221016 KB Output is correct
68 Correct 1860 ms 423800 KB Output is correct
69 Correct 1282 ms 406392 KB Output is correct
70 Correct 1894 ms 406648 KB Output is correct
71 Correct 1329 ms 406520 KB Output is correct
72 Correct 1972 ms 389880 KB Output is correct
73 Correct 2041 ms 317728 KB Output is correct
74 Correct 2124 ms 334968 KB Output is correct
75 Correct 3350 ms 412604 KB Output is correct
76 Correct 2106 ms 334056 KB Output is correct
77 Correct 2735 ms 389544 KB Output is correct
78 Correct 3520 ms 444696 KB Output is correct
79 Correct 1890 ms 307824 KB Output is correct
80 Correct 3219 ms 419556 KB Output is correct
81 Correct 3108 ms 412748 KB Output is correct
82 Correct 1145 ms 293368 KB Output is correct
83 Correct 1966 ms 389752 KB Output is correct
84 Correct 1959 ms 389756 KB Output is correct
85 Correct 1960 ms 389752 KB Output is correct
86 Correct 90 ms 147320 KB Output is correct
87 Correct 92 ms 147320 KB Output is correct
88 Correct 93 ms 147704 KB Output is correct
89 Correct 91 ms 147400 KB Output is correct
90 Correct 91 ms 147324 KB Output is correct