oj.uz

Submission #143547

# Submission time Handle Problem Language Result Execution time Memory
143547 2019-08-14T14:30:56 Z haojiandan Rectangles (IOI19_rect) C++14
72 / 100
 3325 ms 563624 KB 
#include "rect.h"

#include<bits/stdc++.h>

using namespace std;


typedef long long ll;
const int maxn=2510;
int n,m,d[maxn][maxn];
int top,st[maxn],N;
ll ans;
int shang[maxn][maxn];
int xia[maxn][maxn];
int zuo[maxn][maxn];
int you[maxn][maxn];
int Y[maxn][maxn]; // you: shang to the min
int Z[maxn][maxn]; // zuo: shang to the min
int X[maxn][maxn]; // xia: zuo to the min
int S[maxn][maxn]; // shang: zuo to the min
set<ll> s;
void add(int x1,int x2,int y1,int y2) {
	if (x2<x1||y2<y1) return;
	if ((you[x2][y1-1]-1==y2&&Y[x2][y1-1]<=x1)||(zuo[x2][y2+1]+1==y1&&Z[x2][y2+1]<=x1))
	if ((xia[x1-1][y2]-1==x2&&X[x1-1][y2]<=y1)||(shang[x2+1][y2]+1==x1&&S[x2+1][y2]<=y1))
		s.insert((x1-1)*N*N*N+(x2-1)*N*N+(y1-1)*N+y2);
}
ll count_rectangles(vector<vector<int> > a) {
	n=a.size(); m=a[0].size(); N=max(n,m);
	for (int i=0;i<n;i++)
	for (int j=0;j<m;j++) d[i+1][j+1]=a[i][j];
	for (int i=1;i<=n;i++) {
		top=0;
		for (int j=1;j<=m;j++) {
			while (top&&d[i][j]>d[i][st[top]]) top--;
			zuo[i][j]=st[top]; st[++top]=j;
		}
		top=0;
		for (int j=m;j>=1;j--) {
			while (top&&d[i][j]>d[i][st[top]]) top--;
			you[i][j]=st[top]; st[++top]=j;
		}
	}
	for (int j=1;j<=m;j++) {
		top=0;
		for (int i=1;i<=n;i++) {
			while (top&&d[i][j]>d[st[top]][j]) top--;
			shang[i][j]=st[top]; st[++top]=i;
		}
		top=0;
		for (int i=n;i>=1;i--) {
			while (top&&d[i][j]>d[st[top]][j]) top--;
			xia[i][j]=st[top]; st[++top]=i;
		}
	}
	for (int j=1;j<=m;j++)
	for (int i=1;i<=n;i++) {
		if (shang[i][j]) {
			if (j>1&&shang[i][j]==shang[i][j-1]) S[i][j]=S[i][j-1];
			else if (j>1&&i==xia[shang[i][j]][j-1]) S[i][j]=X[shang[i][j]][j-1];
			else S[i][j]=j;
		}
		if (xia[i][j]) {
			if (j>1&&xia[i][j]==xia[i][j-1]) X[i][j]=X[i][j-1];
			else if (j>1&&i==shang[xia[i][j]][j-1]) X[i][j]=S[xia[i][j]][j-1];
			else X[i][j]=j;
		}
	}
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++) {
		if (zuo[i][j]) {
			if (i>1&&zuo[i][j]==zuo[i-1][j]) Z[i][j]=Z[i-1][j];
			else if (i>1&&j==you[i-1][zuo[i][j]]) Z[i][j]=Y[i-1][zuo[i][j]];
			else Z[i][j]=i;
		}
		if (you[i][j]) {
			if (i>1&&you[i][j]==you[i-1][j]) Y[i][j]=Y[i-1][j];
			else if (i>1&&j==zuo[i-1][you[i][j]]) Y[i][j]=Z[i-1][you[i][j]];
			else Y[i][j]=i;
		}
	}
	for (int i=2;i<n;i++)
	for (int j=2;j<m;j++) {
		if (shang[i+1][j]&&zuo[i][j+1]) add(shang[i+1][j]+1,i,zuo[i][j+1]+1,j);
		if (shang[i+1][j]&&you[i][j-1]) add(shang[i+1][j]+1,i,j,you[i][j-1]-1);
		if (shang[i+1][j]&&you[shang[i+1][j]+1][j-1])
			add(shang[i+1][j]+1,i,j,you[shang[i+1][j]+1][j-1]-1);
		if (shang[i+1][j]&&zuo[shang[i+1][j]+1][j+1])
			add(shang[i+1][j]+1,i,zuo[shang[i+1][j]+1][j+1]+1,j);
			
		if (xia[i-1][j]&&zuo[i][j+1]) add(i,xia[i-1][j]-1,zuo[i][j+1]+1,j);
		if (xia[i-1][j]&&you[i][j-1]) add(i,xia[i-1][j]-1,j,you[i][j-1]-1);
		if (xia[i-1][j]&&you[xia[i-1][j]-1][j-1])
			add(i,xia[i-1][j]-1,j,you[xia[i-1][j]-1][j-1]-1);
		if (xia[i-1][j]&&zuo[xia[i-1][j]-1][j+1])
			add(i,xia[i-1][j]-1,zuo[xia[i-1][j]-1][j+1]+1,j);
	}
	return s.size();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 1528 KB Output is correct
