oj.uz

Submission #292560

# Submission time Handle Problem Language Result Execution time Memory
292560 2020-09-07T09:32:48 Z miss_robot Rectangles (IOI19_rect) C++14
50 / 100
 5000 ms 623736 KB 
#include <bits/stdc++.h>
#include "rect.h"

#pragma GCC optimize("O3")

using namespace std;

const int N = 2500, M = 2500, L = 1024;
int n, m;
long long sol;
int f[N][M], dx[]={0,1,0,-1}, dy[]={1,0,-1,0}, up[N][2*L], dwn[N][2*L], lft[M][N], rgt[M][N];

int qry(int a, int b, int t[]){
	a += L, b += L;
	int r = 7e6;
	while(a <= b){
		if(a&1) r = min(r, t[a++]);
		if(!(b&1)) r = min(r, t[b--]);
		a >>= 1, b >>= 1;
	}
	return r;
}

void st1(){
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			for(int k = j+1; k < m; k++){
				if(f[i][k] < f[i][j]) rgt[j][i]++;
				else break;
			}
			for(int k = j-1; k >= 0; k--){
				if(f[i][k] < f[i][j]) lft[j][i]++;
				else break;
			}
			for(int k = i+1; k < n; k++){
				if(f[k][j] < f[i][j]) dwn[i][j+L]++;
				else break;
			}
			for(int k = i-1; k >= 0; k--){
				if(f[k][j] < f[i][j]) up[i][j+L]++;
				else break;
			}
		}
	}
	for(int i = 0; i < n; i++)
		for(int j = L-1; j; j--)
			up[i][j] = min(up[i][j<<1], up[i][(j<<1)|1]),
			dwn[i][j] = min(dwn[i][j<<1], dwn[i][(j<<1)|1]);
	for(int x = 0; x < n-2; x++){
		for(int y = 1; y < m-1; y++){
			for(int Y = y; Y < m-1; Y++){
				int mxlen = qry(y, Y, dwn[x]);
				for(int X = x+1; X-x <= mxlen && X < n-1; X++){
					if(rgt[y-1][X] < Y-y+1 || lft[Y+1][X] < Y-y+1) break;
					if(qry(y, Y, up[X+1]) >= X-x) sol++;
				}
			}
		}
	}
}

void st5(){
	for(int i = 1, mx; i < m-1; i++){
		mx = 0;
		for(int j = i; j < m-1; j++){
			mx = max(mx, f[1][j]);
			if(f[1][j] >= f[1][i-1] || f[1][j] >= f[0][j] || f[1][j] >= f[2][j]) break;
			if(mx < f[1][j+1]) sol++;
		}
	}
}

int vis[N][M];

void flood(int x, int y, int &maxx, int &maxy, int &minx, int &miny, int &c){
	if(x < 0 || y < 0 || x == n || y == m || vis[x][y] || f[x][y]) return;
	c++;
	vis[x][y] = 1;
	maxx = max(maxx, x), minx = min(minx, x);
	maxy = max(maxy, y), miny = min(miny, y);
	for(int k = 0, i, j; k < 4; k++){
		i = x+dx[k], j = y+dy[k];
		flood(i, j, maxx, maxy, minx, miny, c);
	}
}

void st6(){
	for(int i = 1; i < n-1; i++){
		for(int j = 1; j < m-1; j++){
			if(vis[i][j] || f[i][j]) continue;
			int maxx = i, minx = i, maxy = j, miny = j, c = 0;
			flood(i, j, maxx, maxy, minx, miny, c);
			if(minx && miny && maxx < n-1 && maxy < m-1 && c == (maxx-minx+1)*(maxy-miny+1)) sol++;
		}
	}
}

