oj.uz

Submission #156308

# Submission time Handle Problem Language Result Execution time Memory
156308 2019-10-05T02:22:38 Z wilwxk Rectangles (IOI19_rect) C++14
50 / 100
 3220 ms 379800 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN=2503;
const int MOD=1e9+9;
int v[MAXN][MAXN];
short limite[MAXN][MAXN][4];
short qv[MAXN][MAXN][4];
short seg[4][MAXN][4*MAXN];
set<ll> respf;
int n, m;

void histoi() {
	for(int i=0; i<n; i++) {
		stack<pair<int, int> > st;
		for(int j=0; j<m; j++) {
			while(st.size()&&st.top().first<v[i][j]) {
				qv[i][st.top().second][0]=j;
				st.pop();
			}
			limite[i][j][2]= st.size() ? st.top().second : -1;
			st.push({v[i][j], j});
		}
		while(st.size()) st.pop();
		for(int j=m-1; j>=0; j--) {
			while(st.size()&&st.top().first<v[i][j]) {
				qv[i][st.top().second][2]=j;
				st.pop();
			}
			limite[i][j][0]= st.size() ? st.top().second : m;
			st.push({v[i][j], j});
		}
	}
}

void histoj() {
	for(int j=0; j<m; j++) {
		stack<pair<int, int> > st;
		for(int i=0; i<n; i++) {
			while(st.size()&&st.top().first<v[i][j]) {
				qv[st.top().second][j][3]=i;
				st.pop();
			}
			limite[i][j][1]= st.size() ? st.top().second : -1;
			st.push({v[i][j], i});
		}
		while(st.size()) st.pop();
		for(int i=n-1; i>=0; i--) {
			while(st.size()&&st.top().first<v[i][j]) {
				qv[st.top().second][j][1]=i;
				st.pop();
			}
			limite[i][j][3]= st.size() ? st.top().second : n;
			st.push({v[i][j], i});
		}
	}
}

void junta(int sind, int e, int d, int k, int k2) {
	if(k==0||k==3) seg[k][k2][sind]=min(seg[k][k2][e], seg[k][k2][d]);
	else seg[k][k2][sind]=max(seg[k][k2][e], seg[k][k2][d]);
}

void build(int sind, int ini, int fim, int k, int k2) {
	if(ini==fim) {
		if(k==0||k==2) seg[k][k2][sind]=limite[ini][k2][k];
		else seg[k][k2][sind]=limite[k2][ini][k];
		return;
	}
	int mid=(ini+fim)/2;
	int e=sind*2; int d=e+1;
	build(e, ini, mid, k, k2); build(d, mid+1, fim, k, k2);
	junta(sind, e, d, k, k2);
} 

void query(int sind, int ini, int fim, int qini, int qfim, int k, int k2) {
	if(sind==1) {
		if(k==0||k==3) seg[k][k2][0]=MAXN;
		else seg[k][k2][0]=-1;
	}
	if(qini<=ini&&qfim>=fim) {
		junta(0, 0, sind, k, k2);
		return;
	}
	int mid=(ini+fim)/2;
	int e=sind*2; int d=e+1;
	if(qini<=mid) query(e, ini, mid, qini, qfim, k, k2);
	if(qfim>mid) query(d, mid+1, fim, qini, qfim, k, k2);
}

bool checa(int a, int b, int c, int d) {
	int i, j, i2, j2;
	i=min(a, c); i2=max(a, c);
	j=min(b, d); j2=max(b, d);
	if(i<0||j<0||i2>n-1||j2>m-1) return 0;
	// printf("checa %d %d %d %d\n", i, j, i2, j2);

	query(1, 0, m-1, j+1, j2-1, 3, i);
	int aa=seg[3][i][0];
	if(aa<i2) return 0;

	query(1, 0, m-1, j+1, j2-1, 1, i2);
	int bb=seg[1][i2][0];
	if(bb>i) return 0;

	query(1, 0, n-1, i+1, i2-1, 0, j);
	int cc=seg[0][j][0];
	if(cc<j2) return 0;

	query(1, 0, n-1, i+1, i2-1, 2, j2);
	int dd=seg[2][j2][0];
	if(dd>j) return 0;

	// printf("ok %d %d %d %d\n", aa, bb, cc, dd);

	return 1;
}

