oj.uz

Submission #197909

# Submission time Handle Problem Language Result Execution time Memory
197909 2020-01-24T05:47:25 Z arnold518 Rectangles (IOI19_rect) C++14
100 / 100
 4726 ms 611216 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); }
};

struct Data
{
	Line first; int second;
	Data() {}
	Data(Line a, int b) : first(a), second(b) {}
	bool operator < (const Data &p) const { return first<p.first; };
};
 
Line H[MAXN*MAXN+10], V[MAXN*MAXN+10];
int HS, VS;
int lowH[MAXN*MAXN+10], lowV[MAXN*MAXN+10];
ll ans[MAXN*MAXN+10], anss;
int posH[MAXN+10][MAXN+10], posV[MAXN+10][MAXN+10];
Data HT[MAXN*MAXN+10], VT[MAXN*MAXN+10];
int HTS, VTS;

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];
	}
 	
	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[HTS++]=Data(tu, (i<<12)|j);
 		VT[VTS++]=Data(tl, (i<<12)|j);
 	}

 	sort(HT, HT+HTS);
 	for(i=0, j=0; i<HTS; 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, VT+VTS);
 	for(i=0, j=0; i<VTS; 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[anss++]=(((L[i][j]<<12)|R[i][j])*1000000000ll+((U[i][j]<<12)|D[i][j]));
	}
	sort(ans, ans+anss);
	return unique(ans, ans+anss)-ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 1020 KB Output is correct
