oj.uz

Submission #197908

# Submission time Handle Problem Language Result Execution time Memory
197908 2020-01-24T05:41:43 Z arnold518 Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 613104 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#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, x;
	Line() {}
	Line(int y, int x1, int x2) : y(y), x((x1<<12)|x2) {}
	bool operator < (const Line &p) const
	{
		if(y!=p.y) return y<p.y;
		return x<p.x;
	}
 
	bool operator == (const Line &p) { return y==p.y && x==p.x; }
	bool operator != (const Line &p) { return !(y==p.y && x==p.x); }
};
 
Line H[MAXN*MAXN+10], V[MAXN*MAXN+10];
int HS, VS;
int lowH[MAXN*MAXN+10], lowV[MAXN*MAXN+10];
vector<pii> ans;
int posH[MAXN+10][MAXN+10], posV[MAXN+10][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[HS++]=Line(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[VS++]=Line(j, U[i][j]+1, D[i][j]-1);
		}
	}
 
	sort(H, H+HS);
	HS=unique(H, H+HS)-H;
 
	sort(V, V+VS);
	VS=unique(V, V+VS)-V;
 
	for(i=HS-1, j=HS-1; i>=0; i--)
	{
		lowH[i]=H[i].y;
		Line t=Line(H[i].y+1, H[i].x>>12, H[i].x&4095);
		for(; j>=0 && t<H[j]; j--);
		if(j>=0 && t==H[j]) lowH[i]=lowH[j];
	}
 
	for(i=VS-1, j=VS-1; i>=0; i--)
	{
		lowV[i]=V[i].y;
		Line t=Line(V[i].y+1, V[i].x>>12, V[i].x&4095);
		for(; j>=0 && t<V[j]; j--);
		if(j>=0 && t==V[j]) lowV[i]=lowV[j];
	}
 	
 	vector<pair<Line, int>> HT, VT;
	for(i=2; i<=N-1; i++) for(j=2; j<=M-1; 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};
		Line tl={L[i][j]+1, U[i][j]+1, D[i][j]-1};
 		
 		HT.push_back({tu, (i<<12)|j});
 		VT.push_back({tl, (i<<12)|j});
 	}

 	sort(HT.begin(), HT.end());
 	for(i=0, j=0; i<HT.size(); i++)
 	{
 		for(; j<HS && H[j]<HT[i].first; j++);
 		if(j<HS && HT[i].first==H[j]) posH[HT[i].second>>12][HT[i].second&4095]=j;
 		else posH[HT[i].second>>12][HT[i].second&4095]=-1;
 	}

 	sort(VT.begin(), VT.end());
 	for(i=0, j=0; i<VT.size(); i++)
 	{
 		for(; j<VS && V[j]<VT[i].first; j++);
 		if(j<VS && VT[i].first==V[j]) posV[VT[i].second>>12][VT[i].second&4095]=j;
 		else posV[VT[i].second>>12][VT[i].second&4095]=-1;
 	}

 	for(i=2; i<=N-1; i++) for(j=2; j<=M-1; 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;

		int it=posH[i][j];
		int jt=posV[i][j];
 		
 		if(it==-1 || jt==-1) continue;
 
		if(lowH[it]<D[i][j]-1) continue;
		if(lowV[jt]<R[i][j]-1) continue;
 
		ans.push_back({(L[i][j]<<12)|R[i][j], (U[i][j]<<12)|D[i][j]});
	}
	sort(ans.begin(), ans.end());
	return unique(ans.begin(), ans.end())-ans.begin();
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:144:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0, j=0; i<HT.size(); i++)
                 ~^~~~~~~~~~
rect.cpp:152:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0, j=0; i<VT.size(); i++)
                 ~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 888 KB Output is correct
