Submission #153001

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
153001	2019-09-11T08:49:27 Z	tinjyu	Rectangles (IOI19_rect)	C++14	0 / 100	540 ms	61940 KB

rect

#include "rect.h"
#include <iostream>
using namespace std;
long long int sx,sy,n,m,ans=0,map[1005][1005];
int find(int x,int y)
{
	if(x==n-1 || y==m-1)return 0;
	int can1=1,can2=1;
	//cout<<sx<<" "<<x<<" "<<sy<<" "<<y<<endl;
	//cout<<"can1"<<endl;
	for(int i=sx;i<=x;i++)
	{
		long long int ma=0;
		for(int j=sy;j<=y;j++)
		{
			//cout<<i<<" "<<j<<"  ";
			ma=max(map[i][j],ma);
		}
		//cout<<endl;
		if(ma>=map[i][sy-1] || ma>=map[i][y+1])
		{
			can1=0;
			break;
		}
	}
	//cout<<"can2"<<endl;
	for(int j=sy;j<=y;j++)
	{
		long long int ma=0;
		for(int i=sx;i<=x;i++)
		{
			//cout<<i<<" "<<j<<"  ";
			ma=max(map[i][j],ma);
		}
		//cout<<endl;
		if(ma>=map[sx-1][j] || ma>=map[x+1][j])
		{
			can2=0;
			break;
		}
	}
	if(can1==1 && can2==1)ans++;
	if(can2==1)find(x,y+1);
	if(can1==1)find(x+1,y);
	find(x+1,y+1);
	return 0;
}
long long count_rectangles(std::vector<std::vector<int> > a) {
	n=a.size();
	m=a[0].size();
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)map[i][j]=a[i][j];
	}
	for(int i=1;i<n-1;i++)
	{
		for(int j=1;j<m-1;j++)
		{
			sx=i,sy=j;
			find(i,j);
			
		}
	}
	return ans;
}

Subtask #1

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	504 KB	Output is correct
3	Correct	4 ms	504 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Incorrect	4 ms	376 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	504 KB	Output is correct
3	Correct	4 ms	504 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Incorrect	4 ms	376 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	504 KB	Output is correct
3	Correct	4 ms	504 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Incorrect	4 ms	376 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #4

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	504 KB	Output is correct
3	Correct	4 ms	504 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Incorrect	4 ms	376 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #5

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	540 ms	552 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Runtime error	95 ms	61940 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
3	Halted	0 ms	0 KB	-

Subtask #7

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	4 ms	504 KB	Output is correct
3	Correct	4 ms	504 KB	Output is correct
4	Correct	3 ms	376 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Incorrect	4 ms	376 KB	Output isn't correct
7	Halted	0 ms	0 KB	-