oj.uz

Submission #155873

# Submission time Handle Problem Language Result Execution time Memory
155873 2019-10-01T10:47:46 Z vanic Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 436276 KB 
#include "rect.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <map>
#include <stack>
#include <set>
#include <array>
 
using namespace std;
 
typedef long long ll;
const int maxn=2503;
 
int n, m;
int l[maxn][maxn];
//vector < int > r[maxn][maxn], c[maxn][maxn];
unordered_map < int, int > r[maxn], c[maxn];
int rind[maxn][maxn], cind[maxn][maxn];
pair < int, int > red[maxn][maxn], stup[maxn][maxn];
int bio2[maxn][maxn], bio3[maxn][maxn];
//vector < array < int, 4 > > bio;
unordered_map < ll, bool > bio;
 
inline int hashiraj(int b, int c){
	return b*maxn+c;
}
 
inline ll hashah(ll a, ll b, ll c, ll d){
	return a*maxn*maxn*maxn+b*maxn*maxn+c*maxn+d;
}
 
void upd1(int x){
	stack < pair < int, int > > q;
	q.push(make_pair(1e8, -1));
	for(int i=0; i<m; i++){
		while(q.top().first<=l[x][i]){
			q.pop();
		}
		red[x][i].first=q.top().second+1;
		q.push(make_pair(l[x][i], i));
	}
	while(!q.empty()){
		q.pop();
	}
	q.push(make_pair(1e8, m));
	for(int i=m-1; i>-1; i--){
		while(q.top().first<=l[x][i]){
			q.pop();
		}
		red[x][i].second=q.top().second-1;
		if(bio2[red[x][i].first][red[x][i].second]!=x+1){
			bio2[red[x][i].first][red[x][i].second]=x+1;
			rind[red[x][i].first][red[x][i].second]++;
			r[red[x][i].first][hashiraj(red[x][i].second, x)]=rind[red[x][i].first][red[x][i].second];
		}
		q.push(make_pair(l[x][i], i));
	}
}
 
void upd2(int x){
	stack < pair < int, int > > q;
	q.push(make_pair(1e8, -1));
	for(int i=0; i<n; i++){
		while(q.top().first<=l[i][x]){
			q.pop();
		}
		stup[i][x].first=q.top().second+1;
		q.push(make_pair(l[i][x], i));
	}
	while(!q.empty()){
		q.pop();
	}
	q.push(make_pair(1e8, n));
	for(int i=n-1; i>-1; i--){
		while(q.top().first<=l[i][x]){
			q.pop();
		}
		stup[i][x].second=q.top().second-1;
		if(bio3[stup[i][x].first][stup[i][x].second]!=x+1){
			bio3[stup[i][x].first][stup[i][x].second]=x+1;
			cind[stup[i][x].first][stup[i][x].second]++;
			c[stup[i][x].first][hashiraj(stup[i][x].second, x)]=cind[stup[i][x].first][stup[i][x].second];
		}
		q.push(make_pair(l[i][x], i));
	}
}
 
bool provjeri(int x, int y){
	int r1, r2, c1, c2;
	r1=red[x][y].first;
	r2=red[x][y].second;
	c1=stup[x][y].first;
	c2=stup[x][y].second;
	if(r1==0 || c1==0 || r2==m-1 || c2==n-1){
		return 0;
	}
	if(r[r1][hashiraj(r2, c2)]!=0 && r[r1][hashiraj(r2, c1)]!=0
	&& c[c1][hashiraj(c2, r2)]!=0 && c[c1][hashiraj(c2, r1)]!=0
	&& r[r1][hashiraj(r2, c2)]-r[r1][hashiraj(r2, c1)]==c2-c1 && c[c1][hashiraj(c2, r2)]-c[c1][hashiraj(c2, r1)]==r2-r1){
		if(!bio[hashah(r1, r2, c1, c2)]){
			bio[hashah(r1, r2, c1, c2)]=1;
			return 1;
		}
	}
	return 0;
}
 
