oj.uz

Submission #422927

# Submission time Handle Problem Language Result Execution time Memory
422927 2021-06-10T14:14:04 Z oleh1421 Rectangles (IOI19_rect) C++17
59 / 100
 3083 ms 146532 KB 
//#include "grader.cpp"
#include "rect.h"
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int n,m;
const int N=2500;
int a[N][N],l[N][N],r[N][N];
int mx[N];
int L[N],R[N];
int x[N],y[N];
int A[N][N];
int s(int x1,int y1,int x2,int y2){
    x1--;
    y1--;
    return A[x2][y2]-A[x1][y2]-A[x2][y1]+A[x1][y1];
}
int d[N][N],rr[N][N];
ll count_rectangles(vector<vector<int> > vv) {
    int Mx=0;
    n=vv.size(),m=vv[0].size();
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            a[i][j]=vv[i-1][j-1];
            A[i][j]=a[i][j]+A[i][j-1];
            Mx=max(Mx,a[i][j]);
        }
        for (int j=1;j<=m;j++) A[i][j]+=A[i-1][j];
    }
    for (int i=1;i<=n;i++){
        rr[i][m+1]=m+1;
        for (int j=m;j>=1;j--){
            if (a[i][j]) rr[i][j]=j;
            else rr[i][j]=rr[i][j+1];
        }
    }
    for (int i=1;i<=m;i++){
        d[n+1][i]=n+1;
        for (int j=n;j>=1;j--){
            if (a[j][i]) d[j][i]=j;
            else d[j][i]=d[j+1][i];
        }
    }
//    Mx=2;
    if (Mx<=1){
        ll res=0ll;
        for (int i=1;i<=n-2;i++){
            for (int j=1;j<=m-2;j++){
                if (a[i+1][j+1]) continue;
                int x=d[i+1][j+1];
                int y=rr[i+1][j+1];
                if (s(i+1,j,x-1,j)==x-i-1 && s(i,j+1,i,y-1)==y-j-1 && s(x,j+1,x,y-1)==y-j-1 && s(i+1,y,x-1,y)==x-i-1 && s(i+1,j+1,x-1,y-1)==0) {
                    res++;
                }
            }
        }


        return res;
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            l[i][j]=0;
            for (int t=j-1;t>=1;t=l[i][t]){
                if (a[i][t]>=a[i][j]){
                    l[i][j]=t;
                    break;
                }
            }
        }
        for (int j=m;j>=1;j--){
            r[i][j]=m+1;
            for (int t=j+1;t<=m;t=r[i][t]){
                if (a[i][t]>=a[i][j]){
                    r[i][j]=t;
                    break;
                }
            }
        }
    }
    ll res=0ll;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++) mx[j]=0,L[j]=1,R[j]=m;
        for (int j=i+2;j<=n;j++){
            for (int t=1;t<=m;t++) {
                mx[t]=max(mx[t],a[j-1][t]);
                L[t]=max(L[t],l[j-1][t]);
                R[t]=min(R[t],r[j-1][t]);
            }
            vector<int>bad;
            bad.push_back(0);
            for (int t=1;t<=m;t++){
                if (mx[t]>=min(a[i][t],a[j][t])) bad.push_back(t);
            }
            bad.push_back(m+1);
            for (int t=1;t<bad.size();t++){
                for (int k=bad[t-1];k<bad[t];k++){
                    y[k]=min(R[k],bad[t]);
                }
                for (int k=bad[t-1]+1;k<=bad[t];k++){
                    x[k]=max(L[k],bad[t-1]);
                }
            }

            for (int t=1;t<=m;t++){
                if (t+2>y[t]) continue;
                if (x[y[t]]<=t) res++;
//                for (int k=t+2;k<y[t];k++){
//                    if (t>=x[k]) res++;
//                }
            }
            for (int t=1;t<=m;t++){
                if (t-2<x[t]) continue;
                if (y[x[t]]>t) res++;
            }
        }
    }