6 Correct 3 ms 1268 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 1244 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 504 KB Output is correct
17 Correct 2 ms 248 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 632 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 888 KB Output is correct
6 Correct 3 ms 1268 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 1244 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 504 KB Output is correct
17 Correct 7 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 7 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3192 KB Output is correct
22 Correct 7 ms 3192 KB Output is correct
23 Correct 7 ms 3196 KB Output is correct
24 Correct 5 ms 2936 KB Output is correct
25 Correct 2 ms 248 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 632 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 888 KB Output is correct
6 Correct 3 ms 1268 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 1244 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 504 KB Output is correct
17 Correct 7 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 7 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3192 KB Output is correct
22 Correct 7 ms 3192 KB Output is correct
23 Correct 7 ms 3196 KB Output is correct
24 Correct 5 ms 2936 KB Output is correct
25 Correct 28 ms 10116 KB Output is correct
26 Correct 28 ms 10100 KB Output is correct
27 Correct 28 ms 10024 KB Output is correct
28 Correct 23 ms 8756 KB Output is correct
29 Correct 31 ms 9460 KB Output is correct
30 Correct 31 ms 9468 KB Output is correct
31 Correct 32 ms 9664 KB Output is correct
32 Correct 30 ms 9260 KB Output is correct
33 Correct 2 ms 248 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 632 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 888 KB Output is correct
6 Correct 3 ms 1268 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 1244 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 504 KB Output is correct
17 Correct 7 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 7 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3192 KB Output is correct
22 Correct 7 ms 3192 KB Output is correct
23 Correct 7 ms 3196 KB Output is correct
24 Correct 5 ms 2936 KB Output is correct
25 Correct 28 ms 10116 KB Output is correct
26 Correct 28 ms 10100 KB Output is correct
27 Correct 28 ms 10024 KB Output is correct
28 Correct 23 ms 8756 KB Output is correct
29 Correct 31 ms 9460 KB Output is correct
30 Correct 31 ms 9468 KB Output is correct
31 Correct 32 ms 9664 KB Output is correct
32 Correct 30 ms 9260 KB Output is correct
33 Correct 109 ms 39300 KB Output is correct
34 Correct 126 ms 39288 KB Output is correct
35 Correct 109 ms 39300 KB Output is correct
36 Correct 108 ms 39292 KB Output is correct
37 Correct 316 ms 68092 KB Output is correct
38 Correct 321 ms 68096 KB Output is correct
39 Correct 312 ms 68096 KB Output is correct
40 Correct 300 ms 64192 KB Output is correct
41 Correct 203 ms 48192 KB Output is correct
42 Correct 253 ms 52496 KB Output is correct
43 Correct 362 ms 62992 KB Output is correct
44 Correct 371 ms 63176 KB Output is correct
45 Correct 189 ms 41488 KB Output is correct
46 Correct 174 ms 31692 KB Output is correct
47 Correct 387 ms 63248 KB Output is correct
48 Correct 370 ms 62976 KB Output is correct
49 Correct 2 ms 248 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 1272 KB Output is correct
52 Correct 3 ms 1016 KB Output is correct
53 Correct 2 ms 632 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 636 KB Output is correct
2 Correct 1186 ms 172468 KB Output is correct
3 Correct 2707 ms 360596 KB Output is correct
4 Correct 2705 ms 362280 KB Output is correct
5 Correct 2744 ms 362328 KB Output is correct
6 Correct 308 ms 85468 KB Output is correct
7 Correct 686 ms 169376 KB Output is correct
8 Correct 703 ms 172408 KB Output is correct
9 Correct 2 ms 248 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 632 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 888 KB Output is correct
6 Correct 3 ms 1268 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 1244 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 504 KB Output is correct
17 Correct 7 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 7 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3192 KB Output is correct
22 Correct 7 ms 3192 KB Output is correct
23 Correct 7 ms 3196 KB Output is correct
24 Correct 5 ms 2936 KB Output is correct
25 Correct 28 ms 10116 KB Output is correct
26 Correct 28 ms 10100 KB Output is correct
27 Correct 28 ms 10024 KB Output is correct
28 Correct 23 ms 8756 KB Output is correct
29 Correct 31 ms 9460 KB Output is correct
30 Correct 31 ms 9468 KB Output is correct
31 Correct 32 ms 9664 KB Output is correct
32 Correct 30 ms 9260 KB Output is correct
33 Correct 109 ms 39300 KB Output is correct
34 Correct 126 ms 39288 KB Output is correct
35 Correct 109 ms 39300 KB Output is correct
36 Correct 108 ms 39292 KB Output is correct
37 Correct 316 ms 68092 KB Output is correct
38 Correct 321 ms 68096 KB Output is correct
39 Correct 312 ms 68096 KB Output is correct
40 Correct 300 ms 64192 KB Output is correct
41 Correct 203 ms 48192 KB Output is correct
42 Correct 253 ms 52496 KB Output is correct
43 Correct 362 ms 62992 KB Output is correct
44 Correct 371 ms 63176 KB Output is correct
45 Correct 189 ms 41488 KB Output is correct
46 Correct 174 ms 31692 KB Output is correct
47 Correct 387 ms 63248 KB Output is correct
48 Correct 370 ms 62976 KB Output is correct
49 Correct 4 ms 892 KB Output is correct
50 Correct 3 ms 888 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 4 ms 760 KB Output is correct
54 Correct 4 ms 760 KB Output is correct
55 Correct 4 ms 760 KB Output is correct
56 Correct 4 ms 760 KB Output is correct
57 Correct 4 ms 760 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 3 ms 632 KB Output is correct
60 Correct 2 ms 636 KB Output is correct
61 Correct 1186 ms 172468 KB Output is correct
62 Correct 2707 ms 360596 KB Output is correct
63 Correct 2705 ms 362280 KB Output is correct
64 Correct 2744 ms 362328 KB Output is correct
65 Correct 308 ms 85468 KB Output is correct
66 Correct 686 ms 169376 KB Output is correct
67 Correct 703 ms 172408 KB Output is correct
68 Correct 1451 ms 265852 KB Output is correct
69 Correct 2050 ms 265904 KB Output is correct
70 Correct 1431 ms 266036 KB Output is correct
71 Correct 1450 ms 265880 KB Output is correct
72 Correct 4584 ms 613104 KB Output is correct
73 Correct 2924 ms 333108 KB Output is correct
74 Correct 3213 ms 413568 KB Output is correct
75 Execution timed out 5098 ms 561196 KB Time limit exceeded
76 Halted 0 ms 0 KB -