20 Correct 3 ms 1528 KB Output is correct
21 Correct 2 ms 760 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 6 ms 3832 KB Output is correct
18 Correct 6 ms 3832 KB Output is correct
19 Correct 6 ms 3832 KB Output is correct
20 Correct 5 ms 3576 KB Output is correct
21 Correct 16 ms 3576 KB Output is correct
22 Correct 6 ms 3676 KB Output is correct
23 Correct 6 ms 3576 KB Output is correct
24 Correct 5 ms 3448 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 1528 KB Output is correct
28 Correct 3 ms 1528 KB Output is correct
29 Correct 2 ms 760 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 6 ms 3832 KB Output is correct
18 Correct 6 ms 3832 KB Output is correct
19 Correct 6 ms 3832 KB Output is correct
20 Correct 5 ms 3576 KB Output is correct
21 Correct 16 ms 3576 KB Output is correct
22 Correct 6 ms 3676 KB Output is correct
23 Correct 6 ms 3576 KB Output is correct
24 Correct 5 ms 3448 KB Output is correct
25 Correct 21 ms 11128 KB Output is correct
26 Correct 20 ms 11128 KB Output is correct
27 Correct 21 ms 11128 KB Output is correct
28 Correct 16 ms 9464 KB Output is correct
29 Correct 19 ms 9976 KB Output is correct
30 Correct 20 ms 9976 KB Output is correct
31 Correct 20 ms 9976 KB Output is correct
32 Correct 20 ms 9848 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 1528 KB Output is correct
36 Correct 3 ms 1528 KB Output is correct
37 Correct 2 ms 760 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 6 ms 3832 KB Output is correct
18 Correct 6 ms 3832 KB Output is correct
19 Correct 6 ms 3832 KB Output is correct
20 Correct 5 ms 3576 KB Output is correct
21 Correct 16 ms 3576 KB Output is correct
22 Correct 6 ms 3676 KB Output is correct
23 Correct 6 ms 3576 KB Output is correct
24 Correct 5 ms 3448 KB Output is correct
25 Correct 21 ms 11128 KB Output is correct
26 Correct 20 ms 11128 KB Output is correct
27 Correct 21 ms 11128 KB Output is correct
28 Correct 16 ms 9464 KB Output is correct
29 Correct 19 ms 9976 KB Output is correct
30 Correct 20 ms 9976 KB Output is correct
31 Correct 20 ms 9976 KB Output is correct
32 Correct 20 ms 9848 KB Output is correct
33 Correct 96 ms 44920 KB Output is correct
34 Correct 91 ms 44848 KB Output is correct
35 Correct 93 ms 44924 KB Output is correct
36 Correct 92 ms 44868 KB Output is correct
37 Correct 233 ms 69624 KB Output is correct
38 Correct 228 ms 69600 KB Output is correct
39 Correct 235 ms 69792 KB Output is correct
40 Correct 221 ms 65276 KB Output is correct
41 Correct 135 ms 47684 KB Output is correct
42 Correct 158 ms 49016 KB Output is correct
43 Correct 208 ms 54648 KB Output is correct
44 Correct 233 ms 54636 KB Output is correct
45 Correct 122 ms 40312 KB Output is correct
46 Correct 107 ms 27444 KB Output is correct
47 Correct 207 ms 54648 KB Output is correct
48 Correct 214 ms 54684 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 1528 KB Output is correct
52 Correct 3 ms 1528 KB Output is correct
53 Correct 2 ms 760 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 760 KB Output is correct
6 Correct 4 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 4 ms 676 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 632 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 764 KB Output is correct
2 Correct 756 ms 137456 KB Output is correct
3 Correct 1680 ms 281020 KB Output is correct
4 Correct 1717 ms 282444 KB Output is correct
5 Correct 1704 ms 282296 KB Output is correct
6 Correct 531 ms 133656 KB Output is correct
7 Correct 1121 ms 267484 KB Output is correct
8 Correct 1186 ms 270668 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 2 ms 760 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 3 ms 1528 KB Output is correct
5 Correct 3 ms 1528 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 3 ms 1528 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 6 ms 3832 KB Output is correct
18 Correct 6 ms 3832 KB Output is correct
19 Correct 6 ms 3832 KB Output is correct
20 Correct 5 ms 3576 KB Output is correct
21 Correct 16 ms 3576 KB Output is correct
22 Correct 6 ms 3676 KB Output is correct
23 Correct 6 ms 3576 KB Output is correct
24 Correct 5 ms 3448 KB Output is correct
25 Correct 21 ms 11128 KB Output is correct
26 Correct 20 ms 11128 KB Output is correct
27 Correct 21 ms 11128 KB Output is correct
28 Correct 16 ms 9464 KB Output is correct
29 Correct 19 ms 9976 KB Output is correct
30 Correct 20 ms 9976 KB Output is correct
31 Correct 20 ms 9976 KB Output is correct
32 Correct 20 ms 9848 KB Output is correct
33 Correct 96 ms 44920 KB Output is correct
34 Correct 91 ms 44848 KB Output is correct
35 Correct 93 ms 44924 KB Output is correct
36 Correct 92 ms 44868 KB Output is correct
37 Correct 233 ms 69624 KB Output is correct
38 Correct 228 ms 69600 KB Output is correct
39 Correct 235 ms 69792 KB Output is correct
40 Correct 221 ms 65276 KB Output is correct
41 Correct 135 ms 47684 KB Output is correct
42 Correct 158 ms 49016 KB Output is correct
43 Correct 208 ms 54648 KB Output is correct
44 Correct 233 ms 54636 KB Output is correct
45 Correct 122 ms 40312 KB Output is correct
46 Correct 107 ms 27444 KB Output is correct
47 Correct 207 ms 54648 KB Output is correct
48 Correct 214 ms 54684 KB Output is correct
49 Correct 3 ms 760 KB Output is correct
50 Correct 3 ms 760 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 4 ms 760 KB Output is correct
54 Correct 4 ms 760 KB Output is correct
55 Correct 3 ms 760 KB Output is correct
56 Correct 3 ms 760 KB Output is correct
57 Correct 4 ms 676 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 3 ms 632 KB Output is correct
60 Correct 2 ms 764 KB Output is correct
61 Correct 756 ms 137456 KB Output is correct
62 Correct 1680 ms 281020 KB Output is correct
63 Correct 1717 ms 282444 KB Output is correct
64 Correct 1704 ms 282296 KB Output is correct
65 Correct 531 ms 133656 KB Output is correct
66 Correct 1121 ms 267484 KB Output is correct
67 Correct 1186 ms 270668 KB Output is correct
68 Correct 1305 ms 262164 KB Output is correct
69 Correct 1286 ms 262136 KB Output is correct
70 Correct 1286 ms 262104 KB Output is correct
71 Correct 1252 ms 262044 KB Output is correct
72 Correct 3241 ms 563624 KB Output is correct
73 Correct 1786 ms 222588 KB Output is correct
74 Correct 2005 ms 316176 KB Output is correct
75 Correct 3153 ms 370680 KB Output is correct
76 Correct 1836 ms 223096 KB Output is correct
77 Correct 2600 ms 341432 KB Output is correct
78 Correct 3325 ms 371400 KB Output is correct
79 Incorrect 1790 ms 222632 KB Output isn't correct
80 Halted 0 ms 0 KB -