long long count_rectangles(vector< vector<int> > a){
	n = a.size(), m = a[0].size();
	if(n < 3 || m < 3) return 0;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			f[i][j] = a[i][j];
	int s6 = 1;
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			if(f[i][j] > 1) s6 = 0;
	if(n == 3) st5();
	else if(s6) st6();
	else st1();
	return sol;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 12 ms 2432 KB Output is correct
18 Correct 12 ms 2432 KB Output is correct
19 Correct 13 ms 2432 KB Output is correct
20 Correct 8 ms 2752 KB Output is correct
21 Correct 9 ms 2688 KB Output is correct
22 Correct 8 ms 2688 KB Output is correct
23 Correct 8 ms 2688 KB Output is correct
24 Correct 3 ms 2304 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 1 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 12 ms 2432 KB Output is correct
18 Correct 12 ms 2432 KB Output is correct
19 Correct 13 ms 2432 KB Output is correct
20 Correct 8 ms 2752 KB Output is correct
21 Correct 9 ms 2688 KB Output is correct
22 Correct 8 ms 2688 KB Output is correct
23 Correct 8 ms 2688 KB Output is correct
24 Correct 3 ms 2304 KB Output is correct
25 Correct 270 ms 6136 KB Output is correct
26 Correct 270 ms 6136 KB Output is correct
27 Correct 265 ms 6008 KB Output is correct
28 Correct 162 ms 6784 KB Output is correct
29 Correct 163 ms 6912 KB Output is correct
30 Correct 163 ms 7040 KB Output is correct
31 Correct 170 ms 7008 KB Output is correct
32 Correct 160 ms 6912 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 512 KB Output is correct
36 Correct 1 ms 640 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 12 ms 2432 KB Output is correct
18 Correct 12 ms 2432 KB Output is correct
19 Correct 13 ms 2432 KB Output is correct
20 Correct 8 ms 2752 KB Output is correct
21 Correct 9 ms 2688 KB Output is correct
22 Correct 8 ms 2688 KB Output is correct
23 Correct 8 ms 2688 KB Output is correct
24 Correct 3 ms 2304 KB Output is correct
25 Correct 270 ms 6136 KB Output is correct
26 Correct 270 ms 6136 KB Output is correct
27 Correct 265 ms 6008 KB Output is correct
28 Correct 162 ms 6784 KB Output is correct
29 Correct 163 ms 6912 KB Output is correct
30 Correct 163 ms 7040 KB Output is correct
31 Correct 170 ms 7008 KB Output is correct
32 Correct 160 ms 6912 KB Output is correct
33 Execution timed out 5035 ms 29620 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 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 151 ms 50520 KB Output is correct
3 Correct 320 ms 101880 KB Output is correct
4 Correct 319 ms 102264 KB Output is correct
5 Correct 319 ms 102264 KB Output is correct
6 Correct 309 ms 219256 KB Output is correct
7 Correct 627 ms 528304 KB Output is correct
8 Correct 684 ms 623736 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 384 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 1024 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 1152 KB Output is correct
10 Correct 1 ms 1152 KB Output is correct
11 Correct 1 ms 1152 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 12 ms 2432 KB Output is correct
18 Correct 12 ms 2432 KB Output is correct
19 Correct 13 ms 2432 KB Output is correct
20 Correct 8 ms 2752 KB Output is correct
21 Correct 9 ms 2688 KB Output is correct
22 Correct 8 ms 2688 KB Output is correct
23 Correct 8 ms 2688 KB Output is correct
24 Correct 3 ms 2304 KB Output is correct
25 Correct 270 ms 6136 KB Output is correct
26 Correct 270 ms 6136 KB Output is correct
27 Correct 265 ms 6008 KB Output is correct
28 Correct 162 ms 6784 KB Output is correct
29 Correct 163 ms 6912 KB Output is correct
30 Correct 163 ms 7040 KB Output is correct
31 Correct 170 ms 7008 KB Output is correct
32 Correct 160 ms 6912 KB Output is correct
33 Execution timed out 5035 ms 29620 KB Time limit exceeded
34 Halted 0 ms 0 KB -