oj.uz

Submission #145025

# Submission time Handle Problem Language Result Execution time Memory
145025 2019-08-18T12:50:20 Z TadijaSebez Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 809532 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mt make_tuple
#define pb push_back
const int N=2505;
const int M=2*N;
const int inf=1e9+7;
int a[N][N],n,m,U1[N][N],D1[N][N],L1[N][N],R1[N][N],U2[N][N],D2[N][N],L2[N][N],R2[N][N],S[N],c;
struct SegmentTreeMax
{
	int mx[M];
	SegmentTreeMax(){ for(int i=0;i<M;i++) mx[i]=-inf;}
	void Set(int i, int f){ for(i+=N;i;i>>=1) mx[i]=max(mx[i],f);}
	int Get(int l, int r)
	{
		int ans=-inf;
		for(l+=N,r+=N;l<=r;l>>=1,r>>=1)
		{
			if(l%2==1) ans=max(ans,mx[l++]);
			if(r%2==0) ans=max(ans,mx[r--]);
		}
		return ans;
	}
} RMX[N],CMX[N];
struct SegmentTreeMin
{
	int mn[M];
	SegmentTreeMin(){ for(int i=0;i<M;i++) mn[i]=inf;}
	void Set(int i, int f){ for(i+=N;i;i>>=1) mn[i]=min(mn[i],f);}
	int Get(int l, int r)
	{
		int ans=inf;
		for(l+=N,r+=N;l<=r;l>>=1,r>>=1)
		{
			if(l%2==1) ans=min(ans,mn[l++]);
			if(r%2==0) ans=min(ans,mn[r--]);
		}
		return ans;
	}
} RMN[N],CMN[N];
void Build()
{
	for(int i=1;i<=n;i++)
	{
		S[c=0]=0;
		for(int j=1;j<=m;j++)
		{
			while(c && a[i][S[c]]<=a[i][j]) c--;
			L1[i][j]=S[c];S[++c]=j;
		}
		S[c=0]=m+1;
		for(int j=m;j>=1;j--)
		{
			while(c && a[i][S[c]]<=a[i][j]) c--;
			R1[i][j]=S[c];S[++c]=j;
		}
		S[c=0]=0;
		for(int j=1;j<=m;j++)
		{
			while(c && a[i][S[c]]<a[i][j]) c--;
			L2[i][j]=S[c];S[++c]=j;
			CMX[j].Set(i,L2[i][j]);
		}
		S[c=0]=m+1;
		for(int j=m;j>=1;j--)
		{
			while(c && a[i][S[c]]<a[i][j]) c--;
			R2[i][j]=S[c];S[++c]=j;
			CMN[j].Set(i,R2[i][j]);
		}
	}
	for(int j=1;j<=m;j++)
	{
		S[c=0]=0;
		for(int i=1;i<=n;i++)
		{
			while(c && a[S[c]][j]<=a[i][j]) c--;
			U1[i][j]=S[c];S[++c]=i;
		}
		S[c=0]=n+1;
		for(int i=n;i>=1;i--)
		{
			while(c && a[S[c]][j]<=a[i][j]) c--;
			D1[i][j]=S[c];S[++c]=i;
		}
		S[c=0]=0;
		for(int i=1;i<=n;i++)
		{
			while(c && a[S[c]][j]<a[i][j]) c--;
			U2[i][j]=S[c];S[++c]=i;
			RMX[i].Set(j,U2[i][j]);
		}
		S[c=0]=n+1;
		for(int i=n;i>=1;i--)
		{
			while(c && a[S[c]][j]<a[i][j]) c--;
			D2[i][j]=S[c];S[++c]=i;
			RMN[i].Set(j,D2[i][j]);
		}
	}
}
/*struct Rectangle
{
	int x1,y1,x2,y2;
	Rectangle(){}
	Rectangle(int a, int b, int c, int d):x1(a),y1(b),x2(c),y2(d){}
	bool operator == (Rectangle b){ return mt(x1,y1,x2,y2)==mt(b.x1,b.y1,b.x2,b.y2);}
	bool operator < (Rectangle b){ return mt(x1,y1,x2,y2)<mt(b.x1,b.y1,b.x2,b.y2);}
};*/
//vector<Rectangle> work;
vector<pair<int,int>> work[N][N];
void Try(int x, int y)
{
	if(L1[x][y]!=0 && R1[x][y]!=m+1 && U1[x][y]!=0 && D1[x][y]!=n+1)
	{
		int x1=U1[x][y];
		int y1=L1[x][y];
		int x2=D1[x][y];
		int y2=R1[x][y];
		//work.pb(Rectangle(x1,y1,x2,y2));
		work[x1][y1].pb({x2,y2});
	}
}
bool was[N][N];
ll Solve()
{
	Build();
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) Try(i,j);
	//sort(work.begin(),work.end());
	//work.resize(unique(work.begin(),work.end())-work.begin());
	ll ans=0;
	for(int x1=1;x1<=n;x1++)
	{
		for(int y1=1;y1<=m;y1++)
		{
			for(auto p:work[x1][y1])
			{
				int x2,y2;
				tie(x2,y2)=p;
				if(was[x2][y2]) continue;
				was[x2][y2]=1;
				int ok=0;
				if(RMN[x1].Get(y1+1,y2-1)>=x2) ok++;
				if(RMX[x2].Get(y1+1,y2-1)<=x1) ok++;
				if(CMN[y1].Get(x1+1,x2-1)>=y2) ok++;
				if(CMX[y2].Get(x1+1,x2-1)<=y1) ok++;
				if(ok==4) ans++;
			}
			for(auto p:work[x1][y1])
			{
				int x2,y2;
				tie(x2,y2)=p;
				was[x2][y2]=0;
			}
		}
	}
	/*for(Rectangle r:work)
	{
		int x1,y1,x2,y2;
		tie(x1,y1,x2,y2)=mt(r.x1,r.y1,r.x2,r.y2);
		int ok=0;
		if(RMN[x1].Get(y1+1,y2-1)>=x2) ok++;
		if(RMX[x2].Get(y1+1,y2-1)<=x1) ok++;
		if(CMN[y1].Get(x1+1,x2-1)>=y2) ok++;
		if(CMX[y2].Get(x1+1,x2-1)<=y1) ok++;
		if(ok==4) ans++;
	}*/
	return ans;
}
ll count_rectangles(vector<vector<int> > a)
{
	n=a.size();m=a[0].size();
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) ::a[i][j]=a[i-1][j-1];
	return Solve();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 344440 KB Output is correct
