oj.uz

답안 #145028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145028 2019-08-18T12:55:30 Z TadijaSebez Rectangles (IOI19_rect) C++14
100 / 100
 4056 ms 809504 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,tmp[N];
struct SegmentTreeMax
{
	int mx[M];
	SegmentTreeMax(){ for(int i=0;i<M;i++) mx[i]=-inf;}
	void Build(int a[])
	{
		for(int i=0;i<N;i++) mx[i+N]=a[i];
		for(int i=N-1;i;i--) mx[i]=max(mx[i<<1],mx[i<<1|1]);
	}
	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 Build(int a[])
	{
		for(int i=0;i<N;i++) mn[i+N]=a[i];
		for(int i=N-1;i;i--) mn[i]=min(mn[i<<1],mn[i<<1|1]);
	}
	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;
		}
		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;
		}
	}
	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;
		}
		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;
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++) tmp[j]=U2[i][j];
		RMX[i].Build(tmp);
		for(int j=1;j<=m;j++) tmp[j]=D2[i][j];
		RMN[i].Build(tmp);
	}
	for(int j=1;j<=m;j++)
	{
		for(int i=1;i<=n;i++) tmp[i]=L2[i][j];
		CMX[j].Build(tmp);
		for(int i=1;i<=n;i++) tmp[i]=R2[i][j];
		CMN[j].Build(tmp);
	}
}
/*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

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 344496 KB Output is correct
2 Correct 308 ms 345372 KB Output is correct
3 Correct 309 ms 345336 KB Output is correct
4 Correct 311 ms 345464 KB Output is correct
5 Correct 306 ms 345336 KB Output is correct
6 Correct 305 ms 345444 KB Output is correct
7 Correct 306 ms 345324 KB Output is correct
8 Correct 303 ms 344720 KB Output is correct
9 Correct 304 ms 345548 KB Output is correct
10 Correct 339 ms 345464 KB Output is correct
11 Correct 323 ms 345464 KB Output is correct
12 Correct 304 ms 345464 KB Output is correct
13 Correct 303 ms 344312 KB Output is correct
14 Correct 303 ms 344700 KB Output is correct
15 Correct 303 ms 344696 KB Output is correct
16 Correct 304 ms 344312 KB Output is correct
17 Correct 302 ms 344292 KB Output is correct
18 Correct 300 ms 344312 KB Output is correct
19 Correct 305 ms 345388 KB Output is correct
20 Correct 302 ms 345340 KB Output is correct
21 Correct 306 ms 344568 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 344496 KB Output is correct
2 Correct 308 ms 345372 KB Output is correct
3 Correct 309 ms 345336 KB Output is correct
4 Correct 311 ms 345464 KB Output is correct
5 Correct 306 ms 345336 KB Output is correct
6 Correct 305 ms 345444 KB Output is correct
7 Correct 306 ms 345324 KB Output is correct
8 Correct 303 ms 344720 KB Output is correct
9 Correct 304 ms 345548 KB Output is correct
10 Correct 339 ms 345464 KB Output is correct
11 Correct 323 ms 345464 KB Output is correct
12 Correct 304 ms 345464 KB Output is correct
13 Correct 303 ms 344312 KB Output is correct
14 Correct 303 ms 344700 KB Output is correct
15 Correct 303 ms 344696 KB Output is correct
16 Correct 304 ms 344312 KB Output is correct
17 Correct 309 ms 347640 KB Output is correct
18 Correct 306 ms 347640 KB Output is correct
19 Correct 307 ms 347576 KB Output is correct
20 Correct 320 ms 347640 KB Output is correct
21 Correct 311 ms 347640 KB Output is correct
22 Correct 308 ms 347656 KB Output is correct
23 Correct 309 ms 347744 KB Output is correct
24 Correct 307 ms 347512 KB Output is correct
25 Correct 302 ms 344292 KB Output is correct
26 Correct 300 ms 344312 KB Output is correct
27 Correct 305 ms 345388 KB Output is correct
28 Correct 302 ms 345340 KB Output is correct
29 Correct 306 ms 344568 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 344496 KB Output is correct
2 Correct 308 ms 345372 KB Output is correct
3 Correct 309 ms 345336 KB Output is correct
4 Correct 311 ms 345464 KB Output is correct
5 Correct 306 ms 345336 KB Output is correct
6 Correct 305 ms 345444 KB Output is correct
7 Correct 306 ms 345324 KB Output is correct
8 Correct 303 ms 344720 KB Output is correct
9 Correct 304 ms 345548 KB Output is correct
10 Correct 339 ms 345464 KB Output is correct
11 Correct 323 ms 345464 KB Output is correct
12 Correct 304 ms 345464 KB Output is correct
13 Correct 303 ms 344312 KB Output is correct
14 Correct 303 ms 344700 KB Output is correct
15 Correct 303 ms 344696 KB Output is correct
16 Correct 304 ms 344312 KB Output is correct
17 Correct 309 ms 347640 KB Output is correct
18 Correct 306 ms 347640 KB Output is correct
19 Correct 307 ms 347576 KB Output is correct
20 Correct 320 ms 347640 KB Output is correct
21 Correct 311 ms 347640 KB Output is correct
22 Correct 308 ms 347656 KB Output is correct
23 Correct 309 ms 347744 KB Output is correct
24 Correct 307 ms 347512 KB Output is correct
25 Correct 325 ms 354432 KB Output is correct
26 Correct 328 ms 354424 KB Output is correct
27 Correct 355 ms 354372 KB Output is correct
28 Correct 321 ms 354300 KB Output is correct
29 Correct 330 ms 354496 KB Output is correct
30 Correct 329 ms 354424 KB Output is correct
31 Correct 331 ms 354296 KB Output is correct
32 Correct 326 ms 354296 KB Output is correct
33 Correct 302 ms 344292 KB Output is correct
34 Correct 300 ms 344312 KB Output is correct
35 Correct 305 ms 345388 KB Output is correct
36 Correct 302 ms 345340 KB Output is correct
37 Correct 306 ms 344568 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 344496 KB Output is correct
2 Correct 308 ms 345372 KB Output is correct
3 Correct 309 ms 345336 KB Output is correct
4 Correct 311 ms 345464 KB Output is correct
5 Correct 306 ms 345336 KB Output is correct
6 Correct 305 ms 345444 KB Output is correct
7 Correct 306 ms 345324 KB Output is correct
8 Correct 303 ms 344720 KB Output is correct
9 Correct 304 ms 345548 KB Output is correct
10 Correct 339 ms 345464 KB Output is correct
11 Correct 323 ms 345464 KB Output is correct
12 Correct 304 ms 345464 KB Output is correct
13 Correct 303 ms 344312 KB Output is correct
14 Correct 303 ms 344700 KB Output is correct
15 Correct 303 ms 344696 KB Output is correct
16 Correct 304 ms 344312 KB Output is correct
17 Correct 309 ms 347640 KB Output is correct
18 Correct 306 ms 347640 KB Output is correct
19 Correct 307 ms 347576 KB Output is correct
20 Correct 320 ms 347640 KB Output is correct
21 Correct 311 ms 347640 KB Output is correct
22 Correct 308 ms 347656 KB Output is correct
23 Correct 309 ms 347744 KB Output is correct
24 Correct 307 ms 347512 KB Output is correct
25 Correct 325 ms 354432 KB Output is correct
26 Correct 328 ms 354424 KB Output is correct
27 Correct 355 ms 354372 KB Output is correct
28 Correct 321 ms 354300 KB Output is correct
29 Correct 330 ms 354496 KB Output is correct
30 Correct 329 ms 354424 KB Output is correct
31 Correct 331 ms 354296 KB Output is correct
32 Correct 326 ms 354296 KB Output is correct
33 Correct 479 ms 392368 KB Output is correct
34 Correct 429 ms 392312 KB Output is correct
35 Correct 446 ms 392312 KB Output is correct
36 Correct 439 ms 392416 KB Output is correct
37 Correct 579 ms 405952 KB Output is correct
38 Correct 568 ms 405880 KB Output is correct
39 Correct 574 ms 405944 KB Output is correct
40 Correct 558 ms 401912 KB Output is correct
41 Correct 507 ms 397176 KB Output is correct
42 Correct 520 ms 398836 KB Output is correct
43 Correct 588 ms 401612 KB Output is correct
44 Correct 584 ms 403576 KB Output is correct
45 Correct 454 ms 388132 KB Output is correct
46 Correct 461 ms 372896 KB Output is correct
47 Correct 552 ms 400732 KB Output is correct
48 Correct 557 ms 400760 KB Output is correct
49 Correct 302 ms 344292 KB Output is correct
50 Correct 300 ms 344312 KB Output is correct
51 Correct 305 ms 345388 KB Output is correct
52 Correct 302 ms 345340 KB Output is correct
53 Correct 306 ms 344568 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 329 ms 344824 KB Output is correct
2 Correct 326 ms 344708 KB Output is correct
3 Correct 328 ms 344696 KB Output is correct
4 Correct 312 ms 344440 KB Output is correct
5 Correct 329 ms 344568 KB Output is correct
6 Correct 369 ms 344540 KB Output is correct
7 Correct 386 ms 344568 KB Output is correct
8 Correct 336 ms 344576 KB Output is correct
9 Correct 335 ms 344644 KB Output is correct
10 Correct 365 ms 344392 KB Output is correct
11 Correct 330 ms 344588 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 344612 KB Output is correct
2 Correct 1328 ms 506488 KB Output is correct
3 Correct 2548 ms 679528 KB Output is correct
4 Correct 2615 ms 681332 KB Output is correct
5 Correct 2543 ms 681128 KB Output is correct
6 Correct 953 ms 477560 KB Output is correct
7 Correct 1668 ms 611200 KB Output is correct
8 Correct 1702 ms 614596 KB Output is correct
9 Correct 302 ms 344292 KB Output is correct
10 Correct 300 ms 344312 KB Output is correct
11 Correct 305 ms 345388 KB Output is correct
12 Correct 302 ms 345340 KB Output is correct
13 Correct 306 ms 344568 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 344496 KB Output is correct
2 Correct 308 ms 345372 KB Output is correct
3 Correct 309 ms 345336 KB Output is correct
4 Correct 311 ms 345464 KB Output is correct
5 Correct 306 ms 345336 KB Output is correct
6 Correct 305 ms 345444 KB Output is correct
7 Correct 306 ms 345324 KB Output is correct
8 Correct 303 ms 344720 KB Output is correct
9 Correct 304 ms 345548 KB Output is correct
10 Correct 339 ms 345464 KB Output is correct
11 Correct 323 ms 345464 KB Output is correct
12 Correct 304 ms 345464 KB Output is correct
13 Correct 303 ms 344312 KB Output is correct
14 Correct 303 ms 344700 KB Output is correct
15 Correct 303 ms 344696 KB Output is correct
16 Correct 304 ms 344312 KB Output is correct
17 Correct 309 ms 347640 KB Output is correct
18 Correct 306 ms 347640 KB Output is correct
19 Correct 307 ms 347576 KB Output is correct
20 Correct 320 ms 347640 KB Output is correct
21 Correct 311 ms 347640 KB Output is correct
22 Correct 308 ms 347656 KB Output is correct
23 Correct 309 ms 347744 KB Output is correct
24 Correct 307 ms 347512 KB Output is correct
25 Correct 325 ms 354432 KB Output is correct
26 Correct 328 ms 354424 KB Output is correct
27 Correct 355 ms 354372 KB Output is correct
28 Correct 321 ms 354300 KB Output is correct
29 Correct 330 ms 354496 KB Output is correct
30 Correct 329 ms 354424 KB Output is correct
31 Correct 331 ms 354296 KB Output is correct
32 Correct 326 ms 354296 KB Output is correct
33 Correct 479 ms 392368 KB Output is correct
34 Correct 429 ms 392312 KB Output is correct
35 Correct 446 ms 392312 KB Output is correct
36 Correct 439 ms 392416 KB Output is correct
37 Correct 579 ms 405952 KB Output is correct
38 Correct 568 ms 405880 KB Output is correct
39 Correct 574 ms 405944 KB Output is correct
40 Correct 558 ms 401912 KB Output is correct
41 Correct 507 ms 397176 KB Output is correct
42 Correct 520 ms 398836 KB Output is correct
43 Correct 588 ms 401612 KB Output is correct
44 Correct 584 ms 403576 KB Output is correct
45 Correct 454 ms 388132 KB Output is correct
46 Correct 461 ms 372896 KB Output is correct
47 Correct 552 ms 400732 KB Output is correct
48 Correct 557 ms 400760 KB Output is correct
49 Correct 329 ms 344824 KB Output is correct
50 Correct 326 ms 344708 KB Output is correct
51 Correct 328 ms 344696 KB Output is correct
52 Correct 312 ms 344440 KB Output is correct
53 Correct 329 ms 344568 KB Output is correct
54 Correct 369 ms 344540 KB Output is correct
55 Correct 386 ms 344568 KB Output is correct
56 Correct 336 ms 344576 KB Output is correct
57 Correct 335 ms 344644 KB Output is correct
58 Correct 365 ms 344392 KB Output is correct
59 Correct 330 ms 344588 KB Output is correct
60 Correct 303 ms 344612 KB Output is correct
61 Correct 1328 ms 506488 KB Output is correct
62 Correct 2548 ms 679528 KB Output is correct
63 Correct 2615 ms 681332 KB Output is correct
64 Correct 2543 ms 681128 KB Output is correct
65 Correct 953 ms 477560 KB Output is correct
66 Correct 1668 ms 611200 KB Output is correct
67 Correct 1702 ms 614596 KB Output is correct
68 Correct 1822 ms 620200 KB Output is correct
69 Correct 1816 ms 620360 KB Output is correct
70 Correct 1846 ms 620164 KB Output is correct
71 Correct 1827 ms 620264 KB Output is correct
72 Correct 3901 ms 809464 KB Output is correct
73 Correct 2453 ms 582356 KB Output is correct
74 Correct 2683 ms 678560 KB Output is correct
75 Correct 3975 ms 741560 KB Output is correct
76 Correct 2506 ms 582556 KB Output is correct
77 Correct 3344 ms 707516 KB Output is correct
78 Correct 4056 ms 741756 KB Output is correct
79 Correct 2193 ms 575608 KB Output is correct
80 Correct 3606 ms 730976 KB Output is correct
81 Correct 3499 ms 720120 KB Output is correct
82 Correct 2571 ms 711832 KB Output is correct
83 Correct 3944 ms 809416 KB Output is correct
84 Correct 3958 ms 809436 KB Output is correct
85 Correct 3951 ms 809504 KB Output is correct
86 Correct 302 ms 344292 KB Output is correct
87 Correct 300 ms 344312 KB Output is correct
88 Correct 305 ms 345388 KB Output is correct
89 Correct 302 ms 345340 KB Output is correct
90 Correct 306 ms 344568 KB Output is correct