oj.uz

Submission #155823

# Submission time Handle Problem Language Result Execution time Memory
155823 2019-09-30T16:39:46 Z vanic Rectangles (IOI19_rect) C++14
37 / 100
 5000 ms 457276 KB 
#include "rect.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <map>
#include <stack>
#include <set>
#include <array>
#include <bitset>
 
using namespace std;
 
typedef long long ll;
const int maxn=2503, mod=200148551;
 
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;
bitset < mod > 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 504 KB Output is correct
2 Correct 4 ms 1656 KB Output is correct
3 Correct 3 ms 1656 KB Output is correct
4 Correct 3 ms 1656 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 4 ms 1784 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1784 KB Output is correct
10 Correct 4 ms 1756 KB Output is correct
11 Correct 4 ms 1832 KB Output is correct
12 Correct 4 ms 1784 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 1400 KB Output is correct
20 Correct 2 ms 764 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 4 ms 1656 KB Output is correct
3 Correct 3 ms 1656 KB Output is correct
4 Correct 3 ms 1656 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 4 ms 1784 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1784 KB Output is correct
10 Correct 4 ms 1756 KB Output is correct
11 Correct 4 ms 1832 KB Output is correct
12 Correct 4 ms 1784 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 16 ms 5368 KB Output is correct
18 Correct 11 ms 5340 KB Output is correct
19 Correct 21 ms 5368 KB Output is correct
20 Correct 8 ms 4856 KB Output is correct
21 Correct 15 ms 6776 KB Output is correct
22 Correct 13 ms 6776 KB Output is correct
23 Correct 13 ms 6648 KB Output is correct
24 Correct 8 ms 4344 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 1400 KB Output is correct
28 Correct 2 ms 764 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 4 ms 1656 KB Output is correct
3 Correct 3 ms 1656 KB Output is correct
4 Correct 3 ms 1656 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 4 ms 1784 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1784 KB Output is correct
10 Correct 4 ms 1756 KB Output is correct
11 Correct 4 ms 1832 KB Output is correct
12 Correct 4 ms 1784 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 16 ms 5368 KB Output is correct
18 Correct 11 ms 5340 KB Output is correct
19 Correct 21 ms 5368 KB Output is correct
20 Correct 8 ms 4856 KB Output is correct
21 Correct 15 ms 6776 KB Output is correct
22 Correct 13 ms 6776 KB Output is correct
23 Correct 13 ms 6648 KB Output is correct
24 Correct 8 ms 4344 KB Output is correct
25 Correct 49 ms 21388 KB Output is correct
26 Correct 50 ms 21416 KB Output is correct
27 Correct 52 ms 21400 KB Output is correct
28 Correct 38 ms 19112 KB Output is correct
29 Correct 69 ms 28600 KB Output is correct
30 Correct 69 ms 28340 KB Output is correct
31 Correct 81 ms 27236 KB Output is correct
32 Correct 75 ms 26664 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 1400 KB Output is correct
36 Correct 2 ms 764 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 504 KB Output is correct
2 Correct 4 ms 1656 KB Output is correct
3 Correct 3 ms 1656 KB Output is correct
4 Correct 3 ms 1656 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 4 ms 1784 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1784 KB Output is correct
10 Correct 4 ms 1756 KB Output is correct
11 Correct 4 ms 1832 KB Output is correct
12 Correct 4 ms 1784 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 16 ms 5368 KB Output is correct
18 Correct 11 ms 5340 KB Output is correct
19 Correct 21 ms 5368 KB Output is correct
20 Correct 8 ms 4856 KB Output is correct
21 Correct 15 ms 6776 KB Output is correct
22 Correct 13 ms 6776 KB Output is correct
23 Correct 13 ms 6648 KB Output is correct
24 Correct 8 ms 4344 KB Output is correct
25 Correct 49 ms 21388 KB Output is correct
26 Correct 50 ms 21416 KB Output is correct
27 Correct 52 ms 21400 KB Output is correct
28 Correct 38 ms 19112 KB Output is correct
29 Correct 69 ms 28600 KB Output is correct
30 Correct 69 ms 28340 KB Output is correct
31 Correct 81 ms 27236 KB Output is correct
32 Correct 75 ms 26664 KB Output is correct
33 Correct 656 ms 87104 KB Output is correct
34 Correct 648 ms 87232 KB Output is correct
35 Correct 507 ms 87120 KB Output is correct
36 Correct 550 ms 87116 KB Output is correct
37 Correct 604 ms 104788 KB Output is correct
38 Correct 594 ms 104792 KB Output is correct
39 Correct 597 ms 104812 KB Output is correct
40 Correct 580 ms 102296 KB Output is correct
41 Correct 325 ms 75328 KB Output is correct
42 Correct 455 ms 83724 KB Output is correct
43 Incorrect 989 ms 114472 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 31352 KB Output is correct
2 Correct 32 ms 26720 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 1 ms 376 KB Output is correct
5 Correct 32 ms 22008 KB Output is correct
6 Correct 29 ms 21772 KB Output is correct
7 Correct 31 ms 21684 KB Output is correct
8 Correct 31 ms 20344 KB Output is correct
9 Correct 27 ms 19832 KB Output is correct
10 Correct 16 ms 10872 KB Output is correct
11 Correct 25 ms 16248 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 2324 ms 247160 KB Output is correct
3 Execution timed out 5055 ms 457276 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 4 ms 1656 KB Output is correct
3 Correct 3 ms 1656 KB Output is correct
4 Correct 3 ms 1656 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 4 ms 1784 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 4 ms 1784 KB Output is correct
10 Correct 4 ms 1756 KB Output is correct
11 Correct 4 ms 1832 KB Output is correct
12 Correct 4 ms 1784 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 16 ms 5368 KB Output is correct
18 Correct 11 ms 5340 KB Output is correct
19 Correct 21 ms 5368 KB Output is correct
20 Correct 8 ms 4856 KB Output is correct
21 Correct 15 ms 6776 KB Output is correct
22 Correct 13 ms 6776 KB Output is correct
23 Correct 13 ms 6648 KB Output is correct
24 Correct 8 ms 4344 KB Output is correct
25 Correct 49 ms 21388 KB Output is correct
26 Correct 50 ms 21416 KB Output is correct
27 Correct 52 ms 21400 KB Output is correct
28 Correct 38 ms 19112 KB Output is correct
29 Correct 69 ms 28600 KB Output is correct
30 Correct 69 ms 28340 KB Output is correct
31 Correct 81 ms 27236 KB Output is correct
32 Correct 75 ms 26664 KB Output is correct
33 Correct 656 ms 87104 KB Output is correct
34 Correct 648 ms 87232 KB Output is correct
35 Correct 507 ms 87120 KB Output is correct
36 Correct 550 ms 87116 KB Output is correct
37 Correct 604 ms 104788 KB Output is correct
38 Correct 594 ms 104792 KB Output is correct
39 Correct 597 ms 104812 KB Output is correct
40 Correct 580 ms 102296 KB Output is correct
41 Correct 325 ms 75328 KB Output is correct
42 Correct 455 ms 83724 KB Output is correct
43 Incorrect 989 ms 114472 KB Output isn't correct
44 Halted 0 ms 0 KB -