2 Correct 305 ms 345336 KB Output is correct
3 Correct 306 ms 345336 KB Output is correct
4 Correct 307 ms 345336 KB Output is correct
5 Correct 307 ms 345376 KB Output is correct
6 Correct 339 ms 345336 KB Output is correct
7 Correct 316 ms 345336 KB Output is correct
8 Correct 302 ms 344696 KB Output is correct
9 Correct 302 ms 345336 KB Output is correct
10 Correct 310 ms 345484 KB Output is correct
11 Correct 303 ms 345464 KB Output is correct
12 Correct 318 ms 345448 KB Output is correct
13 Correct 302 ms 344288 KB Output is correct
14 Correct 301 ms 344480 KB Output is correct
15 Correct 300 ms 344544 KB Output is correct
16 Correct 301 ms 344312 KB Output is correct
17 Correct 300 ms 344168 KB Output is correct
18 Correct 301 ms 344224 KB Output is correct
19 Correct 303 ms 345364 KB Output is correct
20 Correct 304 ms 345224 KB Output is correct
21 Correct 303 ms 344596 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 344440 KB Output is correct
2 Correct 305 ms 345336 KB Output is correct
3 Correct 306 ms 345336 KB Output is correct
4 Correct 307 ms 345336 KB Output is correct
5 Correct 307 ms 345376 KB Output is correct
6 Correct 339 ms 345336 KB Output is correct
7 Correct 316 ms 345336 KB Output is correct
8 Correct 302 ms 344696 KB Output is correct
9 Correct 302 ms 345336 KB Output is correct
10 Correct 310 ms 345484 KB Output is correct
11 Correct 303 ms 345464 KB Output is correct
12 Correct 318 ms 345448 KB Output is correct
13 Correct 302 ms 344288 KB Output is correct
14 Correct 301 ms 344480 KB Output is correct
15 Correct 300 ms 344544 KB Output is correct
16 Correct 301 ms 344312 KB Output is correct
17 Correct 311 ms 347552 KB Output is correct
18 Correct 305 ms 347512 KB Output is correct
19 Correct 308 ms 347588 KB Output is correct
20 Correct 304 ms 347640 KB Output is correct
21 Correct 307 ms 347552 KB Output is correct
22 Correct 306 ms 347660 KB Output is correct
23 Correct 306 ms 347640 KB Output is correct
24 Correct 307 ms 347468 KB Output is correct
25 Correct 300 ms 344168 KB Output is correct
26 Correct 301 ms 344224 KB Output is correct
27 Correct 303 ms 345364 KB Output is correct
28 Correct 304 ms 345224 KB Output is correct
29 Correct 303 ms 344596 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 344440 KB Output is correct
2 Correct 305 ms 345336 KB Output is correct
3 Correct 306 ms 345336 KB Output is correct
4 Correct 307 ms 345336 KB Output is correct
5 Correct 307 ms 345376 KB Output is correct
6 Correct 339 ms 345336 KB Output is correct
7 Correct 316 ms 345336 KB Output is correct
8 Correct 302 ms 344696 KB Output is correct
9 Correct 302 ms 345336 KB Output is correct
10 Correct 310 ms 345484 KB Output is correct
11 Correct 303 ms 345464 KB Output is correct
12 Correct 318 ms 345448 KB Output is correct
13 Correct 302 ms 344288 KB Output is correct
14 Correct 301 ms 344480 KB Output is correct
15 Correct 300 ms 344544 KB Output is correct
16 Correct 301 ms 344312 KB Output is correct
17 Correct 311 ms 347552 KB Output is correct
18 Correct 305 ms 347512 KB Output is correct
19 Correct 308 ms 347588 KB Output is correct
20 Correct 304 ms 347640 KB Output is correct
21 Correct 307 ms 347552 KB Output is correct
22 Correct 306 ms 347660 KB Output is correct
23 Correct 306 ms 347640 KB Output is correct
24 Correct 307 ms 347468 KB Output is correct
25 Correct 330 ms 354364 KB Output is correct
26 Correct 624 ms 354456 KB Output is correct
27 Correct 363 ms 354428 KB Output is correct
28 Correct 355 ms 354200 KB Output is correct
29 Correct 368 ms 354368 KB Output is correct
30 Correct 335 ms 354420 KB Output is correct
31 Correct 332 ms 354328 KB Output is correct
32 Correct 330 ms 354252 KB Output is correct
33 Correct 300 ms 344168 KB Output is correct
34 Correct 301 ms 344224 KB Output is correct
35 Correct 303 ms 345364 KB Output is correct
36 Correct 304 ms 345224 KB Output is correct
37 Correct 303 ms 344596 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 344440 KB Output is correct
2 Correct 305 ms 345336 KB Output is correct
3 Correct 306 ms 345336 KB Output is correct
4 Correct 307 ms 345336 KB Output is correct
5 Correct 307 ms 345376 KB Output is correct
6 Correct 339 ms 345336 KB Output is correct
7 Correct 316 ms 345336 KB Output is correct
8 Correct 302 ms 344696 KB Output is correct
9 Correct 302 ms 345336 KB Output is correct
10 Correct 310 ms 345484 KB Output is correct
11 Correct 303 ms 345464 KB Output is correct
12 Correct 318 ms 345448 KB Output is correct
13 Correct 302 ms 344288 KB Output is correct
14 Correct 301 ms 344480 KB Output is correct
15 Correct 300 ms 344544 KB Output is correct
16 Correct 301 ms 344312 KB Output is correct
17 Correct 311 ms 347552 KB Output is correct
18 Correct 305 ms 347512 KB Output is correct
19 Correct 308 ms 347588 KB Output is correct
20 Correct 304 ms 347640 KB Output is correct
21 Correct 307 ms 347552 KB Output is correct
22 Correct 306 ms 347660 KB Output is correct
23 Correct 306 ms 347640 KB Output is correct
24 Correct 307 ms 347468 KB Output is correct
25 Correct 330 ms 354364 KB Output is correct
26 Correct 624 ms 354456 KB Output is correct
27 Correct 363 ms 354428 KB Output is correct
28 Correct 355 ms 354200 KB Output is correct
29 Correct 368 ms 354368 KB Output is correct
30 Correct 335 ms 354420 KB Output is correct
31 Correct 332 ms 354328 KB Output is correct
32 Correct 330 ms 354252 KB Output is correct
33 Correct 547 ms 392328 KB Output is correct
34 Correct 552 ms 392316 KB Output is correct
35 Correct 553 ms 392368 KB Output is correct
36 Correct 550 ms 392440 KB Output is correct
37 Correct 698 ms 406008 KB Output is correct
38 Correct 692 ms 405932 KB Output is correct
39 Correct 693 ms 405892 KB Output is correct
40 Correct 673 ms 401852 KB Output is correct
41 Correct 608 ms 397196 KB Output is correct
42 Correct 631 ms 398744 KB Output is correct
43 Correct 719 ms 401656 KB Output is correct
44 Correct 701 ms 402680 KB Output is correct
45 Correct 509 ms 387348 KB Output is correct
46 Correct 494 ms 372860 KB Output is correct
47 Correct 666 ms 400932 KB Output is correct
48 Correct 676 ms 400732 KB Output is correct
49 Correct 300 ms 344168 KB Output is correct
50 Correct 301 ms 344224 KB Output is correct
51 Correct 303 ms 345364 KB Output is correct
52 Correct 304 ms 345224 KB Output is correct
53 Correct 303 ms 344596 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 344680 KB Output is correct
2 Correct 305 ms 344656 KB Output is correct
3 Correct 304 ms 344568 KB Output is correct
4 Correct 303 ms 344312 KB Output is correct
5 Correct 345 ms 344680 KB Output is correct
6 Correct 308 ms 344596 KB Output is correct
7 Correct 305 ms 344696 KB Output is correct
8 Correct 304 ms 344568 KB Output is correct
9 Correct 306 ms 344616 KB Output is correct
10 Correct 303 ms 344308 KB Output is correct
11 Correct 304 ms 344440 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 344572 KB Output is correct
2 Correct 2079 ms 506632 KB Output is correct
3 Correct 4091 ms 679400 KB Output is correct
4 Correct 4213 ms 681148 KB Output is correct
5 Correct 4322 ms 681312 KB Output is correct
6 Correct 1794 ms 477424 KB Output is correct
7 Correct 3100 ms 611132 KB Output is correct
8 Correct 3372 ms 614264 KB Output is correct
9 Correct 300 ms 344168 KB Output is correct
10 Correct 301 ms 344224 KB Output is correct
11 Correct 303 ms 345364 KB Output is correct
12 Correct 304 ms 345224 KB Output is correct
13 Correct 303 ms 344596 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 344440 KB Output is correct
2 Correct 305 ms 345336 KB Output is correct
3 Correct 306 ms 345336 KB Output is correct
4 Correct 307 ms 345336 KB Output is correct
5 Correct 307 ms 345376 KB Output is correct
6 Correct 339 ms 345336 KB Output is correct
7 Correct 316 ms 345336 KB Output is correct
8 Correct 302 ms 344696 KB Output is correct
9 Correct 302 ms 345336 KB Output is correct
10 Correct 310 ms 345484 KB Output is correct
11 Correct 303 ms 345464 KB Output is correct
12 Correct 318 ms 345448 KB Output is correct
13 Correct 302 ms 344288 KB Output is correct
14 Correct 301 ms 344480 KB Output is correct
15 Correct 300 ms 344544 KB Output is correct
16 Correct 301 ms 344312 KB Output is correct
17 Correct 311 ms 347552 KB Output is correct
18 Correct 305 ms 347512 KB Output is correct
19 Correct 308 ms 347588 KB Output is correct
20 Correct 304 ms 347640 KB Output is correct
21 Correct 307 ms 347552 KB Output is correct
22 Correct 306 ms 347660 KB Output is correct
23 Correct 306 ms 347640 KB Output is correct
24 Correct 307 ms 347468 KB Output is correct
25 Correct 330 ms 354364 KB Output is correct
26 Correct 624 ms 354456 KB Output is correct
27 Correct 363 ms 354428 KB Output is correct
28 Correct 355 ms 354200 KB Output is correct
29 Correct 368 ms 354368 KB Output is correct
30 Correct 335 ms 354420 KB Output is correct
31 Correct 332 ms 354328 KB Output is correct
32 Correct 330 ms 354252 KB Output is correct
33 Correct 547 ms 392328 KB Output is correct
34 Correct 552 ms 392316 KB Output is correct
35 Correct 553 ms 392368 KB Output is correct
36 Correct 550 ms 392440 KB Output is correct
37 Correct 698 ms 406008 KB Output is correct
38 Correct 692 ms 405932 KB Output is correct
39 Correct 693 ms 405892 KB Output is correct
40 Correct 673 ms 401852 KB Output is correct
41 Correct 608 ms 397196 KB Output is correct
42 Correct 631 ms 398744 KB Output is correct
43 Correct 719 ms 401656 KB Output is correct
44 Correct 701 ms 402680 KB Output is correct
45 Correct 509 ms 387348 KB Output is correct
46 Correct 494 ms 372860 KB Output is correct
47 Correct 666 ms 400932 KB Output is correct
48 Correct 676 ms 400732 KB Output is correct
49 Correct 304 ms 344680 KB Output is correct
50 Correct 305 ms 344656 KB Output is correct
51 Correct 304 ms 344568 KB Output is correct
52 Correct 303 ms 344312 KB Output is correct
53 Correct 345 ms 344680 KB Output is correct
54 Correct 308 ms 344596 KB Output is correct
55 Correct 305 ms 344696 KB Output is correct
56 Correct 304 ms 344568 KB Output is correct
57 Correct 306 ms 344616 KB Output is correct
58 Correct 303 ms 344308 KB Output is correct
59 Correct 304 ms 344440 KB Output is correct
60 Correct 326 ms 344572 KB Output is correct
61 Correct 2079 ms 506632 KB Output is correct
62 Correct 4091 ms 679400 KB Output is correct
63 Correct 4213 ms 681148 KB Output is correct
64 Correct 4322 ms 681312 KB Output is correct
65 Correct 1794 ms 477424 KB Output is correct
66 Correct 3100 ms 611132 KB Output is correct
67 Correct 3372 ms 614264 KB Output is correct
68 Correct 3377 ms 620220 KB Output is correct
69 Correct 3554 ms 620280 KB Output is correct
70 Correct 3392 ms 620252 KB Output is correct
71 Correct 3397 ms 620316 KB Output is correct
72 Execution timed out 5157 ms 809532 KB Time limit exceeded
73 Halted 0 ms 0 KB -