oj.uz

Submission #867089

# Submission time Handle Problem Language Result Execution time Memory
867089 2023-10-27T16:43:40 Z abcvuitunggio Rectangles (IOI19_rect) C++17
100 / 100
 1403 ms 723748 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
int n,m,l[2501][2501],r[2501][2501],u[2501][2501],d[2501][2501],cnt,nxt[2501][2501][4];
stack <pair <int, int>> st;
vector <pair <pair <int, int>, pair <int, int>>> ve;
long long count_rectangles(vector <vector <int>> a){
    n=a.size(),m=a[0].size();
    for (int i=0;i<n;i++){
        while (!st.empty())
            st.pop();
        for (int j=0;j<m;j++){
            while (!st.empty()&&st.top().first<a[i][j])
                st.pop();
            l[i][j]=(st.empty()?-1:st.top().second);
            st.push({a[i][j],j});
        }
        while (!st.empty())
            st.pop();
        for (int j=m-1;j>=0;j--){
            while (!st.empty()&&st.top().first<a[i][j])
                st.pop();
            r[i][j]=(st.empty()||st.top().first==a[i][j]?-1:st.top().second);
            st.push({a[i][j],j});
        }
    }
    for (int j=0;j<m;j++){
        while (!st.empty())
            st.pop();
        for (int i=0;i<n;i++){
            while (!st.empty()&&st.top().first<a[i][j])
                st.pop();
            u[i][j]=(st.empty()?-1:st.top().second);
            st.push({a[i][j],i});
        }
        while (!st.empty())
            st.pop();
        for (int i=n-1;i>=0;i--){
            while (!st.empty()&&st.top().first<a[i][j])
                st.pop();
            d[i][j]=(st.empty()||st.top().first==a[i][j]?-1:st.top().second);
            st.push({a[i][j],i});
        }
    }
    for (int i=1;i<n-1;i++)
        for (int j=1;j<m-1;j++){
            int r1,c1,r2,c2;
            r1=u[i+1][j];
            c1=j-1;
            r2=i+1;
            if (r1!=-1)
                c2=r[r1+1][c1];
            if (r1!=-1&&c2!=-1)
                ve.push_back({{r1,r2},{c1,c2}});
            c2=j+1;
            if (r1!=-1)
                c1=l[r1+1][c2];
            if (r1!=-1&&c1!=-1)
                ve.push_back({{r1,r2},{c1,c2}});
            r1=i-1;
            c1=j-1;
            r2=d[r1][c1+1];
            c2=r[r1+1][c1];
            if (r2!=-1&&c2!=-1)
                ve.push_back({{r1,r2},{c1,c2}});
            c2=j+1;
            r2=d[r1][c2-1];
            c1=l[r1+1][c2];
            if (r2!=-1&&c1!=-1)
                ve.push_back({{r1,r2},{c1,c2}});
        }
    memset(nxt,-1,sizeof(nxt));
    for (int i=n-1;i>=0;i--)
        for (int j=m-1;j>=0;j--){
            int k=l[i][j];
            if (k!=-1){
                nxt[i][j][0]=i;
                if (i<n-1){
                    if (r[i+1][k]==j)
                        nxt[i][j][0]=nxt[i+1][k][1];
                    else if (l[i+1][j]==k)
                        nxt[i][j][0]=nxt[i+1][j][0];
                }
            }
            k=r[i][j];
            if (k!=-1){
                nxt[i][j][1]=i;
                if (i<n-1){
                    if (l[i+1][k]==j)
                        nxt[i][j][1]=nxt[i+1][k][0];
                    else if (r[i+1][j]==k)
                        nxt[i][j][1]=nxt[i+1][j][1];
                }
            }
        }
    for (int j=m-1;j>=0;j--)
        for (int i=n-1;i>=0;i--){
            int k=u[i][j];
            if (k!=-1){
                nxt[i][j][2]=j;
                if (j<m-1){
                    if (d[k][j+1]==i)
                        nxt[i][j][2]=nxt[k][j+1][3];
                    else if (u[i][j+1]==k)
                        nxt[i][j][2]=nxt[i][j+1][2];
                }
            }
            k=d[i][j];
            if (k!=-1){
                nxt[i][j][3]=j;
                if (j<m-1){
                    if (u[k][j+1]==i)
                        nxt[i][j][3]=nxt[k][j+1][2];
                    else if (d[i][j+1]==k)
                        nxt[i][j][3]=nxt[i][j+1][3];
                }
            }
        }
    for (auto [p,q]:ve){
        auto [r1,r2]=p;
        auto [c1,c2]=q;
        cnt+=(r2-r1>1&&c2-c1>1&&((u[r2][c1+1]==r1&&nxt[r2][c1+1][2]>=c2-1)||(d[r1][c1+1]==r2&&nxt[r1][c1+1][3]>=c2-1))&&((l[r1+1][c2]==c1&&nxt[r1+1][c2][0]>=r2-1)||(r[r1+1][c1]==c2&&nxt[r1+1][c1][1]>=r2-1)));
    }
	return cnt;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 105052 KB Output is correct
2 Correct 12 ms 105308 KB Output is correct
3 Correct 12 ms 105308 KB Output is correct
4 Correct 12 ms 105308 KB Output is correct
5 Correct 12 ms 105200 KB Output is correct
6 Correct 12 ms 105308 KB Output is correct
7 Correct 12 ms 105300 KB Output is correct
8 Correct 12 ms 105052 KB Output is correct
9 Correct 12 ms 105304 KB Output is correct
10 Correct 12 ms 105308 KB Output is correct
11 Correct 12 ms 105304 KB Output is correct
12 Correct 12 ms 105308 KB Output is correct
13 Correct 12 ms 105144 KB Output is correct
14 Correct 12 ms 105052 KB Output is correct
15 Correct 13 ms 105248 KB Output is correct
16 Correct 11 ms 105052 KB Output is correct
17 Correct 13 ms 105052 KB Output is correct
18 Correct 12 ms 105116 KB Output is correct
19 Correct 12 ms 105308 KB Output is correct
20 Correct 12 ms 105052 KB Output is correct
21 Correct 12 ms 105052 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 105052 KB Output is correct
2 Correct 12 ms 105308 KB Output is correct
3 Correct 12 ms 105308 KB Output is correct
4 Correct 12 ms 105308 KB Output is correct
5 Correct 12 ms 105200 KB Output is correct
6 Correct 12 ms 105308 KB Output is correct
7 Correct 12 ms 105300 KB Output is correct
8 Correct 12 ms 105052 KB Output is correct
9 Correct 12 ms 105304 KB Output is correct
10 Correct 12 ms 105308 KB Output is correct
11 Correct 12 ms 105304 KB Output is correct
12 Correct 12 ms 105308 KB Output is correct
13 Correct 12 ms 105144 KB Output is correct
14 Correct 12 ms 105052 KB Output is correct
15 Correct 13 ms 105248 KB Output is correct
16 Correct 11 ms 105052 KB Output is correct
17 Correct 13 ms 105052 KB Output is correct
18 Correct 12 ms 105116 KB Output is correct
19 Correct 12 ms 105308 KB Output is correct
20 Correct 12 ms 105052 KB Output is correct
21 Correct 12 ms 105052 KB Output is correct
22 Correct 13 ms 107728 KB Output is correct
23 Correct 14 ms 107892 KB Output is correct
24 Correct 13 ms 107728 KB Output is correct
25 Correct 13 ms 107476 KB Output is correct
26 Correct 13 ms 107732 KB Output is correct
27 Correct 13 ms 107732 KB Output is correct
28 Correct 14 ms 107732 KB Output is correct
29 Correct 13 ms 107476 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 105052 KB Output is correct
2 Correct 12 ms 105308 KB Output is correct
3 Correct 12 ms 105308 KB Output is correct
4 Correct 12 ms 105308 KB Output is correct
5 Correct 12 ms 105200 KB Output is correct
6 Correct 12 ms 105308 KB Output is correct
7 Correct 12 ms 105300 KB Output is correct
8 Correct 12 ms 105052 KB Output is correct
9 Correct 12 ms 105304 KB Output is correct
10 Correct 12 ms 105308 KB Output is correct
11 Correct 12 ms 105304 KB Output is correct
12 Correct 12 ms 105308 KB Output is correct
13 Correct 12 ms 105144 KB Output is correct
14 Correct 12 ms 105052 KB Output is correct
15 Correct 13 ms 105248 KB Output is correct
16 Correct 11 ms 105052 KB Output is correct
17 Correct 13 ms 107728 KB Output is correct
18 Correct 14 ms 107892 KB Output is correct
19 Correct 13 ms 107728 KB Output is correct
20 Correct 13 ms 107476 KB Output is correct
21 Correct 13 ms 107732 KB Output is correct
22 Correct 13 ms 107732 KB Output is correct
23 Correct 14 ms 107732 KB Output is correct
24 Correct 13 ms 107476 KB Output is correct
25 Correct 13 ms 105052 KB Output is correct
26 Correct 12 ms 105116 KB Output is correct
27 Correct 12 ms 105308 KB Output is correct
28 Correct 12 ms 105052 KB Output is correct
29 Correct 12 ms 105052 KB Output is correct
30 Correct 21 ms 116940 KB Output is correct
31 Correct 20 ms 117708 KB Output is correct
32 Correct 20 ms 118076 KB Output is correct
33 Correct 18 ms 115148 KB Output is correct
34 Correct 21 ms 116676 KB Output is correct
35 Correct 22 ms 116416 KB Output is correct
36 Correct 21 ms 116428 KB Output is correct
37 Correct 22 ms 117996 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 105052 KB Output is correct
2 Correct 12 ms 105308 KB Output is correct
3 Correct 12 ms 105308 KB Output is correct
4 Correct 12 ms 105308 KB Output is correct
5 Correct 12 ms 105200 KB Output is correct
6 Correct 12 ms 105308 KB Output is correct
7 Correct 12 ms 105300 KB Output is correct
8 Correct 12 ms 105052 KB Output is correct
9 Correct 12 ms 105304 KB Output is correct
10 Correct 12 ms 105308 KB Output is correct
11 Correct 12 ms 105304 KB Output is correct
12 Correct 12 ms 105308 KB Output is correct
13 Correct 12 ms 105144 KB Output is correct
14 Correct 12 ms 105052 KB Output is correct
15 Correct 13 ms 105248 KB Output is correct
16 Correct 11 ms 105052 KB Output is correct
17 Correct 13 ms 107728 KB Output is correct
18 Correct 14 ms 107892 KB Output is correct
19 Correct 13 ms 107728 KB Output is correct
20 Correct 13 ms 107476 KB Output is correct
21 Correct 13 ms 107732 KB Output is correct
22 Correct 13 ms 107732 KB Output is correct
23 Correct 14 ms 107732 KB Output is correct
24 Correct 13 ms 107476 KB Output is correct
25 Correct 21 ms 116940 KB Output is correct
26 Correct 20 ms 117708 KB Output is correct
27 Correct 20 ms 118076 KB Output is correct
28 Correct 18 ms 115148 KB Output is correct
29 Correct 21 ms 116676 KB Output is correct
30 Correct 22 ms 116416 KB Output is correct
31 Correct 21 ms 116428 KB Output is correct
32 Correct 22 ms 117996 KB Output is correct
33 Correct 13 ms 105052 KB Output is correct
34 Correct 12 ms 105116 KB Output is correct
35 Correct 12 ms 105308 KB Output is correct
36 Correct 12 ms 105052 KB Output is correct
37 Correct 12 ms 105052 KB Output is correct
38 Correct 71 ms 152988 KB Output is correct
39 Correct 72 ms 153004 KB Output is correct
40 Correct 71 ms 152756 KB Output is correct
41 Correct 69 ms 152048 KB Output is correct
42 Correct 85 ms 167820 KB Output is correct
43 Correct 85 ms 168352 KB Output is correct
44 Correct 89 ms 168360 KB Output is correct
45 Correct 85 ms 167428 KB Output is correct
46 Correct 74 ms 146860 KB Output is correct
47 Correct 81 ms 150452 KB Output is correct
48 Correct 109 ms 166760 KB Output is correct
49 Correct 115 ms 169092 KB Output is correct
50 Correct 66 ms 148652 KB Output is correct
51 Correct 62 ms 140988 KB Output is correct
52 Correct 105 ms 164772 KB Output is correct
53 Correct 110 ms 167612 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 105560 KB Output is correct
2 Correct 13 ms 105564 KB Output is correct
3 Correct 12 ms 105372 KB Output is correct
4 Correct 12 ms 105052 KB Output is correct
5 Correct 13 ms 105560 KB Output is correct
6 Correct 13 ms 105564 KB Output is correct
7 Correct 13 ms 105596 KB Output is correct
8 Correct 12 ms 105572 KB Output is correct
9 Correct 13 ms 105560 KB Output is correct
10 Correct 12 ms 105308 KB Output is correct
11 Correct 13 ms 105160 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 105052 KB Output is correct
2 Correct 12 ms 105116 KB Output is correct
3 Correct 12 ms 105308 KB Output is correct
4 Correct 12 ms 105052 KB Output is correct
5 Correct 12 ms 105052 KB Output is correct
6 Correct 12 ms 105052 KB Output is correct
7 Correct 363 ms 251540 KB Output is correct
8 Correct 800 ms 424272 KB Output is correct
9 Correct 801 ms 425360 KB Output is correct
10 Correct 796 ms 424868 KB Output is correct
11 Correct 276 ms 233120 KB Output is correct
12 Correct 538 ms 346420 KB Output is correct
13 Correct 568 ms 356156 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 105052 KB Output is correct
2 Correct 12 ms 105308 KB Output is correct
3 Correct 12 ms 105308 KB Output is correct
4 Correct 12 ms 105308 KB Output is correct
5 Correct 12 ms 105200 KB Output is correct
6 Correct 12 ms 105308 KB Output is correct
7 Correct 12 ms 105300 KB Output is correct
8 Correct 12 ms 105052 KB Output is correct
9 Correct 12 ms 105304 KB Output is correct
10 Correct 12 ms 105308 KB Output is correct
11 Correct 12 ms 105304 KB Output is correct
12 Correct 12 ms 105308 KB Output is correct
13 Correct 12 ms 105144 KB Output is correct
14 Correct 12 ms 105052 KB Output is correct
15 Correct 13 ms 105248 KB Output is correct
16 Correct 11 ms 105052 KB Output is correct
17 Correct 13 ms 107728 KB Output is correct
18 Correct 14 ms 107892 KB Output is correct
19 Correct 13 ms 107728 KB Output is correct
20 Correct 13 ms 107476 KB Output is correct
21 Correct 13 ms 107732 KB Output is correct
22 Correct 13 ms 107732 KB Output is correct
23 Correct 14 ms 107732 KB Output is correct
24 Correct 13 ms 107476 KB Output is correct
25 Correct 21 ms 116940 KB Output is correct
26 Correct 20 ms 117708 KB Output is correct
27 Correct 20 ms 118076 KB Output is correct
28 Correct 18 ms 115148 KB Output is correct
29 Correct 21 ms 116676 KB Output is correct
30 Correct 22 ms 116416 KB Output is correct
31 Correct 21 ms 116428 KB Output is correct
32 Correct 22 ms 117996 KB Output is correct
33 Correct 71 ms 152988 KB Output is correct
34 Correct 72 ms 153004 KB Output is correct
35 Correct 71 ms 152756 KB Output is correct
36 Correct 69 ms 152048 KB Output is correct
37 Correct 85 ms 167820 KB Output is correct
38 Correct 85 ms 168352 KB Output is correct
39 Correct 89 ms 168360 KB Output is correct
40 Correct 85 ms 167428 KB Output is correct
41 Correct 74 ms 146860 KB Output is correct
42 Correct 81 ms 150452 KB Output is correct
43 Correct 109 ms 166760 KB Output is correct
44 Correct 115 ms 169092 KB Output is correct
45 Correct 66 ms 148652 KB Output is correct
46 Correct 62 ms 140988 KB Output is correct
47 Correct 105 ms 164772 KB Output is correct
48 Correct 110 ms 167612 KB Output is correct
49 Correct 13 ms 105560 KB Output is correct
50 Correct 13 ms 105564 KB Output is correct
51 Correct 12 ms 105372 KB Output is correct
52 Correct 12 ms 105052 KB Output is correct
53 Correct 13 ms 105560 KB Output is correct
54 Correct 13 ms 105564 KB Output is correct
55 Correct 13 ms 105596 KB Output is correct
56 Correct 12 ms 105572 KB Output is correct
57 Correct 13 ms 105560 KB Output is correct
58 Correct 12 ms 105308 KB Output is correct
59 Correct 13 ms 105160 KB Output is correct
60 Correct 12 ms 105052 KB Output is correct
61 Correct 363 ms 251540 KB Output is correct
62 Correct 800 ms 424272 KB Output is correct
63 Correct 801 ms 425360 KB Output is correct
64 Correct 796 ms 424868 KB Output is correct
65 Correct 276 ms 233120 KB Output is correct
66 Correct 538 ms 346420 KB Output is correct
67 Correct 568 ms 356156 KB Output is correct
68 Correct 13 ms 105052 KB Output is correct
69 Correct 12 ms 105116 KB Output is correct
70 Correct 12 ms 105308 KB Output is correct
71 Correct 12 ms 105052 KB Output is correct
72 Correct 12 ms 105052 KB Output is correct
73 Correct 807 ms 488220 KB Output is correct
74 Correct 755 ms 488576 KB Output is correct
75 Correct 879 ms 487692 KB Output is correct
76 Correct 799 ms 488000 KB Output is correct
77 Correct 1072 ms 722776 KB Output is correct
78 Correct 766 ms 435392 KB Output is correct
79 Correct 817 ms 494464 KB Output is correct
80 Correct 1320 ms 698056 KB Output is correct
81 Correct 824 ms 455060 KB Output is correct
82 Correct 1129 ms 703072 KB Output is correct
83 Correct 1403 ms 723516 KB Output is correct
84 Correct 767 ms 433516 KB Output is correct
85 Correct 1361 ms 723244 KB Output is correct
86 Correct 1311 ms 719928 KB Output is correct
87 Correct 601 ms 489136 KB Output is correct
88 Correct 999 ms 723484 KB Output is correct
89 Correct 1094 ms 723256 KB Output is correct
90 Correct 987 ms 723748 KB Output is correct