oj.uz

Submission #231144

# Submission time Handle Problem Language Result Execution time Memory
231144 2020-05-12T21:36:00 Z achibasadzishvili Rectangles (IOI19_rect) C++14
100 / 100
 4225 ms 831368 KB 
#include<bits/stdc++.h>
#define ll int
#define f first
#define s second
#define pb push_back
#define mp make_pair
using namespace std;
vector<ll>vec[2505][2505];
ll l[2505][2505],r[2505][2505],dow[2505][2505],up[2505][2505];
ll qve[2505][2505],ze[2505][2505];
ll rig[2505][2505],lef[2505][2505];
vector<pair<ll,ll> >row[2505],col[2505];
long long count_rectangles(vector<vector<int> >a){
    ll n = (ll)a.size();
    ll m = (ll)a[0].size();
    stack<pair<ll,ll> >st;
    for(int i=0; i<n; i++){
        while(st.size())st.pop();
        for(int j=0; j<m; j++){
            while(st.size() && a[i][j] > st.top().f)st.pop();
            l[i][j] = -1;
            if(st.size())l[i][j] = st.top().s;
            st.push(mp(a[i][j] , j));
        }
        while(st.size())st.pop();
        for(int j=m - 1; j>=0; j--){
            while(st.size() && a[i][j] > st.top().f)st.pop();
            r[i][j] = m + 1;
            if(st.size())r[i][j] = st.top().s;
            st.push(mp(a[i][j] , j));
        }
        for(int j=0; j<m; j++){
            if(l[i][j] != -1){
                // l[i][j] , j is possible
                row[i].pb(mp(l[i][j] , j));
            }
            if(r[i][j] != m + 1){
                // j r[i][j] is possible
                row[i].pb(mp(j , r[i][j]));
            }
        }
    }
    
    for(int i=0; i<m; i++){
        while(st.size())st.pop();
        for(int j=0; j<n; j++){
            while(st.size() && a[j][i] > st.top().f)st.pop();
            up[j][i] = -1;
            if(st.size())up[j][i] = st.top().s;
            st.push(mp(a[j][i] , j));
        }
        while(st.size())st.pop();
        for(int j=n - 1; j>=0; j--){
            while(st.size() && a[j][i] > st.top().f)st.pop();
            dow[j][i] = n + 1;
            if(st.size())dow[j][i] = st.top().s;
            st.push(mp(a[j][i] , j));
        }
        for(int j=0; j<n; j++){
            if(up[j][i] != -1){
                vec[up[j][i]][i].pb(j);
                col[i].pb(mp(up[j][i] , j));
            }
            if(dow[j][i] != n + 1){
                if(a[j][i] != a[dow[j][i]][i])
                vec[j][i].pb(dow[j][i]);
                col[i].pb(mp(j , dow[j][i]));
            }
        }
    }
    
    for(int i=0; i<m; i++){
        for(int j=0; j<col[i].size(); j++){
            ll x = col[i][j].f;
            ll y = col[i][j].s;
            bool ok = 0;
            if(a[x][i] <= a[y][i])
                qve[x][i] = 1;
            if(a[x][i] >= a[y][i])
                ze[y][i] = 1;
            if(i == 0){
                continue;
            }
            if(a[x][i] <= a[y][i] && a[x][i - 1] <= a[y][i - 1] && dow[x][i - 1] == y)
                qve[x][i] = qve[x][i - 1] + 1;
            if(a[x][i] >= a[y][i] && a[x][i - 1] <= a[y][i - 1] && dow[x][i - 1] == y)
                ze[y][i] = qve[x][i - 1] + 1;
            if(a[x][i] <= a[y][i] && a[x][i - 1] >= a[y][i - 1] && up[y][i - 1] == x)
                qve[x][i] = ze[y][i - 1] + 1;
            if(a[x][i] >= a[y][i] && a[x][i - 1] >= a[y][i - 1] && up[y][i - 1] == x)
                ze[y][i] = ze[y][i - 1] + 1;
        }
    }
    
    for(int i=n - 1; i>=0; i--){
        for(int j=0; j<row[i].size(); j++){
            ll x = row[i][j].f;
            ll y = row[i][j].s;
            bool ok = 0;
            if(a[i][x] <= a[i][y])
                rig[i][x] = 1;
            if(a[i][x] >= a[i][y])
                lef[i][y] = 1;
            if(i == n - 1){
                continue;
            }
            if(a[i][x] <= a[i][y] && a[i + 1][x] <= a[i + 1][y] && r[i + 1][x] == y)
                rig[i][x] = rig[i + 1][x] + 1;
            if(a[i][x] >= a[i][y] && a[i + 1][x] <= a[i + 1][y] && r[i + 1][x] == y)
                lef[i][y] = rig[i + 1][x] + 1;
            if(a[i][x] <= a[i][y] && a[i + 1][x] >= a[i + 1][y] && l[i + 1][y] == x)
                rig[i][x] = lef[i + 1][y] + 1;
            if(a[i][x] >= a[i][y] && a[i + 1][x] >= a[i + 1][y] && l[i + 1][y] == x)
                lef[i][y] = lef[i + 1][y] + 1;
        }
    }
    //cout << qve[1][2] << "<--\n";
    ll ans = 0;
    for(int x=1; x<n-1; x++){
        for(int y=0; y<m; y++){
            // cout << x << " " << y << " " << l[x][y] << " " << r[x][y] << '\n';
            if(l[x][y] != -1 && a[x][l[x][y]] >= a[x][y] && l[x][y] < y - 1){
                //cout << x - 1 << " --- " << y - 1 << '\n';
                for(int i=0; i<vec[x - 1][y - 1].size(); i++){
                    ll z = vec[x - 1][y - 1][i];
                    if(z == x)continue;
                    bool k = 0 , p = 0;
                    if(lef[x][y] >= z - x)k = 1;
                    if(a[x - 1][y - 1] <= a[z][y - 1] && qve[x - 1][y - 1] >= y - l[x][y] - 1)p = 1;
                    if(a[x - 1][y - 1] >= a[z][y - 1] && ze[z][y - 1] >= y - l[x][y] - 1)p = 1;
                    //cout << x << " " << y << " " << lef[x][y] << " " << z << '\n';
                    if(p && k){
                        //cout << "- " << x << " " << l[x][y] + 1 << " " << z - 1 << " " << y - 1 << '\n';;
                        ans++;
                    }
                    //cout << '\n';
                }
            }
            if(r[x][y] < m && a[x][r[x][y]] > a[x][y] && r[x][y] > y + 1){
            //    cout << x - 1 << " -- " << y + 1 << '\n';
                for(int i=0; i<vec[x - 1][y + 1].size(); i++){
                    ll z = vec[x - 1][y + 1][i];
                    if(z == x)continue;
                    bool k = 0 , p = 0;
                    if(rig[x][y] >= z - x)k = 1;
                    if(a[x - 1][r[x][y] - 1] <= a[z][r[x][y] - 1] && qve[x - 1][r[x][y] - 1] >= r[x][y] - y - 1 && dow[x-1][r[x][y]-1] == z)p = 1;
                    if(a[x - 1][r[x][y] - 1] >= a[z][r[x][y] - 1] && ze[z][r[x][y] - 1] >= r[x][y] - y - 1 && up[z][r[x][y]-1] == x - 1)p = 1;
                    //cout << x << " " << y << " " << r[x][y] << " " << z << " " << rig[x][y] << " " << p << '\n';
                    if(p && k){
                    //    cout << " +";
                        //cout << "- " << x << " " << y + 1 << " " << z - 1 << " " << r[x][y] - 1 << '\n';;
                        ans++;
                    }
                    //cout << '\n';
                }
            }
        }
    }
    return ans;
}
long long naive(vector<vector<int> >a){
    ll ans = 0;
    for(int x=1; x<(int)a.size() - 1; x++){
        for(int y=1; y<(int)a[0].size() - 1; y++){
            for(int z=x; z<(int)a.size() - 1; z++){
                for(int t=y; t<(int)a[0].size() - 1; t++){
                    bool ok = 1;
                    for(int i=x; i<=z; i++)
                        for(int j=y; j<=t; j++)
                            if(a[i][j] >= a[x - 1][j] || a[i][j] >= a[z + 1][j] || a[i][j] >= a[i][y - 1] || a[i][j] >= a[i][t + 1])
                                ok = 0;
                    ans += (ok == 1);
                }
            }
        }
    }
    return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:73:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<col[i].size(); j++){
                      ~^~~~~~~~~~~~~~
rect.cpp:76:18: warning: unused variable 'ok' [-Wunused-variable]
             bool ok = 0;
                  ^~
rect.cpp:96:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<row[i].size(); j++){
                      ~^~~~~~~~~~~~~~
rect.cpp:99:18: warning: unused variable 'ok' [-Wunused-variable]
             bool ok = 0;
                  ^~
rect.cpp:124:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int i=0; i<vec[x - 1][y - 1].size(); i++){
                              ~^~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:141:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int i=0; i<vec[x - 1][y + 1].size(); i++){
                              ~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 147960 KB Output is correct
2 Correct 91 ms 148984 KB Output is correct
3 Correct 91 ms 148860 KB Output is correct
4 Correct 92 ms 148916 KB Output is correct
5 Correct 89 ms 148856 KB Output is correct
6 Correct 89 ms 148856 KB Output is correct
7 Correct 99 ms 148856 KB Output is correct
8 Correct 92 ms 148216 KB Output is correct
9 Correct 88 ms 148856 KB Output is correct
10 Correct 89 ms 148832 KB Output is correct
11 Correct 90 ms 148856 KB Output is correct
12 Correct 89 ms 148984 KB Output is correct
13 Correct 87 ms 147832 KB Output is correct
14 Correct 88 ms 148088 KB Output is correct
15 Correct 89 ms 148088 KB Output is correct
16 Correct 89 ms 147960 KB Output is correct
17 Correct 91 ms 147832 KB Output is correct
18 Correct 93 ms 147832 KB Output is correct
19 Correct 89 ms 148856 KB Output is correct
20 Correct 87 ms 148856 KB Output is correct
21 Correct 88 ms 148216 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 147960 KB Output is correct
2 Correct 91 ms 148984 KB Output is correct
3 Correct 91 ms 148860 KB Output is correct
4 Correct 92 ms 148916 KB Output is correct
5 Correct 89 ms 148856 KB Output is correct
6 Correct 89 ms 148856 KB Output is correct
7 Correct 99 ms 148856 KB Output is correct
8 Correct 92 ms 148216 KB Output is correct
9 Correct 88 ms 148856 KB Output is correct
10 Correct 89 ms 148832 KB Output is correct
11 Correct 90 ms 148856 KB Output is correct
12 Correct 89 ms 148984 KB Output is correct
13 Correct 87 ms 147832 KB Output is correct
14 Correct 88 ms 148088 KB Output is correct
15 Correct 89 ms 148088 KB Output is correct
16 Correct 89 ms 147960 KB Output is correct
17 Correct 94 ms 151288 KB Output is correct
18 Correct 91 ms 151288 KB Output is correct
19 Correct 93 ms 151292 KB Output is correct
20 Correct 95 ms 151160 KB Output is correct
21 Correct 93 ms 151160 KB Output is correct
22 Correct 92 ms 151160 KB Output is correct
23 Correct 94 ms 151164 KB Output is correct
24 Correct 91 ms 150904 KB Output is correct
25 Correct 91 ms 147832 KB Output is correct
26 Correct 93 ms 147832 KB Output is correct
27 Correct 89 ms 148856 KB Output is correct
28 Correct 87 ms 148856 KB Output is correct
29 Correct 88 ms 148216 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 147960 KB Output is correct
2 Correct 91 ms 148984 KB Output is correct
3 Correct 91 ms 148860 KB Output is correct
4 Correct 92 ms 148916 KB Output is correct
5 Correct 89 ms 148856 KB Output is correct
6 Correct 89 ms 148856 KB Output is correct
7 Correct 99 ms 148856 KB Output is correct
8 Correct 92 ms 148216 KB Output is correct
9 Correct 88 ms 148856 KB Output is correct
10 Correct 89 ms 148832 KB Output is correct
11 Correct 90 ms 148856 KB Output is correct
12 Correct 89 ms 148984 KB Output is correct
13 Correct 87 ms 147832 KB Output is correct
14 Correct 88 ms 148088 KB Output is correct
15 Correct 89 ms 148088 KB Output is correct
16 Correct 89 ms 147960 KB Output is correct
17 Correct 94 ms 151288 KB Output is correct
18 Correct 91 ms 151288 KB Output is correct
19 Correct 93 ms 151292 KB Output is correct
20 Correct 95 ms 151160 KB Output is correct
21 Correct 93 ms 151160 KB Output is correct
22 Correct 92 ms 151160 KB Output is correct
23 Correct 94 ms 151164 KB Output is correct
24 Correct 91 ms 150904 KB Output is correct
25 Correct 112 ms 158968 KB Output is correct
26 Correct 111 ms 158880 KB Output is correct
27 Correct 106 ms 159096 KB Output is correct
28 Correct 107 ms 158712 KB Output is correct
29 Correct 109 ms 158840 KB Output is correct
30 Correct 109 ms 158968 KB Output is correct
31 Correct 116 ms 158968 KB Output is correct
32 Correct 108 ms 158968 KB Output is correct
33 Correct 91 ms 147832 KB Output is correct
34 Correct 93 ms 147832 KB Output is correct
35 Correct 89 ms 148856 KB Output is correct
36 Correct 87 ms 148856 KB Output is correct
37 Correct 88 ms 148216 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 147960 KB Output is correct
2 Correct 91 ms 148984 KB Output is correct
3 Correct 91 ms 148860 KB Output is correct
4 Correct 92 ms 148916 KB Output is correct
5 Correct 89 ms 148856 KB Output is correct
6 Correct 89 ms 148856 KB Output is correct
7 Correct 99 ms 148856 KB Output is correct
8 Correct 92 ms 148216 KB Output is correct
9 Correct 88 ms 148856 KB Output is correct
10 Correct 89 ms 148832 KB Output is correct
11 Correct 90 ms 148856 KB Output is correct
12 Correct 89 ms 148984 KB Output is correct
13 Correct 87 ms 147832 KB Output is correct
14 Correct 88 ms 148088 KB Output is correct
15 Correct 89 ms 148088 KB Output is correct
16 Correct 89 ms 147960 KB Output is correct
17 Correct 94 ms 151288 KB Output is correct
18 Correct 91 ms 151288 KB Output is correct
19 Correct 93 ms 151292 KB Output is correct
20 Correct 95 ms 151160 KB Output is correct
21 Correct 93 ms 151160 KB Output is correct
22 Correct 92 ms 151160 KB Output is correct
23 Correct 94 ms 151164 KB Output is correct
24 Correct 91 ms 150904 KB Output is correct
25 Correct 112 ms 158968 KB Output is correct
26 Correct 111 ms 158880 KB Output is correct
27 Correct 106 ms 159096 KB Output is correct
28 Correct 107 ms 158712 KB Output is correct
29 Correct 109 ms 158840 KB Output is correct
30 Correct 109 ms 158968 KB Output is correct
31 Correct 116 ms 158968 KB Output is correct
32 Correct 108 ms 158968 KB Output is correct
33 Correct 280 ms 221432 KB Output is correct
34 Correct 273 ms 221560 KB Output is correct
35 Correct 291 ms 222840 KB Output is correct
36 Correct 281 ms 222840 KB Output is correct
37 Correct 318 ms 229116 KB Output is correct
38 Correct 310 ms 228984 KB Output is correct
39 Correct 315 ms 229240 KB Output is correct
40 Correct 305 ms 224248 KB Output is correct
41 Correct 337 ms 226936 KB Output is correct
42 Correct 341 ms 226680 KB Output is correct
43 Correct 372 ms 228088 KB Output is correct
44 Correct 372 ms 229880 KB Output is correct
45 Correct 237 ms 200560 KB Output is correct
46 Correct 216 ms 189180 KB Output is correct
47 Correct 362 ms 229112 KB Output is correct
48 Correct 382 ms 229832 KB Output is correct
49 Correct 91 ms 147832 KB Output is correct
50 Correct 93 ms 147832 KB Output is correct
51 Correct 89 ms 148856 KB Output is correct
52 Correct 87 ms 148856 KB Output is correct
53 Correct 88 ms 148216 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 148600 KB Output is correct
2 Correct 89 ms 148476 KB Output is correct
3 Correct 90 ms 148600 KB Output is correct
4 Correct 92 ms 147832 KB Output is correct
5 Correct 97 ms 148600 KB Output is correct
6 Correct 90 ms 148600 KB Output is correct
7 Correct 91 ms 148600 KB Output is correct
8 Correct 90 ms 148472 KB Output is correct
9 Correct 96 ms 148600 KB Output is correct
10 Correct 92 ms 148088 KB Output is correct
11 Correct 90 ms 148344 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 148088 KB Output is correct
2 Correct 1645 ms 466680 KB Output is correct
3 Correct 3571 ms 813432 KB Output is correct
4 Correct 3672 ms 816112 KB Output is correct
5 Correct 3653 ms 816092 KB Output is correct
6 Correct 1702 ms 483220 KB Output is correct
7 Correct 3074 ms 787960 KB Output is correct
8 Correct 3208 ms 815352 KB Output is correct
9 Correct 91 ms 147832 KB Output is correct
10 Correct 93 ms 147832 KB Output is correct
11 Correct 89 ms 148856 KB Output is correct
12 Correct 87 ms 148856 KB Output is correct
13 Correct 88 ms 148216 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 147960 KB Output is correct
2 Correct 91 ms 148984 KB Output is correct
3 Correct 91 ms 148860 KB Output is correct
4 Correct 92 ms 148916 KB Output is correct
5 Correct 89 ms 148856 KB Output is correct
6 Correct 89 ms 148856 KB Output is correct
7 Correct 99 ms 148856 KB Output is correct
8 Correct 92 ms 148216 KB Output is correct
9 Correct 88 ms 148856 KB Output is correct
10 Correct 89 ms 148832 KB Output is correct
11 Correct 90 ms 148856 KB Output is correct
12 Correct 89 ms 148984 KB Output is correct
13 Correct 87 ms 147832 KB Output is correct
14 Correct 88 ms 148088 KB Output is correct
15 Correct 89 ms 148088 KB Output is correct
16 Correct 89 ms 147960 KB Output is correct
17 Correct 94 ms 151288 KB Output is correct
18 Correct 91 ms 151288 KB Output is correct
19 Correct 93 ms 151292 KB Output is correct
20 Correct 95 ms 151160 KB Output is correct
21 Correct 93 ms 151160 KB Output is correct
22 Correct 92 ms 151160 KB Output is correct
23 Correct 94 ms 151164 KB Output is correct
24 Correct 91 ms 150904 KB Output is correct
25 Correct 112 ms 158968 KB Output is correct
26 Correct 111 ms 158880 KB Output is correct
27 Correct 106 ms 159096 KB Output is correct
28 Correct 107 ms 158712 KB Output is correct
29 Correct 109 ms 158840 KB Output is correct
30 Correct 109 ms 158968 KB Output is correct
31 Correct 116 ms 158968 KB Output is correct
32 Correct 108 ms 158968 KB Output is correct
33 Correct 280 ms 221432 KB Output is correct
34 Correct 273 ms 221560 KB Output is correct
35 Correct 291 ms 222840 KB Output is correct
36 Correct 281 ms 222840 KB Output is correct
37 Correct 318 ms 229116 KB Output is correct
38 Correct 310 ms 228984 KB Output is correct
39 Correct 315 ms 229240 KB Output is correct
40 Correct 305 ms 224248 KB Output is correct
41 Correct 337 ms 226936 KB Output is correct
42 Correct 341 ms 226680 KB Output is correct
43 Correct 372 ms 228088 KB Output is correct
44 Correct 372 ms 229880 KB Output is correct
45 Correct 237 ms 200560 KB Output is correct
46 Correct 216 ms 189180 KB Output is correct
47 Correct 362 ms 229112 KB Output is correct
48 Correct 382 ms 229832 KB Output is correct
49 Correct 90 ms 148600 KB Output is correct
50 Correct 89 ms 148476 KB Output is correct
51 Correct 90 ms 148600 KB Output is correct
52 Correct 92 ms 147832 KB Output is correct
53 Correct 97 ms 148600 KB Output is correct
54 Correct 90 ms 148600 KB Output is correct
55 Correct 91 ms 148600 KB Output is correct
56 Correct 90 ms 148472 KB Output is correct
57 Correct 96 ms 148600 KB Output is correct
58 Correct 92 ms 148088 KB Output is correct
59 Correct 90 ms 148344 KB Output is correct
60 Correct 91 ms 148088 KB Output is correct
61 Correct 1645 ms 466680 KB Output is correct
62 Correct 3571 ms 813432 KB Output is correct
63 Correct 3672 ms 816112 KB Output is correct
64 Correct 3653 ms 816092 KB Output is correct
65 Correct 1702 ms 483220 KB Output is correct
66 Correct 3074 ms 787960 KB Output is correct
67 Correct 3208 ms 815352 KB Output is correct
68 Correct 3136 ms 771252 KB Output is correct
69 Correct 3091 ms 771364 KB Output is correct
70 Correct 3550 ms 789772 KB Output is correct
71 Correct 3455 ms 789564 KB Output is correct
72 Correct 3500 ms 831368 KB Output is correct
73 Correct 2393 ms 563072 KB Output is correct
74 Correct 2474 ms 647672 KB Output is correct
75 Correct 4225 ms 816248 KB Output is correct
76 Correct 2446 ms 556236 KB Output is correct
77 Correct 3177 ms 720692 KB Output is correct
78 Correct 4059 ms 822648 KB Output is correct
79 Correct 2371 ms 555384 KB Output is correct
80 Correct 3909 ms 822068 KB Output is correct
81 Correct 3800 ms 803888 KB Output is correct
82 Correct 2088 ms 630776 KB Output is correct
83 Correct 3458 ms 815952 KB Output is correct
84 Correct 3434 ms 815404 KB Output is correct
85 Correct 3442 ms 815136 KB Output is correct
86 Correct 91 ms 147832 KB Output is correct
87 Correct 93 ms 147832 KB Output is correct
88 Correct 89 ms 148856 KB Output is correct
89 Correct 87 ms 148856 KB Output is correct
90 Correct 88 ms 148216 KB Output is correct