Submission #145368

#	Time	Username	Problem	Language	Result	Execution time	Memory
145368		MvC	Rectangles (IOI19_rect)	C++14	0 / 100	311 ms	97160 KiB

rect

#include "rect.h"
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=3e3+50;
const int mod=1e9+7;
using namespace std;
int n,m,a[nmax][nmax],i,j,lvv[nmax][nmax],lv[nmax][nmax],lh[nmax][nmax],lhh[nmax][nmax],l,rs;
ll count_rectangles(vector<vector<int> > A) 
{
	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<=m;i++)
	{
		l=n+1;
		for(j=n;j>=1;j--)
		{
			lv[j][i]=l;
			if(a[j][i])l=j;
		}
	}
	for(i=1;i<=n;i++)
	{
		for(j=m;j>=1;j--)
		{
			if(lv[i][j+1]==lv[i][j] && a[i][j+1])lvv[i][j]=lvv[i][j+1];
			else lvv[i][j]=j;
		}
	}
	for(i=1;i<=n;i++)
	{
		l=m+1;
		for(j=m;j>=1;j--)
		{
			lh[i][j]=l;
			if(a[i][j])l=j;
		}
	}
	for(i=1;i<=m;i++)
	{
		for(j=n;j>=1;j--)
		{
			if(lh[j][i]==lh[j+1][i] && a[j+1][i])lhh[j][i]=lhh[j+1][i];
			else lhh[j][i]=j;
		}
	}
	for(i=2;i<n;i++)
	{
		for(j=2;j<m;j++)
		{
			if(!a[i][j] || !a[i-1][j+1])continue;
			//cout<<i<<" "<<j<<endl;
			if(lhh[i][j]!=lhh[i-1][j] && lh[i][j]!=m+1 && lv[i-1][j+1]!=n+1 && lh[i][j]>j+1 && lv[i-1][j+1]>i)
			{
				//cout<<i<<" "<<j<<endl;
				if(lvv[i-1][j+1]>=lh[i][j]-1 && lhh[i][j]>=lv[i-1][j+1]-1)rs++;
			}
		}
	}
	return rs;
}

Compilation message (stderr)

rect.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
rect.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

• Subtask 1: 0 / 8
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 0 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28