oj.uz

Submission #155819

# Submission time Handle Problem Language Result Execution time Memory
155819 2019-09-30T16:30:38 Z vanic Rectangles (IOI19_rect) C++14
37 / 100
 5000 ms 444340 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, mod=1e9+7;
 
int n, m;
int l[maxn][maxn];
//vector < int > r[maxn][maxn], c[maxn][maxn];
unordered_map < int, 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 < int, bool > bio;

inline int hashiraj(ll a, ll b, ll c){
	return (a*maxn*maxn+b*maxn+c)%mod;
}

inline int hashah(ll a, ll b, ll c, ll d){
	return (a*maxn*maxn*maxn+b*maxn*maxn+c*maxn+d)%mod;
}
 
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 632 KB Output is correct
2 Correct 4 ms 1272 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 2 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 4 ms 1404 KB Output is correct
11 Correct 1 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 1272 KB Output is correct
20 Correct 3 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 632 KB Output is correct
2 Correct 4 ms 1272 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 2 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 4 ms 1404 KB Output is correct
11 Correct 1 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 8 ms 3448 KB Output is correct
18 Correct 9 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 11 ms 3576 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 1272 KB Output is correct
28 Correct 3 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 632 KB Output is correct
2 Correct 4 ms 1272 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 2 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 4 ms 1404 KB Output is correct
11 Correct 1 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 8 ms 3448 KB Output is correct
18 Correct 9 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 11 ms 3576 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 53 ms 12028 KB Output is correct
26 Correct 46 ms 12124 KB Output is correct
27 Correct 49 ms 12072 KB Output is correct
28 Correct 30 ms 9464 KB Output is correct
29 Correct 49 ms 12552 KB Output is correct
30 Correct 50 ms 12552 KB Output is correct
31 Correct 47 ms 11688 KB Output is correct
32 Correct 45 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 1272 KB Output is correct
36 Correct 3 ms 760 KB Output is correct
37 Correct 2 ms 504 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 4 ms 1272 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 2 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 4 ms 1404 KB Output is correct
11 Correct 1 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 8 ms 3448 KB Output is correct
18 Correct 9 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 11 ms 3576 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 53 ms 12028 KB Output is correct
26 Correct 46 ms 12124 KB Output is correct
27 Correct 49 ms 12072 KB Output is correct
28 Correct 30 ms 9464 KB Output is correct
29 Correct 49 ms 12552 KB Output is correct
30 Correct 50 ms 12552 KB Output is correct
31 Correct 47 ms 11688 KB Output is correct
32 Correct 45 ms 11560 KB Output is correct
33 Correct 751 ms 84208 KB Output is correct
34 Correct 571 ms 84324 KB Output is correct
35 Correct 542 ms 84380 KB Output is correct
36 Correct 498 ms 84344 KB Output is correct
37 Correct 774 ms 102988 KB Output is correct
38 Correct 788 ms 102716 KB Output is correct
39 Correct 782 ms 103008 KB Output is correct
40 Correct 723 ms 98928 KB Output is correct
41 Correct 291 ms 52668 KB Output is correct
42 Correct 451 ms 61068 KB Output is correct
43 Correct 1018 ms 96872 KB Output is correct
44 Incorrect 1200 ms 97808 KB Output isn't correct
45 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 21416 KB Output is correct
2 Correct 25 ms 18200 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 28 ms 19224 KB Output is correct
6 Correct 37 ms 18936 KB Output is correct
7 Correct 28 ms 19196 KB Output is correct
8 Correct 24 ms 17912 KB Output is correct
9 Correct 26 ms 17528 KB Output is correct
10 Correct 15 ms 11048 KB Output is correct
11 Correct 23 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 2449 ms 228020 KB Output is correct
3 Execution timed out 5119 ms 444340 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 632 KB Output is correct
2 Correct 4 ms 1272 KB Output is correct
3 Correct 4 ms 1272 KB Output is correct
4 Correct 2 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 1272 KB Output is correct
10 Correct 4 ms 1404 KB Output is correct
11 Correct 1 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 8 ms 3448 KB Output is correct
18 Correct 9 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 9 ms 3576 KB Output is correct
22 Correct 9 ms 3576 KB Output is correct
23 Correct 11 ms 3576 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 53 ms 12028 KB Output is correct
26 Correct 46 ms 12124 KB Output is correct
27 Correct 49 ms 12072 KB Output is correct
28 Correct 30 ms 9464 KB Output is correct
29 Correct 49 ms 12552 KB Output is correct
30 Correct 50 ms 12552 KB Output is correct
31 Correct 47 ms 11688 KB Output is correct
32 Correct 45 ms 11560 KB Output is correct
33 Correct 751 ms 84208 KB Output is correct
34 Correct 571 ms 84324 KB Output is correct
35 Correct 542 ms 84380 KB Output is correct
36 Correct 498 ms 84344 KB Output is correct
37 Correct 774 ms 102988 KB Output is correct
38 Correct 788 ms 102716 KB Output is correct
39 Correct 782 ms 103008 KB Output is correct
40 Correct 723 ms 98928 KB Output is correct
41 Correct 291 ms 52668 KB Output is correct
42 Correct 451 ms 61068 KB Output is correct
43 Correct 1018 ms 96872 KB Output is correct
44 Incorrect 1200 ms 97808 KB Output isn't correct
45 Halted 0 ms 0 KB -