long long count_rectangles(vector < vector < int > > a){
	n=a.size();
	m=a[0].size();
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			l[i][j]=a[i][j];
		}
	}
	for(int i=0; i<n; i++){
		upd1(i);
	}
	for(int i=0; i<m; i++){
		upd2(i);
	}
	int br=0;
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			br+=provjeri(i, j);
		}
	}
	return br;
}
 
/*
int main(){
	scanf("%d%d", &n, &m);
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			scanf("%d", &l[i][j]);
		}
	}
	for(int i=0; i<n; i++){
		upd1(i);
	}
	for(int i=0; i<m; i++){
		upd2(i);
	}
	int br=0;
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			br+=provjeri(i, j);
		}
	}
	printf("%d\n", br);
	return 0;
}*/

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Correct 4 ms 1528 KB Output is correct
4 Correct 4 ms 1568 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 4 ms 1404 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 7 ms 1528 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 10 ms 3960 KB Output is correct
18 Correct 9 ms 3960 KB Output is correct
19 Correct 9 ms 3832 KB Output is correct
20 Correct 7 ms 3448 KB Output is correct
21 Correct 9 ms 3832 KB Output is correct
22 Correct 9 ms 3960 KB Output is correct
23 Correct 9 ms 3832 KB Output is correct
24 Correct 6 ms 2936 KB Output is correct
25 Correct 2 ms 632 KB Output is correct
26 Correct 2 ms 632 KB Output is correct
27 Correct 3 ms 1524 KB Output is correct
28 Correct 3 ms 1016 KB Output is correct
29 Correct 3 ms 760 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Correct 4 ms 1528 KB Output is correct
4 Correct 4 ms 1568 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 4 ms 1404 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 7 ms 1528 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 10 ms 3960 KB Output is correct
18 Correct 9 ms 3960 KB Output is correct
19 Correct 9 ms 3832 KB Output is correct
20 Correct 7 ms 3448 KB Output is correct
21 Correct 9 ms 3832 KB Output is correct
22 Correct 9 ms 3960 KB Output is correct
23 Correct 9 ms 3832 KB Output is correct
24 Correct 6 ms 2936 KB Output is correct
25 Correct 46 ms 12812 KB Output is correct
26 Correct 41 ms 12840 KB Output is correct
27 Correct 42 ms 12964 KB Output is correct
28 Correct 27 ms 9720 KB Output is correct
29 Correct 49 ms 12792 KB Output is correct
30 Correct 51 ms 12920 KB Output is correct
31 Correct 53 ms 12304 KB Output is correct
32 Correct 47 ms 12284 KB Output is correct
33 Correct 2 ms 632 KB Output is correct
34 Correct 2 ms 632 KB Output is correct
35 Correct 3 ms 1524 KB Output is correct
36 Correct 3 ms 1016 KB Output is correct
37 Correct 3 ms 760 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Correct 4 ms 1528 KB Output is correct
4 Correct 4 ms 1568 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 4 ms 1404 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 7 ms 1528 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 10 ms 3960 KB Output is correct
18 Correct 9 ms 3960 KB Output is correct
19 Correct 9 ms 3832 KB Output is correct
20 Correct 7 ms 3448 KB Output is correct
21 Correct 9 ms 3832 KB Output is correct
22 Correct 9 ms 3960 KB Output is correct
23 Correct 9 ms 3832 KB Output is correct
24 Correct 6 ms 2936 KB Output is correct
25 Correct 46 ms 12812 KB Output is correct
26 Correct 41 ms 12840 KB Output is correct
27 Correct 42 ms 12964 KB Output is correct
28 Correct 27 ms 9720 KB Output is correct
29 Correct 49 ms 12792 KB Output is correct
30 Correct 51 ms 12920 KB Output is correct
31 Correct 53 ms 12304 KB Output is correct
32 Correct 47 ms 12284 KB Output is correct
33 Correct 338 ms 81088 KB Output is correct
34 Correct 346 ms 80908 KB Output is correct
35 Correct 331 ms 80264 KB Output is correct
36 Correct 321 ms 79788 KB Output is correct
37 Correct 711 ms 97068 KB Output is correct
38 Correct 622 ms 96972 KB Output is correct
39 Correct 625 ms 97200 KB Output is correct
40 Correct 577 ms 93060 KB Output is correct
41 Correct 316 ms 53568 KB Output is correct
42 Correct 449 ms 60968 KB Output is correct
43 Correct 981 ms 98744 KB Output is correct
44 Correct 1081 ms 99896 KB Output is correct
45 Correct 460 ms 57604 KB Output is correct
46 Correct 536 ms 53004 KB Output is correct
47 Correct 901 ms 89256 KB Output is correct
48 Correct 1107 ms 89616 KB Output is correct
49 Correct 2 ms 632 KB Output is correct
50 Correct 2 ms 632 KB Output is correct
51 Correct 3 ms 1524 KB Output is correct
52 Correct 3 ms 1016 KB Output is correct
53 Correct 3 ms 760 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 21752 KB Output is correct
2 Correct 22 ms 18652 KB Output is correct
3 Correct 3 ms 888 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 24 ms 19668 KB Output is correct
6 Correct 24 ms 19320 KB Output is correct
7 Correct 24 ms 19448 KB Output is correct
8 Correct 22 ms 18296 KB Output is correct
9 Correct 22 ms 17784 KB Output is correct
10 Correct 13 ms 11324 KB Output is correct
11 Correct 20 ms 16632 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 888 KB Output is correct
2 Correct 2455 ms 219680 KB Output is correct
3 Execution timed out 5078 ms 436276 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Correct 4 ms 1528 KB Output is correct
4 Correct 4 ms 1568 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 4 ms 1404 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 7 ms 1528 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 10 ms 3960 KB Output is correct
18 Correct 9 ms 3960 KB Output is correct
19 Correct 9 ms 3832 KB Output is correct
20 Correct 7 ms 3448 KB Output is correct
21 Correct 9 ms 3832 KB Output is correct
22 Correct 9 ms 3960 KB Output is correct
23 Correct 9 ms 3832 KB Output is correct
24 Correct 6 ms 2936 KB Output is correct
25 Correct 46 ms 12812 KB Output is correct
26 Correct 41 ms 12840 KB Output is correct
27 Correct 42 ms 12964 KB Output is correct
28 Correct 27 ms 9720 KB Output is correct
29 Correct 49 ms 12792 KB Output is correct
30 Correct 51 ms 12920 KB Output is correct
31 Correct 53 ms 12304 KB Output is correct
32 Correct 47 ms 12284 KB Output is correct
33 Correct 338 ms 81088 KB Output is correct
34 Correct 346 ms 80908 KB Output is correct
35 Correct 331 ms 80264 KB Output is correct
36 Correct 321 ms 79788 KB Output is correct
37 Correct 711 ms 97068 KB Output is correct
38 Correct 622 ms 96972 KB Output is correct
39 Correct 625 ms 97200 KB Output is correct
40 Correct 577 ms 93060 KB Output is correct
41 Correct 316 ms 53568 KB Output is correct
42 Correct 449 ms 60968 KB Output is correct
43 Correct 981 ms 98744 KB Output is correct
44 Correct 1081 ms 99896 KB Output is correct
45 Correct 460 ms 57604 KB Output is correct
46 Correct 536 ms 53004 KB Output is correct
47 Correct 901 ms 89256 KB Output is correct
48 Correct 1107 ms 89616 KB Output is correct
49 Correct 25 ms 21752 KB Output is correct
50 Correct 22 ms 18652 KB Output is correct
51 Correct 3 ms 888 KB Output is correct
52 Correct 2 ms 632 KB Output is correct
53 Correct 24 ms 19668 KB Output is correct
54 Correct 24 ms 19320 KB Output is correct
55 Correct 24 ms 19448 KB Output is correct
56 Correct 22 ms 18296 KB Output is correct
57 Correct 22 ms 17784 KB Output is correct
58 Correct 13 ms 11324 KB Output is correct
59 Correct 20 ms 16632 KB Output is correct
60 Correct 2 ms 888 KB Output is correct
61 Correct 2455 ms 219680 KB Output is correct
62 Execution timed out 5078 ms 436276 KB Time limit exceeded
63 Halted 0 ms 0 KB -