Submission #891471

#	Time	Username	Problem	Language	Result	Execution time	Memory
891471		Faisal_Saqib	Rectangles (IOI19_rect)	C++17	0 / 100	3291 ms	73932 KiB

rect

#include <vector>
using namespace std;
long long count_rectangles(std::vector<std::vector<int> >a)
{
	long long ans=0;
	int n=a.size();
	int m=a[0].size();
	int fix1[n][m][m];
	for(int i=1;i<=(n-2);i++)
	{
		for(int j=1;j<=(m-2);j++)
		{
			fix1[i][j][j]=a[i][j];
			int j1=j+1;
			while(j1<=(m-2))
			{
				fix1[i][j][j1]=max(a[i][j1],fix1[i][j][j1-1]);
				j1++;
			}
		}
	}
	int fix2[m][n][n];
	for(int i=1;i<=(m-2);i++)
	{
		for(int j=1;j<=(n-2);j++)
		{
			fix2[i][j][j]=a[j][i];
			int j1=j+1;
			while(j1<=(n-2))
			{
				fix2[i][j][j1]=max(a[j1][i],fix2[i][j][j1-1]);
				j1++;
			}
		}
	}
	for(int r1=1;r1<=(n-2);r1++)
	{
		for(int c1=1;c1<=(m-2);c1++)
		{
			for(int r2=r1;r2<=(n-2);r2++)
			{
				for(int c2=c1;c2<=(m-2);c2++)
				{
					bool pos=1;
					for(int addi=0;addi<=(r2-r1) and pos;addi++)
					{
						int celli=r1+addi;
						int mi=min(a[celli][c1-1],a[celli][c2+1]);
						int fp=fix1[celli][r1][r2];
						if(fp>=mi)
						{
							pos=0;
							break;
						}
					}
					for(int addj=0;addj<=(c2-c1);addj++)
					{
						int cellj=c1+addj;
						int mi=min(a[r1-1][cellj],a[r2+1][cellj]);
						int fp=fix2[cellj][r1][r2];
						if(fp>=mi)
						{
							pos=0;
							break;
						}
					}
					ans+=pos;
				}
			}
		}
	}
	return ans;
}

• 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