oj.uz

Submission #197904

# Submission time Handle Problem Language Result Execution time Memory
197904 2020-01-24T05:25:14 Z arnold518 Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 750724 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(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); }
};
 
vector<Line> H, V;
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];
 
void mysort(vector<Line>::iterator s, vector<Line>::iterator e)
{
	int i, j;
	vector<Line> X[3000], Y[3000], Z[3000];
	vector<Line>::iterator pt;
	for(auto it=s; it!=e; it++) X[(it->x)&4095].push_back(*it);
	for(i=0; i<=2501; i++) for(auto it : X[i]) Y[it.x>>12].push_back(it);
	for(i=0; i<=2501; i++) for(auto it : Y[i]) Z[it.y].push_back(it);
	for(i=0, pt=s; i<=2501; i++) for(auto jt : Z[i]) *pt=jt, pt++;
}

void mysort(vector<pair<Line, int>>::iterator s, vector<pair<Line, int>>::iterator e)
{
	int i, j;
	vector<pair<Line, int>> X[3000], Y[3000], Z[3000];
	vector<pair<Line, int>>::iterator pt;
	for(auto it=s; it!=e; it++) X[(it->first.x)&4095].push_back(*it);
	for(i=0; i<=2501; i++) for(auto it : X[i]) Y[it.first.x>>12].push_back(it);
	for(i=0; i<=2501; i++) for(auto it : Y[i]) Z[it.first.y].push_back(it);
	for(i=0, pt=s; i<=2501; i++) for(auto jt : Z[i]) *pt=jt, pt++;
}

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(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.push_back(Line(j, U[i][j]+1, D[i][j]-1));
		}
	}
 
	mysort(H.begin(), H.end());
	HS=unique(H.begin(), H.end())-H.begin();
 
	mysort(V.begin(), V.end());
	VS=unique(V.begin(), V.end())-V.begin();
 
	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});
 	}

 	mysort(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;
 	}

 	mysort(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 'void mysort(std::vector<Line>::iterator, std::vector<Line>::iterator)':
rect.cpp:40:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
rect.cpp: In function 'void mysort(std::vector<std::pair<Line, int> >::iterator, std::vector<std::pair<Line, int> >::iterator)':
rect.cpp:51:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:165:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0, j=0; i<HT.size(); i++)
                 ~^~~~~~~~~~
