oj.uz

Submission #226527

# Submission time Handle Problem Language Result Execution time Memory
226527 2020-04-24T08:01:54 Z tinjyu Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 634872 KB 
#include "rect.h"
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
struct node{
	int x, y;
}array[7000000];
int u[2505][2505],d[2505][2505],tree1[2505][10005][2],tree2[2505][10005][2],n,m,s[2505][2505][2],l[2505][2505],st2[2505][2505][2],r[2505][2505],t[10005][2],bits[20];
int findtree1(int le,int ri,int j,int st,int en,int t,int opt)
{
	if(le>en || ri<st)
	{
		if(opt==0)return -1;
		return 5000;
	}
	if(st>=le && en<=ri)
	{
		return tree1[j][t][opt];
	}
	if(opt==0)return max(findtree1(le,ri,j,st,(st+en)/2,t*2,opt),findtree1(le,ri,j,(st+en)/2+1,en,t*2+1,opt));
	else return min(findtree1(le,ri,j,st,(st+en)/2,t*2,opt),findtree1(le,ri,j,(st+en)/2+1,en,t*2+1,opt));
}
int findtree2(int le,int ri,int i,int st,int en,int t,int opt)
{
	//cout<<le<<" "<<ri<<" "<<i<<" "<<st<<" "<<en<<" "<<opt<<" "<<t<<" "<<tree2[i][t][opt]<<endl;

	if(le>en || ri<st)
	{
		if(opt==0)return -1;
		return 5000;
	}
	if(st>=le && en<=ri)
	{
		return tree2[i][t][opt];
	}
	if(opt==0)return max(findtree2(le,ri,i,st,(st+en)/2,t*2,opt),findtree2(le,ri,i,(st+en)/2+1,en,t*2+1,opt));
	else return min(findtree2(le,ri,i,st,(st+en)/2,t*2,opt),findtree2(le,ri,i,(st+en)/2+1,en,t*2+1,opt));
}
int find(int i,int j)
{
	int x1=l[i][j],y1=u[i][j],x2=r[i][j],y2=d[i][j];
	int le=l[i][j]+1,ri=r[i][j]-1;
	int k=log2(ri-le+1);
	//cout<<y1<<" "<<x1<<" "<<y2<<" "<<x2<<" "<<le<<" "<<ri<<endl;
	int tmp=findtree2(le,ri,y1,0,m-1,1,1);
	//cout<<tmp<<endl;
	if( tmp < y2 ) return 0;
	tmp=findtree2(le,ri,y2,0,m-1,1,0);
	//cout<<tmp<<endl;
	if( tmp > y1 ) return 0;
 
	int up=u[i][j]+1,down=d[i][j]-1;
	k=log2(down-up+1);
	tmp=findtree1(up,down,x1,0,n-1,1,1);
	//cout<<tmp<<endl;
	if( tmp < x2 )return 0;
	tmp=findtree1(up,down,x2,0,n-1,1,0);
	//cout<<tmp<<endl;
	if( tmp > x1 )return 0;
	
	return 1;
}
bool cmp(node ax,node ay)
{
	int ar[10][4];
	ar[0][0]=u[ax.x][ax.y];
	ar[0][1]=l[ax.x][ax.y];
	ar[0][2]=d[ax.x][ax.y];
	ar[0][3]=r[ax.x][ax.y];
	ar[1][0]=u[ay.x][ay.y];
	ar[1][1]=l[ay.x][ay.y];
	ar[1][2]=d[ay.x][ay.y];
	ar[1][3]=r[ay.x][ay.y];
	for(int i=0;i<4;i++)
	{
		if(ar[0][i]<ar[1][i])return 1;
		if(ar[0][i]>ar[1][i])return 0;
	}
	return 0;
}
void build1(int j,int st,int e,int t)
{
	if(st==e)
	{
		tree1[j][t][0]=st2[st][j][0];
		tree1[j][t][1]=st2[st][j][1];
		//cout<<j<<" "<<st<<" "<<e<<" "<<t<<" "<<tree1[j][t][0]<<" "<<tree1[j][t][1]<<endl;

		return ;                           
	}
	build1(j,st,(st+e)/2,t*2);
	build1(j,(st+e)/2+1,e,t*2+1);
	tree1[j][t][0]=max(tree1[j][t*2][0],tree1[j][t*2+1][0]);
	tree1[j][t][1]=min(tree1[j][t*2][1],tree1[j][t*2+1][1]);
	//cout<<j<<" "<<st<<" "<<e<<" "<<t<<" "<<tree1[j][t][0]<<" "<<tree1[j][t][1]<<endl;
	return ;
}
void build2(int i,int st,int e,int t)
{
	if(st==e)
	{
		tree2[i][t][0]=s[i][st][0]; 
		tree2[i][t][1]=s[i][st][1];
		//cout<<i<<" "<<st<<" "<<e<<" "<<t<<" "<<tree2[i][t][0]<<" "<<tree2[i][t][1]<<endl;

		return ;
	}
	build2(i,st,(st+e)/2,t*2);
	build2(i,(st+e)/2+1,e,t*2+1);
	tree2[i][t][0]=max(tree2[i][t*2][0],tree2[i][t*2+1][0]);
	tree2[i][t][1]=min(tree2[i][t*2][1],tree2[i][t*2+1][1]);
	//cout<<i<<" "<<st<<" "<<e<<" "<<t<<" "<<tree2[i][t][0]<<" "<<tree2[i][t][1]<<endl;
	return ;
}
long long count_rectangles(std::vector<std::vector<int> > a) {
	n=a.size();
	m=a[0].size();
	for(register int i=0;i<n;i++)
	{
		int p=0,st=0,en=-1;
		for(register int j=0;j<m;j++)
		{
			l[i][j]=-1;
			r[i][j]=5000;
			for(int k=en;k>=st;k--)
			{
				if(a[i][j]>t[k][0])
				{
					r[i][t[k][1]]=j;
					en--;
				}
				else 
				{
					en++;
					t[en][0]=a[i][j];
					t[en][1]=j;
					if(a[i][j]<t[k][0])l[i][j]=t[k][1];
					else l[i][j]=l[i][t[k][1]];
					break;
				}
			}
			if(en==-1)
			{
				en=0;
				t[en][0]=a[i][j];
				t[en][1]=j;
			}
		}
	}
	for(register int j=0;j<m;j++)
	{
		int p=0,st=0,en=-1;
		for(register int i=0;i<n;i++)
		{
			u[i][j]=-1;
			d[i][j]=5000;
			for(int k=en;k>=st;k--)
			{
				if(a[i][j]>t[k][0])
				{
					d[t[k][1]][j]=i;
					en--;
				}
				else 
				{
					en++;
					t[en][0]=a[i][j];
					t[en][1]=i;
					if(a[i][j]<t[k][0])u[i][j]=t[k][1];
					else u[i][j]=u[t[k][1]][j];
					break;
				}
			}
			if(en==-1)
			{
				en=0;
				t[en][0]=a[i][j];
				t[en][1]=i;
			}
		}
	}
	
	for(register int i=0;i<n;i++)
	{
		int p=0,st=0,en=-1;
		for(register int j=0;j<m;j++)
		{
			st2[i][j][0]=-1;
			st2[i][j][1]=5000;
			for(register int k=en;k>=st;k--)
			{
				if(a[i][j]>=t[k][0])
				{
					st2[i][t[k][1]][1]=j;
					en--;
					if(a[i][j]==t[k][0])
					{
						st2[i][j][0]=t[k][1];
						en++;
						t[en][0]=a[i][j];
						t[en][1]=j;
						break;
					}
				}
				else 
				{
					en++;
					t[en][0]=a[i][j];
					t[en][1]=j;
					st2[i][j][0]=t[k][1];
					break;
				}
			}
			if(en==-1)
			{
				en=0;
				t[en][0]=a[i][j];
				t[en][1]=j;
			}
		}
	}
	for(register int j=0;j<m;j++)
	{
		int p=0,st=0,en=-1;
		for(register int i=0;i<n;i++)
		{
			s[i][j][0]=-1;
			s[i][j][1]=5000;
			for(int k=en;k>=st;k--)
			{
				if(a[i][j]>=t[k][0])
				{
					s[t[k][1]][j][1]=i;
					en--;
					if(a[i][j]==t[k][0])
					{
						s[i][j][0]=t[k][1];
						en++;
						t[en][0]=a[i][j];
						t[en][1]=i;
						break;
					}
				}
				else 
				{
					en++;
					t[en][0]=a[i][j];
					t[en][1]=i;
					s[i][j][0]=t[k][1];
					break;
				}
			}
			if(en==-1)
			{
				en=0;
				t[en][0]=a[i][j];
				t[en][1]=i;
			}
		}
	}
	//cout<<st2[4][16][0][1]<<endl;
	bits[0]=1;
	for(int i=0;i<m;i++)
	{
		build1(i,0,n-1,1);
	}
	//cout<<endl;
	for(int j=0;j<n;j++)
	{
		build2(j,0,m-1,1);
	}
	
	int ans=0;
	int cnt=0;
	for(register int i=0;i<n;i++)
	{
		for(register int j=0;j<m;j++)
		{
			if(u[i][j]==-1 || d[i][j]==5000 || l[i][j]==-1 || r[i][j]==5000)continue;
			//if((a[i-1][j]==a[i][j] && i!=1) || (a[i][j-1]==a[i][j] && j!=1))continue;
			cnt++;
			array[cnt].x=i;
			array[cnt].y=j;
		}
	}
	sort(array+1,array+cnt+1,cmp);
	//cout<<cnt<<endl;
	for(register int i=1;i<=cnt;i++)
	{

		int x=array[i].x,y=array[i].y,x1=array[i-1].x,y1=array[i-1].y;
		if(u[x][y]==u[x1][y1] && d[x][y]==d[x1][y1] && l[x][y]==l[x1][y1] && r[x][y]==r[x1][y1])continue;
		//cout<<x<<" "<<y<<endl;
		int tmp=find(x,y);
		if(tmp==1)
			//cout<<u[x][y]+1<<" "<<l[x][y]+1<<" "<<d[x][y]-1<<" "<<r[x][y]-1<<endl;
			//cout<<endl;
		ans+=tmp;
	}
	return ans;
}

