oj.uz

Submission #404069

# Submission time Handle Problem Language Result Execution time Memory
404069 2021-05-13T18:13:18 Z Everule Rectangles (IOI19_rect) C++17
100 / 100
 1905 ms 437056 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
long long count_rectangles(std::vector<std::vector<int> > a) {
    int n = a.size(), m = a[0].size();
	vector hr(m, vector(m, vector(0,pair(0, 0))));
    vector vr(n, vector(m, pair(pair(-100000000,0), pair(100000000,0))));
    for(int i=1;i<n-1;i++){
        stack<int> stk;
        for(int j=0;j<m;j++){
            while(!stk.empty()){
                int k = stk.top();
                if(hr[k][j].empty() || hr[k][j].back().second + 1 != i){
                    hr[k][j].emplace_back(i,i);
                }
                else{
                    hr[k][j].back().second++;
                }
                if(a[i][k] <= a[i][j]){
                    stk.pop();
                }
                if(a[i][k] >= a[i][j]){
                    break;
                }
            }
            stk.push(j);
        }
    }
    /*
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cout<<i<<" "<<j<<"\n";
            for(auto &[l,r] : hr[i][j]){
                cout<<l<<" "<<r<<"\n";
            }
            cout<<"\n\n";
        }
    }
    */
    for(int j=m-1;j>=0;--j){
        stack<int> stk;
        for(int i=0;i<n;i++){
            while(!stk.empty()){
                int k = stk.top();
                if(a[k][j] <= a[i][j]){
                    vr[k][j].second.first = i;
                    int lf = j;
                    if(j < m-1 && vr[k][j+1].second.first == i){
                        lf = max(lf, vr[k][j+1].second.second);
                    }
                    if(j < m-1 && vr[i][j+1].first.first == k){
                        lf = max(lf, vr[i][j+1].first.second);
                    }
                    vr[k][j].second.second = lf;
                }
                else{
                    vr[i][j].first.first = k;
                    int lf = j;
                    if(j < m-1 && vr[k][j+1].second.first == i){
                        lf = max(lf, vr[k][j+1].second.second);
                    }
                    if(j < m-1 && vr[i][j+1].first.first == k){
                        lf = max(lf, vr[i][j+1].first.second);
                    }
                    vr[i][j].first.second = lf;
                }
                if(a[k][j] <= a[i][j]){
                    stk.pop();
                }
                if(a[k][j] >= a[i][j]){
                    break;
                }
            }
            stk.push(i);
        }
    }
    /*for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cout<<i<<" "<<j<<"\n";
            cout<<vr[i][j].first.first<<" "<<vr[i][j].first.second<<" "<<vr[i][j].second.first<<" "<<vr[i][j].second.second<<"\n";
        }
    }
    cout<<"\n\n";
    */
    ll ans = 0;
    for(int i=0;i<m;i++){
        for(int j=i+2;j<m;j++){
            for(auto &[l,r] : hr[i][j]){
                for(int k=max(l-1,0);k<=min(r+1,n-1);k++){
                    auto [l1,d1] = vr[k][i+1].first;
                    auto [r2,d2] = vr[k][i+1].second;
                    if(l <= l1 + 1 && l1 + 1 < k && d1 >= j-1){
                        //cout<<i<<" "<<j<<" "<<l1<<" "<<k<<"\n";
                        ans++;
                    }
                    if(r2 - 1 <= r && k < r2 - 1 && d2 >= j-1){
                        //cout<<i<<" "<<j<<" "<<k<<" "<<r2<<"\n";
                        ans++;
                    }
                }
            }
        }
    }
    return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 588 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 1 ms 332 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 2 ms 588 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 5 ms 2124 KB Output is correct
31 Correct 5 ms 2124 KB Output is correct
32 Correct 5 ms 2124 KB Output is correct
33 Correct 7 ms 2328 KB Output is correct
34 Correct 8 ms 2508 KB Output is correct
35 Correct 9 ms 2544 KB Output is correct
36 Correct 10 ms 2520 KB Output is correct
37 Correct 10 ms 2388 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 2 ms 588 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 5 ms 2124 KB Output is correct
26 Correct 5 ms 2124 KB Output is correct
27 Correct 5 ms 2124 KB Output is correct
28 Correct 7 ms 2328 KB Output is correct
29 Correct 8 ms 2508 KB Output is correct
30 Correct 9 ms 2544 KB Output is correct
31 Correct 10 ms 2520 KB Output is correct
32 Correct 10 ms 2388 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 94 ms 31156 KB Output is correct
39 Correct 74 ms 34088 KB Output is correct
40 Correct 104 ms 34192 KB Output is correct
41 Correct 90 ms 34188 KB Output is correct
42 Correct 93 ms 26652 KB Output is correct
43 Correct 66 ms 26596 KB Output is correct
44 Correct 78 ms 27076 KB Output is correct
45 Correct 77 ms 26172 KB Output is correct
46 Correct 60 ms 25912 KB Output is correct
47 Correct 68 ms 26108 KB Output is correct
48 Correct 108 ms 30244 KB Output is correct
49 Correct 142 ms 32268 KB Output is correct
50 Correct 60 ms 13380 KB Output is correct
51 Correct 62 ms 22224 KB Output is correct
52 Correct 100 ms 29988 KB Output is correct
53 Correct 109 ms 31072 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 147384 KB Output is correct
2 Correct 94 ms 106552 KB Output is correct
3 Correct 113 ms 147340 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 117 ms 147472 KB Output is correct
6 Correct 116 ms 147432 KB Output is correct
7 Correct 113 ms 147372 KB Output is correct
8 Correct 112 ms 147460 KB Output is correct
9 Correct 115 ms 147396 KB Output is correct
10 Correct 110 ms 147136 KB Output is correct
11 Correct 108 ms 147260 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 546 ms 203800 KB Output is correct
8 Correct 1135 ms 326680 KB Output is correct
9 Correct 1112 ms 327696 KB Output is correct
10 Correct 1118 ms 327668 KB Output is correct
11 Correct 441 ms 225920 KB Output is correct
12 Correct 746 ms 278964 KB Output is correct
13 Correct 837 ms 306488 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 2 ms 588 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 2 ms 588 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 5 ms 2124 KB Output is correct
26 Correct 5 ms 2124 KB Output is correct
27 Correct 5 ms 2124 KB Output is correct
28 Correct 7 ms 2328 KB Output is correct
29 Correct 8 ms 2508 KB Output is correct
30 Correct 9 ms 2544 KB Output is correct
31 Correct 10 ms 2520 KB Output is correct
32 Correct 10 ms 2388 KB Output is correct
33 Correct 94 ms 31156 KB Output is correct
34 Correct 74 ms 34088 KB Output is correct
35 Correct 104 ms 34192 KB Output is correct
36 Correct 90 ms 34188 KB Output is correct
37 Correct 93 ms 26652 KB Output is correct
38 Correct 66 ms 26596 KB Output is correct
39 Correct 78 ms 27076 KB Output is correct
40 Correct 77 ms 26172 KB Output is correct
41 Correct 60 ms 25912 KB Output is correct
42 Correct 68 ms 26108 KB Output is correct
43 Correct 108 ms 30244 KB Output is correct
44 Correct 142 ms 32268 KB Output is correct
45 Correct 60 ms 13380 KB Output is correct
46 Correct 62 ms 22224 KB Output is correct
47 Correct 100 ms 29988 KB Output is correct
48 Correct 109 ms 31072 KB Output is correct
49 Correct 114 ms 147384 KB Output is correct
50 Correct 94 ms 106552 KB Output is correct
51 Correct 113 ms 147340 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 117 ms 147472 KB Output is correct
54 Correct 116 ms 147432 KB Output is correct
55 Correct 113 ms 147372 KB Output is correct
56 Correct 112 ms 147460 KB Output is correct
57 Correct 115 ms 147396 KB Output is correct
58 Correct 110 ms 147136 KB Output is correct
59 Correct 108 ms 147260 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 546 ms 203800 KB Output is correct
62 Correct 1135 ms 326680 KB Output is correct
63 Correct 1112 ms 327696 KB Output is correct
64 Correct 1118 ms 327668 KB Output is correct
65 Correct 441 ms 225920 KB Output is correct
66 Correct 746 ms 278964 KB Output is correct
67 Correct 837 ms 306488 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 1756 ms 432836 KB Output is correct
74 Correct 1263 ms 432316 KB Output is correct
75 Correct 1829 ms 437056 KB Output is correct
76 Correct 1291 ms 418332 KB Output is correct
77 Correct 1483 ms 316864 KB Output is correct
78 Correct 1103 ms 287304 KB Output is correct
79 Correct 1049 ms 216364 KB Output is correct
80 Correct 1766 ms 365936 KB Output is correct
81 Correct 1150 ms 303292 KB Output is correct
82 Correct 1405 ms 284616 KB Output is correct
83 Correct 1905 ms 384240 KB Output is correct
84 Correct 1028 ms 273408 KB Output is correct
85 Correct 1743 ms 356284 KB Output is correct
86 Correct 1632 ms 347508 KB Output is correct
87 Correct 828 ms 170508 KB Output is correct
88 Correct 1494 ms 316596 KB Output is correct
89 Correct 1474 ms 316812 KB Output is correct
90 Correct 1499 ms 316756 KB Output is correct