oj.uz

Submission #295423

# Submission time Handle Problem Language Result Execution time Memory
295423 2020-09-09T16:35:43 Z humbertoyusta Rectangles (IOI19_rect) C++14
50 / 100
 2134 ms 605648 KB 
#include "rect.h"
#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
//#define int long long
#define maxn 2505
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define ll long long
#define ii pair<int,int>

int vx[202][202][202], vy[202][202][202];
map<pair<ii,ii>,bool> mp;
ll ans;
int valid[maxn][maxn], valend[maxn][maxn], mnx, mny, mxx, mxy, cnt;
bool valbgn[maxn][maxn], mk[maxn][maxn];
int n, m, A[maxn][maxn];

void dfs(int i,int j){
    mnx = min( mnx , i );
    mxx = max( mxx , i );
    mny = min( mny , j );
    mxy = max( mxy , j );
    cnt++;
    mk[i][j] = 1;
    if( i + 1 <= n - 1 && A[i+1][j] == 0 && !mk[i+1][j] ) dfs(i+1,j);
    if( i - 1 >= 0 && A[i-1][j] == 0 && !mk[i-1][j] ) dfs(i-1,j);
    if( j + 1 <= m - 1 && A[i][j+1] == 0 && !mk[i][j+1] ) dfs(i,j+1);
    if( j - 1 >= 0 && A[i][j-1] == 0 && !mk[i][j-1] ) dfs(i,j-1);
}

