oj.uz

Submission #197886

# Submission time Handle Problem Language Result Execution time Memory
197886 2020-01-24T03:33:57 Z arnold518 Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 397008 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2500;

int N, M, A[MAXN+10][MAXN+10];
int L[MAXN+10][MAXN+10], R[MAXN+10][MAXN+10], U[MAXN+10][MAXN+10], D[MAXN+10][MAXN+10];

struct Line
{
	int y, x1, x2;
	bool operator < (const Line &p) const
	{
		if(y!=p.y) return y<p.y;
		if(x1!=p.x1) return x1<p.x1;
		return x2<p.x2;
	}

	bool operator == (const Line &p) { return y==p.y && x1==p.x1 && x2==p.x2; }
};

vector<Line> H, V;
int lowH[MAXN*MAXN+10], lowV[MAXN*MAXN+10];

ll count_rectangles(vector<vector<int>> _A)
{
	int i, j;

	N=_A.size(); M=_A[0].size();
	for(i=1; i<=N; i++) for(j=1; j<=M; j++) A[i][j]=_A[i-1][j-1];

	for(i=1; i<=N; i++)
	{
		vector<int> S;
		S.clear();
		for(j=1; j<=M; j++) L[i][j]=0;
		for(j=1; j<=M; j++)
		{
			while(!S.empty() && A[i][S.back()]<=A[i][j]) S.pop_back();
			if(!S.empty()) L[i][j]=S.back();
			S.push_back(j);
		}

		S.clear();
		for(j=1; j<=M; j++) R[i][j]=M+1;
		for(j=M; j>=1; j--)
		{
			while(!S.empty() && A[i][S.back()]<=A[i][j]) S.pop_back();
			if(!S.empty()) R[i][j]=S.back();
			S.push_back(j);
		}
	}
	
	for(i=1; i<=M; i++)
	{
		vector<int> S;
		S.clear();
		for(j=1; j<=N; j++) U[j][i]=0;
		for(j=1; j<=N; j++)
		{
			while(!S.empty() && A[S.back()][i]<=A[j][i]) S.pop_back();
			if(!S.empty()) U[j][i]=S.back();
			S.push_back(j);
		}

		S.clear();
		for(j=1; j<=N; j++) D[j][i]=N+1;
		for(j=N; j>=1; j--)
		{
			while(!S.empty() && A[S.back()][i]<=A[j][i]) S.pop_back();
			if(!S.empty()) D[j][i]=S.back();
			S.push_back(j);
		}
	}

	for(i=1; i<=N; i++)
	{
		for(j=1; j<=M; j++)
		{
			if(L[i][j]==0) continue;
			if(R[i][j]==M+1) continue;
			H.push_back({i, L[i][j]+1, R[i][j]-1});
		}
		for(j=1; j<=M; j++)
		{
			if(U[i][j]==0) continue;
			if(D[i][j]==N+1) continue;
			V.push_back({j, U[i][j]+1, D[i][j]-1});
		}
	}

	sort(H.begin(), H.end());
	H.erase(unique(H.begin(), H.end()), H.end());

	sort(V.begin(), V.end());
	V.erase(unique(V.begin(), V.end()), V.end());

	for(i=H.size()-1; i>=0; i--)
	{
		lowH[i]=H[i].y;
		Line t={H[i].y+1, H[i].x1, H[i].x2};
		if(binary_search(H.begin(), H.end(), t)) lowH[i]=lowH[lower_bound(H.begin(), H.end(), t)-H.begin()];
	}

	for(i=V.size()-1; i>=0; i--)
	{
		lowV[i]=V[i].y;
		Line t={V[i].y+1, V[i].x1, V[i].x2};
		if(binary_search(V.begin(), V.end(), t)) lowV[i]=lowV[lower_bound(V.begin(), V.end(), t)-V.begin()];
	}

	vector<pair<pii, pii>> ans;
	for(i=1; i<=N; i++) for(j=1; j<=M; j++)
	{

		//printf("%d %d : %d %d %d %d\n", i, j, L[i][j], R[i][j], U[i][j], D[i][j]);
		if(L[i][j]==0) continue;
		if(R[i][j]==M+1) continue;
		if(U[i][j]==0) continue;
		if(D[i][j]==N+1) continue;

		Line tu={U[i][j]+1, L[i][j]+1, R[i][j]-1};
		if(!binary_search(H.begin(), H.end(), tu)) continue;
		Line tl={L[i][j]+1, U[i][j]+1, D[i][j]-1};
		if(!binary_search(V.begin(), V.end(), tl)) continue;

		if(lowH[lower_bound(H.begin(), H.end(), tu)-H.begin()]<D[i][j]-1) continue;
		if(lowV[lower_bound(V.begin(), V.end(), tl)-V.begin()]<R[i][j]-1) continue;

		ans.push_back({pii(L[i][j]+1, R[i][j]-1), pii(U[i][j]+1, D[i][j]-1)});
	}
	sort(ans.begin(), ans.end());
	ans.erase(unique(ans.begin(), ans.end()), ans.end());
	return ans.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 1016 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 888 KB Output is correct
6 Correct 1 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 4 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 7 ms 1016 KB Output is correct
13 Correct 1 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 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 1016 KB Output is correct
20 Correct 1 ms 888 KB Output is correct
21 Correct 2 ms 508 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 1016 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 888 KB Output is correct
6 Correct 1 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 4 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 7 ms 1016 KB Output is correct
13 Correct 1 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 11 ms 2680 KB Output is correct
18 Correct 10 ms 2684 KB Output is correct
19 Correct 9 ms 2680 KB Output is correct
20 Correct 6 ms 2296 KB Output is correct
21 Correct 12 ms 2552 KB Output is correct
22 Correct 8 ms 2552 KB Output is correct
23 Correct 7 ms 2552 KB Output is correct
24 Correct 6 ms 2296 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 1016 KB Output is correct
28 Correct 1 ms 888 KB Output is correct
29 Correct 2 ms 508 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 1016 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 888 KB Output is correct
6 Correct 1 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 4 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 7 ms 1016 KB Output is correct
13 Correct 1 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 11 ms 2680 KB Output is correct
18 Correct 10 ms 2684 KB Output is correct
19 Correct 9 ms 2680 KB Output is correct
20 Correct 6 ms 2296 KB Output is correct
21 Correct 12 ms 2552 KB Output is correct
22 Correct 8 ms 2552 KB Output is correct
23 Correct 7 ms 2552 KB Output is correct
24 Correct 6 ms 2296 KB Output is correct
25 Correct 50 ms 8476 KB Output is correct
26 Correct 54 ms 8516 KB Output is correct
27 Correct 55 ms 8684 KB Output is correct
28 Correct 27 ms 6492 KB Output is correct
29 Correct 46 ms 7272 KB Output is correct
30 Correct 43 ms 7532 KB Output is correct
31 Correct 42 ms 7724 KB Output is correct
32 Correct 40 ms 7328 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 1016 KB Output is correct
36 Correct 1 ms 888 KB Output is correct
37 Correct 2 ms 508 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 1016 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 888 KB Output is correct
6 Correct 1 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 4 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 7 ms 1016 KB Output is correct
13 Correct 1 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 11 ms 2680 KB Output is correct
18 Correct 10 ms 2684 KB Output is correct
19 Correct 9 ms 2680 KB Output is correct
20 Correct 6 ms 2296 KB Output is correct
21 Correct 12 ms 2552 KB Output is correct
22 Correct 8 ms 2552 KB Output is correct
23 Correct 7 ms 2552 KB Output is correct
24 Correct 6 ms 2296 KB Output is correct
25 Correct 50 ms 8476 KB Output is correct
26 Correct 54 ms 8516 KB Output is correct
27 Correct 55 ms 8684 KB Output is correct
28 Correct 27 ms 6492 KB Output is correct
29 Correct 46 ms 7272 KB Output is correct
30 Correct 43 ms 7532 KB Output is correct
31 Correct 42 ms 7724 KB Output is correct
32 Correct 40 ms 7328 KB Output is correct
33 Correct 165 ms 38848 KB Output is correct
34 Correct 175 ms 38752 KB Output is correct
35 Correct 167 ms 38876 KB Output is correct
36 Correct 159 ms 38752 KB Output is correct
37 Correct 686 ms 58800 KB Output is correct
38 Correct 685 ms 58956 KB Output is correct
39 Correct 667 ms 59108 KB Output is correct
40 Correct 623 ms 56260 KB Output is correct
41 Correct 217 ms 36652 KB Output is correct
42 Correct 288 ms 40004 KB Output is correct
43 Correct 534 ms 51504 KB Output is correct
44 Correct 511 ms 53576 KB Output is correct
45 Correct 253 ms 33852 KB Output is correct
46 Correct 239 ms 26896 KB Output is correct
47 Correct 554 ms 53248 KB Output is correct
48 Correct 529 ms 54072 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 1016 KB Output is correct
52 Correct 1 ms 888 KB Output is correct
53 Correct 2 ms 508 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 980 KB Output is correct
2 Correct 6 ms 888 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 5 ms 888 KB Output is correct
8 Correct 5 ms 888 KB Output is correct
9 Correct 5 ms 888 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 4 ms 760 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 1373 ms 134796 KB Output is correct
3 Correct 3264 ms 271724 KB Output is correct
4 Correct 3180 ms 272988 KB Output is correct
5 Correct 3185 ms 272816 KB Output is correct
6 Correct 319 ms 86620 KB Output is correct
7 Correct 707 ms 171132 KB Output is correct
8 Correct 748 ms 174192 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 1016 KB Output is correct
12 Correct 1 ms 888 KB Output is correct
13 Correct 2 ms 508 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 1016 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 888 KB Output is correct
6 Correct 1 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 1016 KB Output is correct
10 Correct 4 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 7 ms 1016 KB Output is correct
13 Correct 1 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 11 ms 2680 KB Output is correct
18 Correct 10 ms 2684 KB Output is correct
19 Correct 9 ms 2680 KB Output is correct
20 Correct 6 ms 2296 KB Output is correct
21 Correct 12 ms 2552 KB Output is correct
22 Correct 8 ms 2552 KB Output is correct
23 Correct 7 ms 2552 KB Output is correct
24 Correct 6 ms 2296 KB Output is correct
25 Correct 50 ms 8476 KB Output is correct
26 Correct 54 ms 8516 KB Output is correct
27 Correct 55 ms 8684 KB Output is correct
28 Correct 27 ms 6492 KB Output is correct
29 Correct 46 ms 7272 KB Output is correct
30 Correct 43 ms 7532 KB Output is correct
31 Correct 42 ms 7724 KB Output is correct
32 Correct 40 ms 7328 KB Output is correct
33 Correct 165 ms 38848 KB Output is correct
34 Correct 175 ms 38752 KB Output is correct
35 Correct 167 ms 38876 KB Output is correct
36 Correct 159 ms 38752 KB Output is correct
37 Correct 686 ms 58800 KB Output is correct
38 Correct 685 ms 58956 KB Output is correct
39 Correct 667 ms 59108 KB Output is correct
40 Correct 623 ms 56260 KB Output is correct
41 Correct 217 ms 36652 KB Output is correct
42 Correct 288 ms 40004 KB Output is correct
43 Correct 534 ms 51504 KB Output is correct
44 Correct 511 ms 53576 KB Output is correct
45 Correct 253 ms 33852 KB Output is correct
46 Correct 239 ms 26896 KB Output is correct
47 Correct 554 ms 53248 KB Output is correct
48 Correct 529 ms 54072 KB Output is correct
49 Correct 5 ms 980 KB Output is correct
50 Correct 6 ms 888 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 3 ms 376 KB Output is correct
53 Correct 6 ms 888 KB Output is correct
54 Correct 6 ms 888 KB Output is correct
55 Correct 5 ms 888 KB Output is correct
56 Correct 5 ms 888 KB Output is correct
57 Correct 5 ms 888 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 4 ms 760 KB Output is correct
60 Correct 2 ms 508 KB Output is correct
61 Correct 1373 ms 134796 KB Output is correct
62 Correct 3264 ms 271724 KB Output is correct
63 Correct 3180 ms 272988 KB Output is correct
64 Correct 3185 ms 272816 KB Output is correct
65 Correct 319 ms 86620 KB Output is correct
66 Correct 707 ms 171132 KB Output is correct
67 Correct 748 ms 174192 KB Output is correct
68 Correct 2215 ms 288696 KB Output is correct
69 Correct 3717 ms 286968 KB Output is correct
70 Correct 2097 ms 286952 KB Output is correct
71 Correct 2041 ms 286964 KB Output is correct
72 Execution timed out 5037 ms 397008 KB Time limit exceeded
73 Halted 0 ms 0 KB -