oj.uz

Submission #618756

# Submission time Handle Problem Language Result Execution time Memory
618756 2022-08-02T07:16:29 Z chirathnirodha Rectangles (IOI19_rect) C++17
50 / 100
 5000 ms 67716 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
#define P push
#define MP make_pair
#define F first 
#define S second
typedef long long ll;
 
long long count_rectangles(vector<vector<int> > a) {
	int n=a.size();
	int m=a[0].size();
	int maxi=-1;
	for(int i=0;i<n;i++)for(int j=0;j<m;j++)maxi=max(maxi,a[i][j]);
	ll ans=0;
	if(maxi<2){
		bool flood[n][m];memset(flood,false,sizeof(flood));
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				if(flood[i][j] || a[i][j]!=0)continue;

				flood[i][j]=true;
				queue<pair<int,int> > q;q.P(MP(i,j));

				int up,down,left,right;
				up=left=3000;
				down=right=-1;

				int co=0;
				while(!q.empty()){
					int c=q.front().F,d=q.front().S;q.pop();
					up=min(up,c);down=max(down,c);
					left=min(left,d);right=max(right,d);
					co++;

					if(d<m-1 && a[c][d+1]==0 && !flood[c][d+1]){
						flood[c][d+1]=true;
						q.P(MP(c,d+1));
					}
					if(d>0 && a[c][d-1]==0 && !flood[c][d-1]){
						flood[c][d-1]=true;
						q.P(MP(c,d-1));
					}
					if(c<n-1 && a[c+1][d]==0 && !flood[c+1][d]){
						flood[c+1][d]=true;
						q.P(MP(c+1,d));
					}
					if(c>0 && a[c-1][d]==0 && !flood[c-1][d]){
						flood[c-1][d]=true;
						q.P(MP(c-1,d));
					}
				}
				if(up==0 || down==n-1 || left==0 || right==m-1)continue;
				if(co==(down-up+1)*(right-left+1))ans++;
			}
		}
		return ans;
	}
 
	for(int i=0;i<n;i++){
		int colmax[m];memset(colmax,-1,sizeof(colmax));
		bool colvalid[m];memset(colvalid,false,sizeof(colvalid));
		for(int j=i+2;j<n;j++){
			for(int k=0;k<m;k++){
				colmax[k]=max(colmax[k],a[j-1][k]);
				if(colmax[k]>=a[i][k] || colmax[k]>=a[j][k])colvalid[k]=false;
				else colvalid[k]=true;
			}
			for(int k=0;k<m;k++){
				int rowmax[n];memset(rowmax,-1,sizeof(rowmax));
				for(int l=k+2;l<m;l++){
					if(colvalid[l-1]==false)break;
					bool ok=true;
					for(int p=i+1;p<=j-1;p++){
						rowmax[p]=max(rowmax[p],a[p][l-1]);
						if(rowmax[p]>=a[p][k] || rowmax[p]>=a[p][l])ok=false;
					}
					if(ok)ans++;
				}
			}
		}
	}
	return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 244 KB Output is correct
22 Correct 18 ms 384 KB Output is correct
23 Correct 18 ms 396 KB Output is correct
24 Correct 17 ms 304 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 6 ms 312 KB Output is correct
27 Correct 7 ms 360 KB Output is correct
28 Correct 4 ms 308 KB Output is correct
29 Correct 2 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 18 ms 384 KB Output is correct
18 Correct 18 ms 396 KB Output is correct
19 Correct 17 ms 304 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 6 ms 312 KB Output is correct
22 Correct 7 ms 360 KB Output is correct
23 Correct 4 ms 308 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 244 KB Output is correct
30 Correct 761 ms 824 KB Output is correct
31 Correct 857 ms 824 KB Output is correct
32 Correct 779 ms 860 KB Output is correct
33 Correct 107 ms 680 KB Output is correct
34 Correct 99 ms 752 KB Output is correct
35 Correct 107 ms 852 KB Output is correct
36 Correct 119 ms 856 KB Output is correct
37 Correct 131 ms 852 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 18 ms 384 KB Output is correct
18 Correct 18 ms 396 KB Output is correct
19 Correct 17 ms 304 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 6 ms 312 KB Output is correct
22 Correct 7 ms 360 KB Output is correct
23 Correct 4 ms 308 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 761 ms 824 KB Output is correct
26 Correct 857 ms 824 KB Output is correct
27 Correct 779 ms 860 KB Output is correct
28 Correct 107 ms 680 KB Output is correct
29 Correct 99 ms 752 KB Output is correct
30 Correct 107 ms 852 KB Output is correct
31 Correct 119 ms 856 KB Output is correct
32 Correct 131 ms 852 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 1 ms 244 KB Output is correct
38 Execution timed out 5083 ms 4412 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 340 KB Output is correct
2 Correct 12 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 244 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 117 ms 25716 KB Output is correct
8 Correct 263 ms 67360 KB Output is correct
9 Correct 270 ms 67708 KB Output is correct
10 Correct 269 ms 67716 KB Output is correct
11 Correct 116 ms 33620 KB Output is correct
12 Correct 243 ms 63668 KB Output is correct
13 Correct 290 ms 67660 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 18 ms 384 KB Output is correct
18 Correct 18 ms 396 KB Output is correct
19 Correct 17 ms 304 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 6 ms 312 KB Output is correct
22 Correct 7 ms 360 KB Output is correct
23 Correct 4 ms 308 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 761 ms 824 KB Output is correct
26 Correct 857 ms 824 KB Output is correct
27 Correct 779 ms 860 KB Output is correct
28 Correct 107 ms 680 KB Output is correct
29 Correct 99 ms 752 KB Output is correct
30 Correct 107 ms 852 KB Output is correct
31 Correct 119 ms 856 KB Output is correct
32 Correct 131 ms 852 KB Output is correct
33 Execution timed out 5083 ms 4412 KB Time limit exceeded
34 Halted 0 ms 0 KB -