ll f(int x){
    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++)
            valid[i][j] = valend[i][j] = valbgn[i][j] = 0;
    for(int i=1; i<n-1; i++){
        int mx = A[i][x];
        valend[i][x-1] = 1 + i;
        valbgn[i][x-1] = 1;
        for(int j=x; j<m-1; j++){
            if( A[i][j] > mx ) mx = A[i][j];
            valid[i][j] = ( mx < A[i][x-1] && mx < A[i][j+1] );
            valend[i][j] = ( ( ( valend[i][j-1] - valend[i-1][j-1] ) != 0 ) && A[i][j] < A[i-1][j] );
            valbgn[i][j] = ( valbgn[i][j-1] && A[i][j] < A[i+1][j] );

            if( valid[i][j] ) valid[i][j] += valid[i-1][j];
            valend[i][j] += valend[i-1][j];
        }
    }
    ll res = 0;
    for(int j=x; j<m-1; j++){
        for(int i=1; i<n-1; i++){
            if( valbgn[i][j] ){
                int k = i - valid[i][j];
                res += valend[i][j] - valend[k][j];
                //if( valend[i][j] - valend[k][j] ){
                //    db(x)db(j)
                //    db(i)db(k)
                //    db(valend[i][j] - valend[k][j])
                //}
            }
        }
    }
    return res;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	n = a.size();
	m = a[0].size();
	int maximum = 0;
	for(int i=0; i<n; i++)
        for(int j=0; j<m; j++){
            A[i][j] = a[i][j];
            maximum = max( maximum , A[i][j] );
        }
    if( maximum <= 1 ){
        for(int i=1; i<n-1; i++)
            for(int j=1; j<m-1; j++)
                if( !mk[i][j] && A[i][j] == 0 ){
                    mnx = i;
                    mxx = i;
                    mny = j;
                    mxy = j;
                    cnt = 0;
                    dfs(i,j);
                    if( ( mxx - mnx + 1 ) * ( mxy - mny + 1 ) == cnt ){
                        if( mnx >= 1 && mxx <= n - 2 && mny >= 1 && mxy <= m - 2 ){
                            ans ++;
                        }
                    }
                }
    }
    else{
        if( n <= 200 && m <= 200 ){

            for(int i=1; i<n-1; i++){
                for(int j=1; j<m-1; j++){
                    int mx = A[i][j];
                    for(int k=j; k<m-1; k++){
                        if( A[i][k] > mx ) mx = A[i][k];
                        vx[i][j][k] = ( mx < A[i][j-1] && mx < A[i][k+1] );
                        if( vx[i][j][k] ){ vx[i][j][k] = vx[i][j][k] + vx[i-1][j][k]; }
                    }
                }
            }

            for(int i=1; i<m-1; i++){
                for(int j=1; j<n-1; j++){
                    int mx = A[j][i];
                    for(int k=j; k<n-1; k++){
                        if( A[k][i] > mx ) mx = A[k][i];
                        vy[i][j][k] = ( mx < A[j-1][i] && mx < A[k+1][i] );
                        if( vy[i][j][k] )
                            vy[i][j][k] += vy[i-1][j][k];
                    }
                }
            }

            for(int i=1; i<n-1; i++){
                for(int j=i; j<n-1; j++){
                    for(int k=1; k<m-1; k++){
                        for(int l=k; l<m-1; l++){
                            if( j - vx[j][k][l] < i && l - vy[l][i][j] < k ){
                                ans ++;
                            }
                        }
                    }
                }
            }

        }
        else{
            for(int i=1; i<m-1; i++)
                ans += f(i);
        }
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 672 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 416 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 672 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 26 ms 10880 KB Output is correct
18 Correct 27 ms 11008 KB Output is correct
19 Correct 26 ms 11008 KB Output is correct
20 Correct 26 ms 10880 KB Output is correct
21 Correct 26 ms 10752 KB Output is correct
22 Correct 26 ms 10872 KB Output is correct
23 Correct 27 ms 11000 KB Output is correct
24 Correct 9 ms 5760 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 416 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 672 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 26 ms 10880 KB Output is correct
18 Correct 27 ms 11008 KB Output is correct
19 Correct 26 ms 11008 KB Output is correct
20 Correct 26 ms 10880 KB Output is correct
21 Correct 26 ms 10752 KB Output is correct
22 Correct 26 ms 10872 KB Output is correct
23 Correct 27 ms 11000 KB Output is correct
24 Correct 9 ms 5760 KB Output is correct
25 Correct 845 ms 64984 KB Output is correct
26 Correct 848 ms 64984 KB Output is correct
27 Correct 831 ms 65016 KB Output is correct
28 Correct 825 ms 65016 KB Output is correct
29 Correct 840 ms 65016 KB Output is correct
30 Correct 843 ms 65016 KB Output is correct
31 Correct 835 ms 65016 KB Output is correct
32 Correct 811 ms 64376 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 416 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 672 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 26 ms 10880 KB Output is correct
18 Correct 27 ms 11008 KB Output is correct
19 Correct 26 ms 11008 KB Output is correct
20 Correct 26 ms 10880 KB Output is correct
21 Correct 26 ms 10752 KB Output is correct
22 Correct 26 ms 10872 KB Output is correct
23 Correct 27 ms 11000 KB Output is correct
24 Correct 9 ms 5760 KB Output is correct
25 Correct 845 ms 64984 KB Output is correct
26 Correct 848 ms 64984 KB Output is correct
27 Correct 831 ms 65016 KB Output is correct
28 Correct 825 ms 65016 KB Output is correct
29 Correct 840 ms 65016 KB Output is correct
30 Correct 843 ms 65016 KB Output is correct
31 Correct 835 ms 65016 KB Output is correct
32 Correct 811 ms 64376 KB Output is correct
33 Correct 1967 ms 20344 KB Output is correct
34 Correct 2056 ms 20276 KB Output is correct
35 Correct 2016 ms 20344 KB Output is correct
36 Correct 2134 ms 20276 KB Output is correct
37 Correct 1532 ms 20344 KB Output is correct
38 Correct 1514 ms 20344 KB Output is correct
39 Correct 1585 ms 20472 KB Output is correct
40 Correct 1408 ms 19112 KB Output is correct
41 Correct 23 ms 10880 KB Output is correct
42 Incorrect 1511 ms 20444 KB Output isn't correct
43 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 512 KB Output is correct
2 Correct 21 ms 512 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 24 ms 512 KB Output is correct
6 Correct 24 ms 612 KB Output is correct
7 Correct 24 ms 512 KB Output is correct
8 Correct 24 ms 512 KB Output is correct
9 Correct 24 ms 512 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 14 ms 512 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 107 ms 38136 KB Output is correct
3 Correct 232 ms 79864 KB Output is correct
4 Correct 239 ms 80248 KB Output is correct
5 Correct 233 ms 80248 KB Output is correct
6 Correct 280 ms 208888 KB Output is correct
7 Correct 686 ms 508448 KB Output is correct
8 Correct 767 ms 605648 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 416 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 1920 KB Output is correct
3 Correct 2 ms 1920 KB Output is correct
4 Correct 2 ms 1920 KB Output is correct
5 Correct 1 ms 672 KB Output is correct
6 Correct 2 ms 1920 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1920 KB Output is correct
10 Correct 2 ms 1920 KB Output is correct
11 Correct 2 ms 1920 KB Output is correct
12 Correct 2 ms 1920 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 26 ms 10880 KB Output is correct
18 Correct 27 ms 11008 KB Output is correct
19 Correct 26 ms 11008 KB Output is correct
20 Correct 26 ms 10880 KB Output is correct
21 Correct 26 ms 10752 KB Output is correct
22 Correct 26 ms 10872 KB Output is correct
23 Correct 27 ms 11000 KB Output is correct
24 Correct 9 ms 5760 KB Output is correct
25 Correct 845 ms 64984 KB Output is correct
26 Correct 848 ms 64984 KB Output is correct
27 Correct 831 ms 65016 KB Output is correct
28 Correct 825 ms 65016 KB Output is correct
29 Correct 840 ms 65016 KB Output is correct
30 Correct 843 ms 65016 KB Output is correct
31 Correct 835 ms 65016 KB Output is correct
32 Correct 811 ms 64376 KB Output is correct
33 Correct 1967 ms 20344 KB Output is correct
34 Correct 2056 ms 20276 KB Output is correct
35 Correct 2016 ms 20344 KB Output is correct
36 Correct 2134 ms 20276 KB Output is correct
37 Correct 1532 ms 20344 KB Output is correct
38 Correct 1514 ms 20344 KB Output is correct
39 Correct 1585 ms 20472 KB Output is correct
40 Correct 1408 ms 19112 KB Output is correct
41 Correct 23 ms 10880 KB Output is correct
42 Incorrect 1511 ms 20444 KB Output isn't correct
43 Halted 0 ms 0 KB -