oj.uz

Submission #197897

# Submission time Handle Problem Language Result Execution time Memory
197897 2020-01-24T04:58:39 Z arnold518 Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 639988 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*3000+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 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.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));
		}
	}
 
	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, j=H.size()-1; i>=0; i--)
	{
		lowH[i]=H[i].y;
		Line t=Line(H[i].y+1, H[i].x/3000, H[i].x%3000);
		for(; j>=0 && t<H[j]; j--);
		if(j>=0 && t==H[j]) lowH[i]=lowH[j];
	}
 
	for(i=V.size()-1, j=V.size()-1; i>=0; i--)
	{
		lowV[i]=V[i].y;
		Line t=Line(V[i].y+1, V[i].x/3000, V[i].x%3000);
		for(; j>=0 && t<V[j]; j--);
		if(j>=0 && t==V[j]) lowV[i]=lowV[j];
	}
 	
 	vector<pair<Line, pii>> 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, pii(i, j)});
 		VT.push_back({tl, pii(i, j)});
 	}

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

 	sort(VT.begin(), VT.end());
 	for(i=0, j=0; i<VT.size(); i++)
 	{
 		for(; j<V.size() && V[j]<VT[i].first; j++);
 		if(j<V.size() && VT[i].first==V[j]) posV[VT[i].second.first][VT[i].second.second]=j;
 		else posV[VT[i].second.first][VT[i].second.second]=-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]*3000+R[i][j], U[i][j]*3000+D[i][j]});
	}
	sort(ans.begin(), ans.end());
	ans.erase(unique(ans.begin(), ans.end()), ans.end());
	return ans.size();
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:142:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0, j=0; i<HT.size(); i++)
                 ~^~~~~~~~~~
rect.cpp:144:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(; j<H.size() && H[j]<HT[i].first; j++);
          ~^~~~~~~~~
rect.cpp:145:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(j<H.size() && HT[i].first==H[j]) posH[HT[i].second.first][HT[i].second.second]=j;
       ~^~~~~~~~~
rect.cpp:150:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0, j=0; i<VT.size(); i++)
                 ~^~~~~~~~~~
rect.cpp:152:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(; j<V.size() && V[j]<VT[i].first; j++);
          ~^~~~~~~~~
rect.cpp:153:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(j<V.size() && VT[i].first==V[j]) posV[VT[i].second.first][VT[i].second.second]=j;
       ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 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 1016 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 4 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 504 KB Output is correct
