oj.uz

Submission #155818

# Submission time Handle Problem Language Result Execution time Memory
155818 2019-09-30T16:28:38 Z vanic Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 444172 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 < ll, int > r, c;
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 ll hashiraj(ll a, ll b, ll c){
	return a*maxn*maxn+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[hashiraj(red[x][i].first, 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[hashiraj(stup[i][x].first, 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[hashiraj(r1, r2, c2)]!=0 && r[hashiraj(r1, r2, c1)]!=0
	&& c[hashiraj(c1, c2, r2)]!=0 && c[hashiraj(c1, c2, r1)]!=0
	&& r[hashiraj(r1, r2, c2)]-r[hashiraj(r1, r2, c1)]==c2-c1 && c[hashiraj(c1, c2, r2)]-c[hashiraj(c1, 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);
	}
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			provjeri(i, j);
		}
	}
	sort(bio.begin(), bio.end());
	bio.erase(unique(bio.begin(), bio.end()), bio.end());
	printf("%d\n", (int)bio.size());
	return 0;
}*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 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 1144 KB Output is correct
20 Correct 2 ms 760 KB Output is correct
21 Correct 2 ms 504 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3448 KB Output is correct
18 Correct 8 ms 3564 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 9 ms 3704 KB Output is correct
24 Correct 6 ms 2680 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 1144 KB Output is correct
28 Correct 2 ms 760 KB Output is correct
29 Correct 2 ms 504 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3448 KB Output is correct
18 Correct 8 ms 3564 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 9 ms 3704 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 38 ms 12044 KB Output is correct
26 Correct 37 ms 12068 KB Output is correct
27 Correct 38 ms 12112 KB Output is correct
28 Correct 26 ms 9468 KB Output is correct
29 Correct 63 ms 12552 KB Output is correct
30 Correct 59 ms 12612 KB Output is correct
31 Correct 53 ms 11560 KB Output is correct
32 Correct 52 ms 11560 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 1144 KB Output is correct
36 Correct 2 ms 760 KB Output is correct
37 Correct 2 ms 504 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3448 KB Output is correct
18 Correct 8 ms 3564 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 9 ms 3704 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 38 ms 12044 KB Output is correct
26 Correct 37 ms 12068 KB Output is correct
27 Correct 38 ms 12112 KB Output is correct
28 Correct 26 ms 9468 KB Output is correct
29 Correct 63 ms 12552 KB Output is correct
30 Correct 59 ms 12612 KB Output is correct
31 Correct 53 ms 11560 KB Output is correct
32 Correct 52 ms 11560 KB Output is correct
33 Correct 533 ms 84388 KB Output is correct
34 Correct 515 ms 84424 KB Output is correct
35 Correct 511 ms 84460 KB Output is correct
36 Correct 498 ms 84428 KB Output is correct
37 Correct 642 ms 102932 KB Output is correct
38 Correct 631 ms 102896 KB Output is correct
39 Correct 643 ms 102892 KB Output is correct
40 Correct 617 ms 99076 KB Output is correct
41 Correct 308 ms 52664 KB Output is correct
42 Correct 449 ms 61188 KB Output is correct
43 Correct 1163 ms 96888 KB Output is correct
44 Correct 960 ms 97676 KB Output is correct
45 Correct 434 ms 56076 KB Output is correct
46 Correct 402 ms 51824 KB Output is correct
47 Correct 911 ms 89708 KB Output is correct
48 Correct 1022 ms 89968 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 1144 KB Output is correct
52 Correct 2 ms 760 KB Output is correct
53 Correct 2 ms 504 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 21368 KB Output is correct
2 Correct 23 ms 18168 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 24 ms 19320 KB Output is correct
6 Correct 24 ms 18936 KB Output is correct
7 Correct 24 ms 19064 KB Output is correct
8 Correct 23 ms 17912 KB Output is correct
9 Correct 22 ms 17528 KB Output is correct
10 Correct 13 ms 11000 KB Output is correct
11 Correct 19 ms 16248 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2551 ms 227944 KB Output is correct
3 Execution timed out 5070 ms 444172 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1272 KB Output is correct
5 Correct 2 ms 764 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3448 KB Output is correct
18 Correct 8 ms 3564 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 9 ms 3704 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 38 ms 12044 KB Output is correct
26 Correct 37 ms 12068 KB Output is correct
27 Correct 38 ms 12112 KB Output is correct
28 Correct 26 ms 9468 KB Output is correct
29 Correct 63 ms 12552 KB Output is correct
30 Correct 59 ms 12612 KB Output is correct
31 Correct 53 ms 11560 KB Output is correct
32 Correct 52 ms 11560 KB Output is correct
33 Correct 533 ms 84388 KB Output is correct
34 Correct 515 ms 84424 KB Output is correct
35 Correct 511 ms 84460 KB Output is correct
36 Correct 498 ms 84428 KB Output is correct
37 Correct 642 ms 102932 KB Output is correct
38 Correct 631 ms 102896 KB Output is correct
39 Correct 643 ms 102892 KB Output is correct
40 Correct 617 ms 99076 KB Output is correct
41 Correct 308 ms 52664 KB Output is correct
42 Correct 449 ms 61188 KB Output is correct
43 Correct 1163 ms 96888 KB Output is correct
44 Correct 960 ms 97676 KB Output is correct
45 Correct 434 ms 56076 KB Output is correct
46 Correct 402 ms 51824 KB Output is correct
47 Correct 911 ms 89708 KB Output is correct
48 Correct 1022 ms 89968 KB Output is correct
49 Correct 26 ms 21368 KB Output is correct
50 Correct 23 ms 18168 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 24 ms 19320 KB Output is correct
54 Correct 24 ms 18936 KB Output is correct
55 Correct 24 ms 19064 KB Output is correct
56 Correct 23 ms 17912 KB Output is correct
57 Correct 22 ms 17528 KB Output is correct
58 Correct 13 ms 11000 KB Output is correct
59 Correct 19 ms 16248 KB Output is correct
60 Correct 2 ms 632 KB Output is correct
61 Correct 2551 ms 227944 KB Output is correct
62 Execution timed out 5070 ms 444172 KB Time limit exceeded
63 Halted 0 ms 0 KB -