Compilation message

rect.cpp: In function 'int find(int, int)':
rect.cpp:44:6: warning: variable 'k' set but not used [-Wunused-but-set-variable]
  int k=log2(ri-le+1);
      ^
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:121:7: warning: unused variable 'p' [-Wunused-variable]
   int p=0,st=0,en=-1;
       ^
rect.cpp:153:7: warning: unused variable 'p' [-Wunused-variable]
   int p=0,st=0,en=-1;
       ^
rect.cpp:186:7: warning: unused variable 'p' [-Wunused-variable]
   int p=0,st=0,en=-1;
       ^
rect.cpp:225:7: warning: unused variable 'p' [-Wunused-variable]
   int p=0,st=0,en=-1;
       ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 628 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 1408 KB Output is correct
20 Correct 5 ms 1280 KB Output is correct
21 Correct 5 ms 640 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 628 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 10 ms 3584 KB Output is correct
18 Correct 10 ms 3584 KB Output is correct
19 Correct 10 ms 3584 KB Output is correct
20 Correct 8 ms 3584 KB Output is correct
21 Correct 9 ms 3584 KB Output is correct
22 Correct 9 ms 3584 KB Output is correct
23 Correct 9 ms 3584 KB Output is correct
24 Correct 7 ms 3200 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 1408 KB Output is correct
28 Correct 5 ms 1280 KB Output is correct
29 Correct 5 ms 640 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 628 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 10 ms 3584 KB Output is correct
18 Correct 10 ms 3584 KB Output is correct
19 Correct 10 ms 3584 KB Output is correct
20 Correct 8 ms 3584 KB Output is correct
21 Correct 9 ms 3584 KB Output is correct
22 Correct 9 ms 3584 KB Output is correct
23 Correct 9 ms 3584 KB Output is correct
24 Correct 7 ms 3200 KB Output is correct
25 Correct 40 ms 10496 KB Output is correct
26 Correct 40 ms 10496 KB Output is correct
27 Correct 41 ms 10624 KB Output is correct
28 Correct 23 ms 10240 KB Output is correct
29 Correct 30 ms 10368 KB Output is correct
30 Correct 31 ms 10624 KB Output is correct
31 Correct 31 ms 10624 KB Output is correct
32 Correct 30 ms 10496 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 1408 KB Output is correct
36 Correct 5 ms 1280 KB Output is correct
37 Correct 5 ms 640 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 628 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 10 ms 3584 KB Output is correct
18 Correct 10 ms 3584 KB Output is correct
19 Correct 10 ms 3584 KB Output is correct
20 Correct 8 ms 3584 KB Output is correct
21 Correct 9 ms 3584 KB Output is correct
22 Correct 9 ms 3584 KB Output is correct
23 Correct 9 ms 3584 KB Output is correct
24 Correct 7 ms 3200 KB Output is correct
25 Correct 40 ms 10496 KB Output is correct
26 Correct 40 ms 10496 KB Output is correct
27 Correct 41 ms 10624 KB Output is correct
28 Correct 23 ms 10240 KB Output is correct
29 Correct 30 ms 10368 KB Output is correct
30 Correct 31 ms 10624 KB Output is correct
31 Correct 31 ms 10624 KB Output is correct
32 Correct 30 ms 10496 KB Output is correct
33 Correct 81 ms 65144 KB Output is correct
34 Correct 82 ms 65144 KB Output is correct
35 Correct 81 ms 65144 KB Output is correct
36 Correct 80 ms 65144 KB Output is correct
37 Correct 529 ms 68856 KB Output is correct
38 Correct 558 ms 68856 KB Output is correct
39 Correct 569 ms 68964 KB Output is correct
40 Correct 498 ms 65400 KB Output is correct
41 Correct 194 ms 66936 KB Output is correct
42 Correct 246 ms 67576 KB Output is correct
43 Correct 381 ms 68856 KB Output is correct
44 Correct 377 ms 68728 KB Output is correct
45 Correct 186 ms 44664 KB Output is correct
46 Correct 191 ms 36216 KB Output is correct
47 Correct 358 ms 68808 KB Output is correct
48 Correct 373 ms 68860 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 1408 KB Output is correct
52 Correct 5 ms 1280 KB Output is correct
53 Correct 5 ms 640 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 11392 KB Output is correct
2 Correct 10 ms 9856 KB Output is correct
3 Correct 9 ms 11392 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 11 ms 11392 KB Output is correct
6 Correct 11 ms 11392 KB Output is correct
7 Correct 11 ms 11392 KB Output is correct
8 Correct 11 ms 11392 KB Output is correct
9 Correct 11 ms 11392 KB Output is correct
10 Correct 9 ms 10880 KB Output is correct
11 Correct 10 ms 11136 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 1192 ms 299296 KB Output is correct
3 Correct 2560 ms 608624 KB Output is correct
4 Correct 2619 ms 610680 KB Output is correct
5 Correct 2700 ms 610680 KB Output is correct
6 Correct 439 ms 298232 KB Output is correct
7 Correct 833 ms 574840 KB Output is correct
8 Correct 853 ms 588316 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 640 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1408 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 628 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 10 ms 3584 KB Output is correct
18 Correct 10 ms 3584 KB Output is correct
19 Correct 10 ms 3584 KB Output is correct
20 Correct 8 ms 3584 KB Output is correct
21 Correct 9 ms 3584 KB Output is correct
22 Correct 9 ms 3584 KB Output is correct
23 Correct 9 ms 3584 KB Output is correct
24 Correct 7 ms 3200 KB Output is correct
25 Correct 40 ms 10496 KB Output is correct
26 Correct 40 ms 10496 KB Output is correct
27 Correct 41 ms 10624 KB Output is correct
28 Correct 23 ms 10240 KB Output is correct
29 Correct 30 ms 10368 KB Output is correct
30 Correct 31 ms 10624 KB Output is correct
31 Correct 31 ms 10624 KB Output is correct
32 Correct 30 ms 10496 KB Output is correct
33 Correct 81 ms 65144 KB Output is correct
34 Correct 82 ms 65144 KB Output is correct
35 Correct 81 ms 65144 KB Output is correct
36 Correct 80 ms 65144 KB Output is correct
37 Correct 529 ms 68856 KB Output is correct
38 Correct 558 ms 68856 KB Output is correct
39 Correct 569 ms 68964 KB Output is correct
40 Correct 498 ms 65400 KB Output is correct
41 Correct 194 ms 66936 KB Output is correct
42 Correct 246 ms 67576 KB Output is correct
43 Correct 381 ms 68856 KB Output is correct
44 Correct 377 ms 68728 KB Output is correct
45 Correct 186 ms 44664 KB Output is correct
46 Correct 191 ms 36216 KB Output is correct
47 Correct 358 ms 68808 KB Output is correct
48 Correct 373 ms 68860 KB Output is correct
49 Correct 11 ms 11392 KB Output is correct
50 Correct 10 ms 9856 KB Output is correct
51 Correct 9 ms 11392 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 11 ms 11392 KB Output is correct
54 Correct 11 ms 11392 KB Output is correct
55 Correct 11 ms 11392 KB Output is correct
56 Correct 11 ms 11392 KB Output is correct
57 Correct 11 ms 11392 KB Output is correct
58 Correct 9 ms 10880 KB Output is correct
59 Correct 10 ms 11136 KB Output is correct
60 Correct 6 ms 640 KB Output is correct
61 Correct 1192 ms 299296 KB Output is correct
62 Correct 2560 ms 608624 KB Output is correct
63 Correct 2619 ms 610680 KB Output is correct
64 Correct 2700 ms 610680 KB Output is correct
65 Correct 439 ms 298232 KB Output is correct
66 Correct 833 ms 574840 KB Output is correct
67 Correct 853 ms 588316 KB Output is correct
68 Correct 1083 ms 586060 KB Output is correct
69 Correct 1046 ms 585976 KB Output is correct
70 Correct 1006 ms 585976 KB Output is correct
71 Correct 1000 ms 585976 KB Output is correct
72 Execution timed out 5109 ms 634872 KB Time limit exceeded
73 Halted 0 ms 0 KB -