16 Correct 2 ms 504 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 888 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 2 ms 508 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 1016 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 4 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 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 7 ms 3448 KB Output is correct
18 Correct 7 ms 3448 KB Output is correct
19 Correct 7 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 8 ms 3416 KB Output is correct
22 Correct 8 ms 3416 KB Output is correct
23 Correct 8 ms 3416 KB Output is correct
24 Correct 6 ms 3064 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 888 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 2 ms 508 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 1016 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 4 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 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 7 ms 3448 KB Output is correct
18 Correct 7 ms 3448 KB Output is correct
19 Correct 7 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 8 ms 3416 KB Output is correct
22 Correct 8 ms 3416 KB Output is correct
23 Correct 8 ms 3416 KB Output is correct
24 Correct 6 ms 3064 KB Output is correct
25 Correct 30 ms 10688 KB Output is correct
26 Correct 32 ms 10680 KB Output is correct
27 Correct 30 ms 10692 KB Output is correct
28 Correct 25 ms 9068 KB Output is correct
29 Correct 32 ms 10432 KB Output is correct
30 Correct 34 ms 10560 KB Output is correct
31 Correct 33 ms 10436 KB Output is correct
32 Correct 32 ms 10344 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 888 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 2 ms 508 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 1016 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 4 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 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 7 ms 3448 KB Output is correct
18 Correct 7 ms 3448 KB Output is correct
19 Correct 7 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 8 ms 3416 KB Output is correct
22 Correct 8 ms 3416 KB Output is correct
23 Correct 8 ms 3416 KB Output is correct
24 Correct 6 ms 3064 KB Output is correct
25 Correct 30 ms 10688 KB Output is correct
26 Correct 32 ms 10680 KB Output is correct
27 Correct 30 ms 10692 KB Output is correct
28 Correct 25 ms 9068 KB Output is correct
29 Correct 32 ms 10432 KB Output is correct
30 Correct 34 ms 10560 KB Output is correct
31 Correct 33 ms 10436 KB Output is correct
32 Correct 32 ms 10344 KB Output is correct
33 Correct 120 ms 42596 KB Output is correct
34 Correct 131 ms 42456 KB Output is correct
35 Correct 118 ms 42672 KB Output is correct
36 Correct 120 ms 42592 KB Output is correct
37 Correct 338 ms 75312 KB Output is correct
38 Correct 342 ms 75352 KB Output is correct
39 Correct 336 ms 75568 KB Output is correct
40 Correct 324 ms 70976 KB Output is correct
41 Correct 209 ms 54104 KB Output is correct
42 Correct 266 ms 56028 KB Output is correct
43 Correct 387 ms 68580 KB Output is correct
44 Correct 389 ms 70700 KB Output is correct
45 Correct 198 ms 46916 KB Output is correct
46 Correct 184 ms 37204 KB Output is correct
47 Correct 388 ms 69588 KB Output is correct
48 Correct 389 ms 70484 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 1272 KB Output is correct
52 Correct 3 ms 888 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 1016 KB Output is correct
2 Correct 4 ms 892 KB Output is correct
3 Correct 18 ms 604 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 888 KB Output is correct
6 Correct 4 ms 760 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 4 ms 760 KB Output is correct
9 Correct 4 ms 888 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 1281 ms 184808 KB Output is correct
3 Correct 2912 ms 390120 KB Output is correct
4 Correct 2853 ms 391868 KB Output is correct
5 Correct 2838 ms 391948 KB Output is correct
6 Correct 310 ms 91256 KB Output is correct
7 Correct 676 ms 174328 KB Output is correct
8 Correct 717 ms 177528 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 888 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 2 ms 508 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 1016 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 4 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 504 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 7 ms 3448 KB Output is correct
18 Correct 7 ms 3448 KB Output is correct
19 Correct 7 ms 3448 KB Output is correct
20 Correct 7 ms 3192 KB Output is correct
21 Correct 8 ms 3416 KB Output is correct
22 Correct 8 ms 3416 KB Output is correct
23 Correct 8 ms 3416 KB Output is correct
24 Correct 6 ms 3064 KB Output is correct
25 Correct 30 ms 10688 KB Output is correct
26 Correct 32 ms 10680 KB Output is correct
27 Correct 30 ms 10692 KB Output is correct
28 Correct 25 ms 9068 KB Output is correct
29 Correct 32 ms 10432 KB Output is correct
30 Correct 34 ms 10560 KB Output is correct
31 Correct 33 ms 10436 KB Output is correct
32 Correct 32 ms 10344 KB Output is correct
33 Correct 120 ms 42596 KB Output is correct
34 Correct 131 ms 42456 KB Output is correct
35 Correct 118 ms 42672 KB Output is correct
36 Correct 120 ms 42592 KB Output is correct
37 Correct 338 ms 75312 KB Output is correct
38 Correct 342 ms 75352 KB Output is correct
39 Correct 336 ms 75568 KB Output is correct
40 Correct 324 ms 70976 KB Output is correct
41 Correct 209 ms 54104 KB Output is correct
42 Correct 266 ms 56028 KB Output is correct
43 Correct 387 ms 68580 KB Output is correct
44 Correct 389 ms 70700 KB Output is correct
45 Correct 198 ms 46916 KB Output is correct
46 Correct 184 ms 37204 KB Output is correct
47 Correct 388 ms 69588 KB Output is correct
48 Correct 389 ms 70484 KB Output is correct
49 Correct 4 ms 1016 KB Output is correct
50 Correct 4 ms 892 KB Output is correct
51 Correct 18 ms 604 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 4 ms 888 KB Output is correct
54 Correct 4 ms 760 KB Output is correct
55 Correct 4 ms 888 KB Output is correct
56 Correct 4 ms 760 KB Output is correct
57 Correct 4 ms 888 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 1281 ms 184808 KB Output is correct
62 Correct 2912 ms 390120 KB Output is correct
63 Correct 2853 ms 391868 KB Output is correct
64 Correct 2838 ms 391948 KB Output is correct
65 Correct 310 ms 91256 KB Output is correct
66 Correct 676 ms 174328 KB Output is correct
67 Correct 717 ms 177528 KB Output is correct
68 Correct 1570 ms 275256 KB Output is correct
69 Correct 2216 ms 271612 KB Output is correct
70 Correct 1569 ms 271836 KB Output is correct
71 Correct 1551 ms 271840 KB Output is correct
72 Execution timed out 5073 ms 639988 KB Time limit exceeded
73 Halted 0 ms 0 KB -