6 Correct 0 ms 1272 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 1272 KB Output is correct
10 Correct 4 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1400 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 632 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 1212 KB Output is correct
20 Correct 2 ms 936 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 0 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 3 ms 1020 KB Output is correct
6 Correct 0 ms 1272 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 1272 KB Output is correct
10 Correct 4 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1400 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 632 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 5 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 6 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3064 KB Output is correct
22 Correct 7 ms 3068 KB Output is correct
23 Correct 7 ms 3192 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 1212 KB Output is correct
28 Correct 2 ms 936 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 0 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 3 ms 1020 KB Output is correct
6 Correct 0 ms 1272 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 1272 KB Output is correct
10 Correct 4 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1400 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 632 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 5 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 6 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3064 KB Output is correct
22 Correct 7 ms 3068 KB Output is correct
23 Correct 7 ms 3192 KB Output is correct
24 Correct 5 ms 2936 KB Output is correct
25 Correct 24 ms 9592 KB Output is correct
26 Correct 24 ms 9596 KB Output is correct
27 Correct 25 ms 9592 KB Output is correct
28 Correct 21 ms 8568 KB Output is correct
29 Correct 28 ms 9336 KB Output is correct
30 Correct 29 ms 9208 KB Output is correct
31 Correct 28 ms 9208 KB Output is correct
32 Correct 28 ms 9080 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 1212 KB Output is correct
36 Correct 2 ms 936 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 0 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 3 ms 1020 KB Output is correct
6 Correct 0 ms 1272 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 1272 KB Output is correct
10 Correct 4 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1400 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 632 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 5 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 6 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3064 KB Output is correct
22 Correct 7 ms 3068 KB Output is correct
23 Correct 7 ms 3192 KB Output is correct
24 Correct 5 ms 2936 KB Output is correct
25 Correct 24 ms 9592 KB Output is correct
26 Correct 24 ms 9596 KB Output is correct
27 Correct 25 ms 9592 KB Output is correct
28 Correct 21 ms 8568 KB Output is correct
29 Correct 28 ms 9336 KB Output is correct
30 Correct 29 ms 9208 KB Output is correct
31 Correct 28 ms 9208 KB Output is correct
32 Correct 28 ms 9080 KB Output is correct
33 Correct 110 ms 39316 KB Output is correct
34 Correct 122 ms 39472 KB Output is correct
35 Correct 114 ms 39260 KB Output is correct
36 Correct 108 ms 39344 KB Output is correct
37 Correct 275 ms 64120 KB Output is correct
38 Correct 278 ms 63980 KB Output is correct
39 Correct 278 ms 64276 KB Output is correct
40 Correct 262 ms 60024 KB Output is correct
41 Correct 186 ms 48136 KB Output is correct
42 Correct 246 ms 51964 KB Output is correct
43 Correct 355 ms 60996 KB Output is correct
44 Correct 353 ms 61152 KB Output is correct
45 Correct 189 ms 40440 KB Output is correct
46 Correct 170 ms 30712 KB Output is correct
47 Correct 328 ms 61180 KB Output is correct
48 Correct 333 ms 61048 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 1212 KB Output is correct
52 Correct 2 ms 936 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 3 ms 888 KB Output is correct
2 Correct 3 ms 760 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 632 KB Output is correct
2 Correct 1096 ms 170344 KB Output is correct
3 Correct 2492 ms 356320 KB Output is correct
4 Correct 2509 ms 358028 KB Output is correct
5 Correct 2498 ms 358136 KB Output is correct
6 Correct 343 ms 85240 KB Output is correct
7 Correct 773 ms 169336 KB Output is correct
8 Correct 786 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 1212 KB Output is correct
12 Correct 2 ms 936 KB Output is correct
13 Correct 2 ms 632 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 3 ms 1020 KB Output is correct
6 Correct 0 ms 1272 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 1272 KB Output is correct
10 Correct 4 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1400 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 632 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 5 ms 3192 KB Output is correct
18 Correct 7 ms 3192 KB Output is correct
19 Correct 6 ms 3192 KB Output is correct
20 Correct 6 ms 3064 KB Output is correct
21 Correct 7 ms 3064 KB Output is correct
22 Correct 7 ms 3068 KB Output is correct
23 Correct 7 ms 3192 KB Output is correct
24 Correct 5 ms 2936 KB Output is correct
25 Correct 24 ms 9592 KB Output is correct
26 Correct 24 ms 9596 KB Output is correct
27 Correct 25 ms 9592 KB Output is correct
28 Correct 21 ms 8568 KB Output is correct
29 Correct 28 ms 9336 KB Output is correct
30 Correct 29 ms 9208 KB Output is correct
31 Correct 28 ms 9208 KB Output is correct
32 Correct 28 ms 9080 KB Output is correct
33 Correct 110 ms 39316 KB Output is correct
34 Correct 122 ms 39472 KB Output is correct
35 Correct 114 ms 39260 KB Output is correct
36 Correct 108 ms 39344 KB Output is correct
37 Correct 275 ms 64120 KB Output is correct
38 Correct 278 ms 63980 KB Output is correct
39 Correct 278 ms 64276 KB Output is correct
40 Correct 262 ms 60024 KB Output is correct
41 Correct 186 ms 48136 KB Output is correct
42 Correct 246 ms 51964 KB Output is correct
43 Correct 355 ms 60996 KB Output is correct
44 Correct 353 ms 61152 KB Output is correct
45 Correct 189 ms 40440 KB Output is correct
46 Correct 170 ms 30712 KB Output is correct
47 Correct 328 ms 61180 KB Output is correct
48 Correct 333 ms 61048 KB Output is correct
49 Correct 3 ms 888 KB Output is correct
50 Correct 3 ms 760 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 632 KB Output is correct
61 Correct 1096 ms 170344 KB Output is correct
62 Correct 2492 ms 356320 KB Output is correct
63 Correct 2509 ms 358028 KB Output is correct
64 Correct 2498 ms 358136 KB Output is correct
65 Correct 343 ms 85240 KB Output is correct
66 Correct 773 ms 169336 KB Output is correct
67 Correct 786 ms 172408 KB Output is correct
68 Correct 1584 ms 265948 KB Output is correct
69 Correct 2196 ms 265932 KB Output is correct
70 Correct 1480 ms 265856 KB Output is correct
71 Correct 1443 ms 265848 KB Output is correct
72 Correct 3980 ms 563704 KB Output is correct
73 Correct 2687 ms 316720 KB Output is correct
74 Correct 2972 ms 397296 KB Output is correct
75 Correct 4602 ms 528248 KB Output is correct
76 Correct 2742 ms 345980 KB Output is correct
77 Correct 3783 ms 495992 KB Output is correct
78 Correct 4726 ms 577104 KB Output is correct
79 Correct 2664 ms 340200 KB Output is correct
80 Correct 4631 ms 579000 KB Output is correct
81 Correct 4518 ms 563960 KB Output is correct
82 Correct 2438 ms 435604 KB Output is correct
83 Correct 3961 ms 610232 KB Output is correct
84 Correct 3990 ms 611108 KB Output is correct
85 Correct 4006 ms 611216 KB Output is correct
86 Correct 2 ms 248 KB Output is correct
87 Correct 2 ms 376 KB Output is correct
88 Correct 3 ms 1212 KB Output is correct
89 Correct 2 ms 936 KB Output is correct
90 Correct 2 ms 632 KB Output is correct