//    x[k]==t
	return res;
}
/**
10 10
1 0 1 0 0 1 1 1 1 0
0 1 0 1 1 1 0 1 1 0
1 1 1 0 1 0 1 1 0 1
0 1 1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 0 1 0
0 1 1 0 1 1 0 1 0 1
1 1 1 1 1 1 1 0 1 1
1 0 0 0 1 1 0 1 0 1
1 1 1 1 1 0 1 1 1 1
1 1 1 1 1 1 1 1 1 1

**/

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:96:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |             for (int t=1;t<bad.size();t++){
      |                          ~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 6 ms 2380 KB Output is correct
18 Correct 7 ms 2484 KB Output is correct
19 Correct 7 ms 2380 KB Output is correct
20 Correct 7 ms 2484 KB Output is correct
21 Correct 8 ms 2380 KB Output is correct
22 Correct 7 ms 2380 KB Output is correct
23 Correct 7 ms 2380 KB Output is correct
24 Correct 5 ms 2380 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 716 KB Output is correct
28 Correct 1 ms 716 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 75 ms 6348 KB Output is correct
31 Correct 73 ms 6348 KB Output is correct
32 Correct 74 ms 6348 KB Output is correct
33 Correct 75 ms 6348 KB Output is correct
34 Correct 77 ms 6348 KB Output is correct
35 Correct 86 ms 6424 KB Output is correct
36 Correct 78 ms 6420 KB Output is correct
37 Correct 88 ms 6348 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 6 ms 2380 KB Output is correct
18 Correct 7 ms 2484 KB Output is correct
19 Correct 7 ms 2380 KB Output is correct
20 Correct 7 ms 2484 KB Output is correct
21 Correct 8 ms 2380 KB Output is correct
22 Correct 7 ms 2380 KB Output is correct
23 Correct 7 ms 2380 KB Output is correct
24 Correct 5 ms 2380 KB Output is correct
25 Correct 75 ms 6348 KB Output is correct
26 Correct 73 ms 6348 KB Output is correct
27 Correct 74 ms 6348 KB Output is correct
28 Correct 75 ms 6348 KB Output is correct
29 Correct 77 ms 6348 KB Output is correct
30 Correct 86 ms 6424 KB Output is correct
31 Correct 78 ms 6420 KB Output is correct
32 Correct 88 ms 6348 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 716 KB Output is correct
36 Correct 1 ms 716 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 3034 ms 32612 KB Output is correct
39 Correct 3039 ms 32608 KB Output is correct
40 Correct 2947 ms 32608 KB Output is correct
41 Correct 2948 ms 32604 KB Output is correct
42 Correct 2971 ms 32604 KB Output is correct
43 Correct 2945 ms 32668 KB Output is correct
44 Correct 2959 ms 32608 KB Output is correct
45 Correct 2649 ms 30476 KB Output is correct
46 Correct 32 ms 22980 KB Output is correct
47 Correct 2984 ms 32608 KB Output is correct
48 Correct 3083 ms 32604 KB Output is correct
49 Correct 3006 ms 32604 KB Output is correct
50 Correct 1598 ms 24900 KB Output is correct
51 Correct 735 ms 16480 KB Output is correct
52 Correct 2952 ms 32604 KB Output is correct
53 Correct 3002 ms 32608 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 158 ms 71072 KB Output is correct
8 Incorrect 373 ms 146532 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 6 ms 2380 KB Output is correct
18 Correct 7 ms 2484 KB Output is correct
19 Correct 7 ms 2380 KB Output is correct
20 Correct 7 ms 2484 KB Output is correct
21 Correct 8 ms 2380 KB Output is correct
22 Correct 7 ms 2380 KB Output is correct
23 Correct 7 ms 2380 KB Output is correct
24 Correct 5 ms 2380 KB Output is correct
25 Correct 75 ms 6348 KB Output is correct
26 Correct 73 ms 6348 KB Output is correct
27 Correct 74 ms 6348 KB Output is correct
28 Correct 75 ms 6348 KB Output is correct
29 Correct 77 ms 6348 KB Output is correct
30 Correct 86 ms 6424 KB Output is correct
31 Correct 78 ms 6420 KB Output is correct
32 Correct 88 ms 6348 KB Output is correct
33 Correct 3034 ms 32612 KB Output is correct
34 Correct 3039 ms 32608 KB Output is correct
35 Correct 2947 ms 32608 KB Output is correct
36 Correct 2948 ms 32604 KB Output is correct
37 Correct 2971 ms 32604 KB Output is correct
38 Correct 2945 ms 32668 KB Output is correct
39 Correct 2959 ms 32608 KB Output is correct
40 Correct 2649 ms 30476 KB Output is correct
41 Correct 32 ms 22980 KB Output is correct
42 Correct 2984 ms 32608 KB Output is correct
43 Correct 3083 ms 32604 KB Output is correct
44 Correct 3006 ms 32604 KB Output is correct
45 Correct 1598 ms 24900 KB Output is correct
46 Correct 735 ms 16480 KB Output is correct
47 Correct 2952 ms 32604 KB Output is correct
48 Correct 3002 ms 32608 KB Output is correct
49 Correct 1 ms 588 KB Output is correct
50 Correct 1 ms 588 KB Output is correct
51 Correct 1 ms 460 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 588 KB Output is correct
54 Correct 2 ms 588 KB Output is correct
55 Correct 1 ms 588 KB Output is correct
56 Correct 1 ms 588 KB Output is correct
57 Correct 1 ms 588 KB Output is correct
58 Correct 1 ms 460 KB Output is correct
59 Correct 1 ms 460 KB Output is correct
60 Correct 1 ms 460 KB Output is correct
61 Correct 158 ms 71072 KB Output is correct
62 Incorrect 373 ms 146532 KB Output isn't correct
63 Halted 0 ms 0 KB -