ll 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++) {
			v[i][j]=A[i][j];
			qv[i][j][0]=m;
			qv[i][j][1]=-1;
			qv[i][j][2]=-1;
			qv[i][j][3]=n;
		}
	}
	histoi(); histoj();
	// for(int i=0; i<n; i++) {
	// 	for(int j=0; j<m; j++) printf("%d ", qv[i][j][0]);
	// 	printf("\n");
	// }

	for(int i=0; i<n; i++) build(1, 0, m-1, 1, i), build(1, 0, m-1, 3, i);
	for(int j=0; j<m; j++) build(1, 0, n-1, 0, j), build(1, 0, n-1, 2, j);

	for(int ii=1; ii<n-1; ii++) {
		for(int jj=1; jj<m-1; jj++) {
			// printf("%d %d\n", ii, jj);
			int i=qv[ii][jj][1];
			int j=qv[ii][jj][2];
			int i2=qv[ii][jj][3];
			int j2=qv[ii][jj][0];
			ll val=i; val*=MAXN; val%=MOD;
			val+=j; val*=MAXN; val%=MOD;
			val+=i2; val*=MAXN; val%=MOD;
			val+=j2; val*=MAXN; val%=MOD;
			if(checa(i, j, i2, j2)) respf.insert(val);
		}
	}

	return respf.size();
}

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 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 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 632 KB Output is correct
15 Correct 2 ms 632 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 1016 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 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 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 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3192 KB Output is correct
18 Correct 10 ms 3192 KB Output is correct
19 Correct 9 ms 3192 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 6 ms 3064 KB Output is correct
22 Correct 7 ms 3064 KB Output is correct
23 Correct 7 ms 3064 KB Output is correct
24 Correct 5 ms 2424 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 1016 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 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 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 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3192 KB Output is correct
18 Correct 10 ms 3192 KB Output is correct
19 Correct 9 ms 3192 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 6 ms 3064 KB Output is correct
22 Correct 7 ms 3064 KB Output is correct
23 Correct 7 ms 3064 KB Output is correct
24 Correct 5 ms 2424 KB Output is correct
25 Correct 53 ms 9820 KB Output is correct
26 Correct 51 ms 9820 KB Output is correct
27 Correct 50 ms 9772 KB Output is correct
28 Correct 21 ms 8056 KB Output is correct
29 Correct 31 ms 8484 KB Output is correct
30 Correct 30 ms 8440 KB Output is correct
31 Correct 32 ms 8440 KB Output is correct
32 Correct 28 ms 8440 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 1016 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 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 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 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3192 KB Output is correct
18 Correct 10 ms 3192 KB Output is correct
19 Correct 9 ms 3192 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 6 ms 3064 KB Output is correct
22 Correct 7 ms 3064 KB Output is correct
23 Correct 7 ms 3064 KB Output is correct
24 Correct 5 ms 2424 KB Output is correct
25 Correct 53 ms 9820 KB Output is correct
26 Correct 51 ms 9820 KB Output is correct
27 Correct 50 ms 9772 KB Output is correct
28 Correct 21 ms 8056 KB Output is correct
29 Correct 31 ms 8484 KB Output is correct
30 Correct 30 ms 8440 KB Output is correct
31 Correct 32 ms 8440 KB Output is correct
32 Correct 28 ms 8440 KB Output is correct
33 Correct 144 ms 44804 KB Output is correct
34 Correct 152 ms 44920 KB Output is correct
35 Correct 151 ms 44792 KB Output is correct
36 Correct 150 ms 44756 KB Output is correct
37 Correct 758 ms 67704 KB Output is correct
38 Correct 855 ms 67636 KB Output is correct
39 Correct 904 ms 67700 KB Output is correct
40 Correct 747 ms 64156 KB Output is correct
41 Correct 213 ms 45752 KB Output is correct
42 Correct 254 ms 46976 KB Output is correct
43 Correct 407 ms 52600 KB Output is correct
44 Correct 415 ms 52672 KB Output is correct
45 Correct 196 ms 33656 KB Output is correct
46 Correct 188 ms 29304 KB Output is correct
47 Correct 459 ms 52752 KB Output is correct
48 Incorrect 460 ms 52600 KB Output isn't correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 20984 KB Output is correct
2 Correct 17 ms 17912 KB Output is correct
3 Correct 18 ms 20948 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 20 ms 20984 KB Output is correct
6 Correct 24 ms 20984 KB Output is correct
7 Correct 19 ms 20856 KB Output is correct
8 Correct 19 ms 20856 KB Output is correct
9 Correct 19 ms 20984 KB Output is correct
10 Correct 18 ms 20728 KB Output is correct
11 Correct 18 ms 20728 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 1292 ms 192848 KB Output is correct
3 Correct 3105 ms 378264 KB Output is correct
4 Correct 3220 ms 379660 KB Output is correct
5 Correct 3050 ms 379800 KB Output is correct
6 Correct 792 ms 193436 KB Output is correct
7 Correct 1633 ms 358776 KB Output is correct
8 Correct 1738 ms 368032 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 1272 KB Output is correct
12 Correct 3 ms 1016 KB Output is correct
13 Correct 2 ms 504 KB Output is correct

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 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 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 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 9 ms 3192 KB Output is correct
18 Correct 10 ms 3192 KB Output is correct
19 Correct 9 ms 3192 KB Output is correct
20 Correct 6 ms 2936 KB Output is correct
21 Correct 6 ms 3064 KB Output is correct
22 Correct 7 ms 3064 KB Output is correct
23 Correct 7 ms 3064 KB Output is correct
24 Correct 5 ms 2424 KB Output is correct
25 Correct 53 ms 9820 KB Output is correct
26 Correct 51 ms 9820 KB Output is correct
27 Correct 50 ms 9772 KB Output is correct
28 Correct 21 ms 8056 KB Output is correct
29 Correct 31 ms 8484 KB Output is correct
30 Correct 30 ms 8440 KB Output is correct
31 Correct 32 ms 8440 KB Output is correct
32 Correct 28 ms 8440 KB Output is correct
33 Correct 144 ms 44804 KB Output is correct
34 Correct 152 ms 44920 KB Output is correct
35 Correct 151 ms 44792 KB Output is correct
36 Correct 150 ms 44756 KB Output is correct
37 Correct 758 ms 67704 KB Output is correct
38 Correct 855 ms 67636 KB Output is correct
39 Correct 904 ms 67700 KB Output is correct
40 Correct 747 ms 64156 KB Output is correct
41 Correct 213 ms 45752 KB Output is correct
42 Correct 254 ms 46976 KB Output is correct
43 Correct 407 ms 52600 KB Output is correct
44 Correct 415 ms 52672 KB Output is correct
45 Correct 196 ms 33656 KB Output is correct
46 Correct 188 ms 29304 KB Output is correct
47 Correct 459 ms 52752 KB Output is correct
48 Incorrect 460 ms 52600 KB Output isn't correct