oj.uz

Submission #145021

# Submission time Handle Problem Language Result Execution time Memory
145021 2019-08-18T12:44:48 Z TadijaSebez Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 598100 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;
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));
	}
}
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(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 171 ms 197112 KB Output is correct
2 Correct 171 ms 198012 KB Output is correct
3 Correct 170 ms 198136 KB Output is correct
4 Correct 170 ms 198008 KB Output is correct
5 Correct 175 ms 198008 KB Output is correct
6 Correct 172 ms 197984 KB Output is correct
7 Correct 196 ms 198076 KB Output is correct
8 Correct 178 ms 197264 KB Output is correct
9 Correct 171 ms 197952 KB Output is correct
10 Correct 189 ms 197968 KB Output is correct
11 Correct 173 ms 197996 KB Output is correct
12 Correct 171 ms 197980 KB Output is correct
13 Correct 169 ms 196868 KB Output is correct
14 Correct 169 ms 197112 KB Output is correct
15 Correct 179 ms 197240 KB Output is correct
16 Correct 168 ms 196948 KB Output is correct
17 Correct 169 ms 196984 KB Output is correct
18 Correct 171 ms 196860 KB Output is correct
19 Correct 176 ms 197980 KB Output is correct
20 Correct 171 ms 197980 KB Output is correct
21 Correct 170 ms 197232 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 197112 KB Output is correct
2 Correct 171 ms 198012 KB Output is correct
3 Correct 170 ms 198136 KB Output is correct
4 Correct 170 ms 198008 KB Output is correct
5 Correct 175 ms 198008 KB Output is correct
6 Correct 172 ms 197984 KB Output is correct
7 Correct 196 ms 198076 KB Output is correct
8 Correct 178 ms 197264 KB Output is correct
9 Correct 171 ms 197952 KB Output is correct
10 Correct 189 ms 197968 KB Output is correct
11 Correct 173 ms 197996 KB Output is correct
12 Correct 171 ms 197980 KB Output is correct
13 Correct 169 ms 196868 KB Output is correct
14 Correct 169 ms 197112 KB Output is correct
15 Correct 179 ms 197240 KB Output is correct
16 Correct 168 ms 196948 KB Output is correct
17 Correct 173 ms 200272 KB Output is correct
18 Correct 219 ms 200232 KB Output is correct
19 Correct 179 ms 200176 KB Output is correct
20 Correct 176 ms 200156 KB Output is correct
21 Correct 173 ms 200156 KB Output is correct
22 Correct 181 ms 200236 KB Output is correct
23 Correct 175 ms 200188 KB Output is correct
24 Correct 172 ms 199928 KB Output is correct
25 Correct 169 ms 196984 KB Output is correct
26 Correct 171 ms 196860 KB Output is correct
27 Correct 176 ms 197980 KB Output is correct
28 Correct 171 ms 197980 KB Output is correct
29 Correct 170 ms 197232 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 197112 KB Output is correct
2 Correct 171 ms 198012 KB Output is correct
3 Correct 170 ms 198136 KB Output is correct
4 Correct 170 ms 198008 KB Output is correct
5 Correct 175 ms 198008 KB Output is correct
6 Correct 172 ms 197984 KB Output is correct
7 Correct 196 ms 198076 KB Output is correct
8 Correct 178 ms 197264 KB Output is correct
9 Correct 171 ms 197952 KB Output is correct
10 Correct 189 ms 197968 KB Output is correct
11 Correct 173 ms 197996 KB Output is correct
12 Correct 171 ms 197980 KB Output is correct
13 Correct 169 ms 196868 KB Output is correct
14 Correct 169 ms 197112 KB Output is correct
15 Correct 179 ms 197240 KB Output is correct
16 Correct 168 ms 196948 KB Output is correct
17 Correct 173 ms 200272 KB Output is correct
18 Correct 219 ms 200232 KB Output is correct
19 Correct 179 ms 200176 KB Output is correct
20 Correct 176 ms 200156 KB Output is correct
21 Correct 173 ms 200156 KB Output is correct
22 Correct 181 ms 200236 KB Output is correct
23 Correct 175 ms 200188 KB Output is correct
24 Correct 172 ms 199928 KB Output is correct
25 Correct 196 ms 206968 KB Output is correct
26 Correct 198 ms 207036 KB Output is correct
27 Correct 208 ms 207048 KB Output is correct
28 Correct 193 ms 206456 KB Output is correct
29 Correct 200 ms 207184 KB Output is correct
30 Correct 197 ms 206964 KB Output is correct
31 Correct 229 ms 206968 KB Output is correct
32 Correct 199 ms 206828 KB Output is correct
33 Correct 169 ms 196984 KB Output is correct
34 Correct 171 ms 196860 KB Output is correct
35 Correct 176 ms 197980 KB Output is correct
36 Correct 171 ms 197980 KB Output is correct
37 Correct 170 ms 197232 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 197112 KB Output is correct
2 Correct 171 ms 198012 KB Output is correct
3 Correct 170 ms 198136 KB Output is correct
4 Correct 170 ms 198008 KB Output is correct
5 Correct 175 ms 198008 KB Output is correct
6 Correct 172 ms 197984 KB Output is correct
7 Correct 196 ms 198076 KB Output is correct
8 Correct 178 ms 197264 KB Output is correct
9 Correct 171 ms 197952 KB Output is correct
10 Correct 189 ms 197968 KB Output is correct
11 Correct 173 ms 197996 KB Output is correct
12 Correct 171 ms 197980 KB Output is correct
13 Correct 169 ms 196868 KB Output is correct
14 Correct 169 ms 197112 KB Output is correct
15 Correct 179 ms 197240 KB Output is correct
16 Correct 168 ms 196948 KB Output is correct
17 Correct 173 ms 200272 KB Output is correct
18 Correct 219 ms 200232 KB Output is correct
19 Correct 179 ms 200176 KB Output is correct
20 Correct 176 ms 200156 KB Output is correct
21 Correct 173 ms 200156 KB Output is correct
22 Correct 181 ms 200236 KB Output is correct
23 Correct 175 ms 200188 KB Output is correct
24 Correct 172 ms 199928 KB Output is correct
25 Correct 196 ms 206968 KB Output is correct
26 Correct 198 ms 207036 KB Output is correct
27 Correct 208 ms 207048 KB Output is correct
28 Correct 193 ms 206456 KB Output is correct
29 Correct 200 ms 207184 KB Output is correct
30 Correct 197 ms 206964 KB Output is correct
31 Correct 229 ms 206968 KB Output is correct
32 Correct 199 ms 206828 KB Output is correct
33 Correct 405 ms 243284 KB Output is correct
34 Correct 416 ms 243320 KB Output is correct
35 Correct 414 ms 243308 KB Output is correct
36 Correct 415 ms 243320 KB Output is correct
37 Correct 556 ms 251612 KB Output is correct
38 Correct 570 ms 251584 KB Output is correct
39 Correct 549 ms 251740 KB Output is correct
40 Correct 541 ms 248576 KB Output is correct
41 Correct 471 ms 247484 KB Output is correct
42 Correct 526 ms 251740 KB Output is correct
43 Correct 609 ms 251644 KB Output is correct
44 Correct 572 ms 254228 KB Output is correct
45 Correct 378 ms 238696 KB Output is correct
46 Correct 366 ms 224240 KB Output is correct
47 Correct 548 ms 251612 KB Output is correct
48 Correct 556 ms 251616 KB Output is correct
49 Correct 169 ms 196984 KB Output is correct
50 Correct 171 ms 196860 KB Output is correct
51 Correct 176 ms 197980 KB Output is correct
52 Correct 171 ms 197980 KB Output is correct
53 Correct 170 ms 197232 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 197256 KB Output is correct
2 Correct 204 ms 197300 KB Output is correct
3 Correct 260 ms 197276 KB Output is correct
4 Correct 171 ms 197112 KB Output is correct
5 Correct 174 ms 197240 KB Output is correct
6 Correct 175 ms 197212 KB Output is correct
7 Correct 178 ms 197348 KB Output is correct
8 Correct 213 ms 197260 KB Output is correct
9 Correct 187 ms 197184 KB Output is correct
10 Correct 181 ms 197072 KB Output is correct
11 Correct 173 ms 197112 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 197220 KB Output is correct
2 Correct 1895 ms 361308 KB Output is correct
3 Correct 3994 ms 531196 KB Output is correct
4 Correct 4026 ms 532412 KB Output is correct
5 Correct 3988 ms 532496 KB Output is correct
6 Correct 1572 ms 330104 KB Output is correct
7 Correct 2884 ms 463628 KB Output is correct
8 Correct 3090 ms 467064 KB Output is correct
9 Correct 169 ms 196984 KB Output is correct
10 Correct 171 ms 196860 KB Output is correct
11 Correct 176 ms 197980 KB Output is correct
12 Correct 171 ms 197980 KB Output is correct
13 Correct 170 ms 197232 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 197112 KB Output is correct
2 Correct 171 ms 198012 KB Output is correct
3 Correct 170 ms 198136 KB Output is correct
4 Correct 170 ms 198008 KB Output is correct
5 Correct 175 ms 198008 KB Output is correct
6 Correct 172 ms 197984 KB Output is correct
7 Correct 196 ms 198076 KB Output is correct
8 Correct 178 ms 197264 KB Output is correct
9 Correct 171 ms 197952 KB Output is correct
10 Correct 189 ms 197968 KB Output is correct
11 Correct 173 ms 197996 KB Output is correct
12 Correct 171 ms 197980 KB Output is correct
13 Correct 169 ms 196868 KB Output is correct
14 Correct 169 ms 197112 KB Output is correct
15 Correct 179 ms 197240 KB Output is correct
16 Correct 168 ms 196948 KB Output is correct
17 Correct 173 ms 200272 KB Output is correct
18 Correct 219 ms 200232 KB Output is correct
19 Correct 179 ms 200176 KB Output is correct
20 Correct 176 ms 200156 KB Output is correct
21 Correct 173 ms 200156 KB Output is correct
22 Correct 181 ms 200236 KB Output is correct
23 Correct 175 ms 200188 KB Output is correct
24 Correct 172 ms 199928 KB Output is correct
25 Correct 196 ms 206968 KB Output is correct
26 Correct 198 ms 207036 KB Output is correct
27 Correct 208 ms 207048 KB Output is correct
28 Correct 193 ms 206456 KB Output is correct
29 Correct 200 ms 207184 KB Output is correct
30 Correct 197 ms 206964 KB Output is correct
31 Correct 229 ms 206968 KB Output is correct
32 Correct 199 ms 206828 KB Output is correct
33 Correct 405 ms 243284 KB Output is correct
34 Correct 416 ms 243320 KB Output is correct
35 Correct 414 ms 243308 KB Output is correct
36 Correct 415 ms 243320 KB Output is correct
37 Correct 556 ms 251612 KB Output is correct
38 Correct 570 ms 251584 KB Output is correct
39 Correct 549 ms 251740 KB Output is correct
40 Correct 541 ms 248576 KB Output is correct
41 Correct 471 ms 247484 KB Output is correct
42 Correct 526 ms 251740 KB Output is correct
43 Correct 609 ms 251644 KB Output is correct
44 Correct 572 ms 254228 KB Output is correct
45 Correct 378 ms 238696 KB Output is correct
46 Correct 366 ms 224240 KB Output is correct
47 Correct 548 ms 251612 KB Output is correct
48 Correct 556 ms 251616 KB Output is correct
49 Correct 176 ms 197256 KB Output is correct
50 Correct 204 ms 197300 KB Output is correct
51 Correct 260 ms 197276 KB Output is correct
52 Correct 171 ms 197112 KB Output is correct
53 Correct 174 ms 197240 KB Output is correct
54 Correct 175 ms 197212 KB Output is correct
55 Correct 178 ms 197348 KB Output is correct
56 Correct 213 ms 197260 KB Output is correct
57 Correct 187 ms 197184 KB Output is correct
58 Correct 181 ms 197072 KB Output is correct
59 Correct 173 ms 197112 KB Output is correct
60 Correct 170 ms 197220 KB Output is correct
61 Correct 1895 ms 361308 KB Output is correct
62 Correct 3994 ms 531196 KB Output is correct
63 Correct 4026 ms 532412 KB Output is correct
64 Correct 3988 ms 532496 KB Output is correct
65 Correct 1572 ms 330104 KB Output is correct
66 Correct 2884 ms 463628 KB Output is correct
67 Correct 3090 ms 467064 KB Output is correct
68 Correct 3216 ms 466904 KB Output is correct
69 Correct 3282 ms 466916 KB Output is correct
70 Correct 3164 ms 466828 KB Output is correct
71 Correct 3180 ms 466920 KB Output is correct
72 Execution timed out 5047 ms 598100 KB Time limit exceeded
73 Halted 0 ms 0 KB -