rect.cpp:173: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 2 ms 760 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 4 ms 1528 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 3 ms 1556 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 2 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 764 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 3 ms 636 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 632 KB Output is correct
19 Correct 4 ms 1400 KB Output is correct
20 Correct 3 ms 1144 KB Output is correct
21 Correct 2 ms 764 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 4 ms 1528 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 3 ms 1556 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 2 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 764 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 3 ms 636 KB Output is correct
17 Correct 8 ms 3632 KB Output is correct
18 Correct 8 ms 3716 KB Output is correct
19 Correct 9 ms 3632 KB Output is correct
20 Correct 8 ms 3428 KB Output is correct
21 Correct 8 ms 3600 KB Output is correct
22 Correct 9 ms 3732 KB Output is correct
23 Correct 11 ms 3620 KB Output is correct
24 Correct 7 ms 3236 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 632 KB Output is correct
27 Correct 4 ms 1400 KB Output is correct
28 Correct 3 ms 1144 KB Output is correct
29 Correct 2 ms 764 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 4 ms 1528 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 3 ms 1556 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 2 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 764 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 3 ms 636 KB Output is correct
17 Correct 8 ms 3632 KB Output is correct
18 Correct 8 ms 3716 KB Output is correct
19 Correct 9 ms 3632 KB Output is correct
20 Correct 8 ms 3428 KB Output is correct
21 Correct 8 ms 3600 KB Output is correct
22 Correct 9 ms 3732 KB Output is correct
23 Correct 11 ms 3620 KB Output is correct
24 Correct 7 ms 3236 KB Output is correct
25 Correct 27 ms 10780 KB Output is correct
26 Correct 30 ms 10876 KB Output is correct
27 Correct 30 ms 10992 KB Output is correct
28 Correct 24 ms 9304 KB Output is correct
29 Correct 32 ms 10456 KB Output is correct
30 Correct 32 ms 10660 KB Output is correct
31 Correct 33 ms 10576 KB Output is correct
32 Correct 35 ms 10344 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 632 KB Output is correct
35 Correct 4 ms 1400 KB Output is correct
36 Correct 3 ms 1144 KB Output is correct
37 Correct 2 ms 764 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 4 ms 1528 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 3 ms 1556 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 2 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 764 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 3 ms 636 KB Output is correct
17 Correct 8 ms 3632 KB Output is correct
18 Correct 8 ms 3716 KB Output is correct
19 Correct 9 ms 3632 KB Output is correct
20 Correct 8 ms 3428 KB Output is correct
21 Correct 8 ms 3600 KB Output is correct
22 Correct 9 ms 3732 KB Output is correct
23 Correct 11 ms 3620 KB Output is correct
24 Correct 7 ms 3236 KB Output is correct
25 Correct 27 ms 10780 KB Output is correct
26 Correct 30 ms 10876 KB Output is correct
27 Correct 30 ms 10992 KB Output is correct
28 Correct 24 ms 9304 KB Output is correct
29 Correct 32 ms 10456 KB Output is correct
30 Correct 32 ms 10660 KB Output is correct
31 Correct 33 ms 10576 KB Output is correct
32 Correct 35 ms 10344 KB Output is correct
33 Correct 142 ms 43784 KB Output is correct
34 Correct 124 ms 43780 KB Output is correct
35 Correct 120 ms 43680 KB Output is correct
36 Correct 131 ms 43940 KB Output is correct
37 Correct 379 ms 81636 KB Output is correct
38 Correct 334 ms 81764 KB Output is correct
39 Correct 350 ms 81980 KB Output is correct
40 Correct 328 ms 77000 KB Output is correct
41 Correct 201 ms 57204 KB Output is correct
42 Correct 242 ms 61808 KB Output is correct
43 Correct 376 ms 82824 KB Output is correct
44 Correct 365 ms 84688 KB Output is correct
45 Correct 184 ms 51048 KB Output is correct
46 Correct 174 ms 42596 KB Output is correct
47 Correct 350 ms 82184 KB Output is correct
48 Correct 360 ms 82808 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 2 ms 632 KB Output is correct
51 Correct 4 ms 1400 KB Output is correct
52 Correct 3 ms 1144 KB Output is correct
53 Correct 2 ms 764 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1244 KB Output is correct
2 Correct 5 ms 1264 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 6 ms 1272 KB Output is correct
6 Correct 6 ms 1276 KB Output is correct
7 Correct 5 ms 1272 KB Output is correct
8 Correct 5 ms 1272 KB Output is correct
9 Correct 6 ms 1272 KB Output is correct
10 Correct 4 ms 888 KB Output is correct
11 Correct 4 ms 1016 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 1260 ms 233584 KB Output is correct
3 Correct 2917 ms 485708 KB Output is correct
4 Correct 2909 ms 488096 KB Output is correct
5 Correct 2964 ms 488484 KB Output is correct
6 Correct 336 ms 85768 KB Output is correct
7 Correct 720 ms 170312 KB Output is correct
8 Correct 715 ms 173432 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 4 ms 1400 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 2 ms 764 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 760 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 3 ms 1528 KB Output is correct
4 Correct 4 ms 1528 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 3 ms 1556 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 2 ms 1528 KB Output is correct
10 Correct 3 ms 1528 KB Output is correct
11 Correct 3 ms 1528 KB Output is correct
12 Correct 4 ms 1528 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 764 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 3 ms 636 KB Output is correct
17 Correct 8 ms 3632 KB Output is correct
18 Correct 8 ms 3716 KB Output is correct
19 Correct 9 ms 3632 KB Output is correct
20 Correct 8 ms 3428 KB Output is correct
21 Correct 8 ms 3600 KB Output is correct
22 Correct 9 ms 3732 KB Output is correct
23 Correct 11 ms 3620 KB Output is correct
24 Correct 7 ms 3236 KB Output is correct
25 Correct 27 ms 10780 KB Output is correct
26 Correct 30 ms 10876 KB Output is correct
27 Correct 30 ms 10992 KB Output is correct
28 Correct 24 ms 9304 KB Output is correct
29 Correct 32 ms 10456 KB Output is correct
30 Correct 32 ms 10660 KB Output is correct
31 Correct 33 ms 10576 KB Output is correct
32 Correct 35 ms 10344 KB Output is correct
33 Correct 142 ms 43784 KB Output is correct
34 Correct 124 ms 43780 KB Output is correct
35 Correct 120 ms 43680 KB Output is correct
36 Correct 131 ms 43940 KB Output is correct
37 Correct 379 ms 81636 KB Output is correct
38 Correct 334 ms 81764 KB Output is correct
39 Correct 350 ms 81980 KB Output is correct
40 Correct 328 ms 77000 KB Output is correct
41 Correct 201 ms 57204 KB Output is correct
42 Correct 242 ms 61808 KB Output is correct
43 Correct 376 ms 82824 KB Output is correct
44 Correct 365 ms 84688 KB Output is correct
45 Correct 184 ms 51048 KB Output is correct
46 Correct 174 ms 42596 KB Output is correct
47 Correct 350 ms 82184 KB Output is correct
48 Correct 360 ms 82808 KB Output is correct
49 Correct 6 ms 1244 KB Output is correct
50 Correct 5 ms 1264 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 2 ms 632 KB Output is correct
53 Correct 6 ms 1272 KB Output is correct
54 Correct 6 ms 1276 KB Output is correct
55 Correct 5 ms 1272 KB Output is correct
56 Correct 5 ms 1272 KB Output is correct
57 Correct 6 ms 1272 KB Output is correct
58 Correct 4 ms 888 KB Output is correct
59 Correct 4 ms 1016 KB Output is correct
60 Correct 3 ms 760 KB Output is correct
61 Correct 1260 ms 233584 KB Output is correct
62 Correct 2917 ms 485708 KB Output is correct
63 Correct 2909 ms 488096 KB Output is correct
64 Correct 2964 ms 488484 KB Output is correct
65 Correct 336 ms 85768 KB Output is correct
66 Correct 720 ms 170312 KB Output is correct
67 Correct 715 ms 173432 KB Output is correct
68 Correct 1848 ms 322380 KB Output is correct
69 Correct 1890 ms 325768 KB Output is correct
70 Correct 1651 ms 325464 KB Output is correct
71 Correct 1651 ms 323496 KB Output is correct
72 Execution timed out 5095 ms 750724 KB Time limit exceeded
73 Halted 0 ms 0 KB -