oj.uz

Submission #153384

# Submission time Handle Problem Language Result Execution time Memory
153384 2019-09-14T02:14:45 Z tinjyu Rectangles (IOI19_rect) C++14
15 / 100
 5000 ms 52720 KB 
#include "rect.h"
#include <iostream>
#include <cstring>
using namespace std;
long long int tag[85][2505],sx,sy,n,m,ans=0,map[85][2505];
int find(int x,int y)
{
	if(tag[x][y]==1)return 0;
	tag[x][y]=1;
	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);
	else 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++)
		{
			memset(tag, 0, sizeof(tag)); 
			sx=i,sy=j;
			find(i,j);
		}
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2040 KB Output is correct
2 Correct 76 ms 2168 KB Output is correct
3 Correct 71 ms 2168 KB Output is correct
4 Correct 75 ms 2040 KB Output is correct
5 Correct 70 ms 2160 KB Output is correct
6 Correct 73 ms 2168 KB Output is correct
7 Correct 31 ms 2040 KB Output is correct
8 Correct 28 ms 2040 KB Output is correct
9 Correct 70 ms 2040 KB Output is correct
10 Correct 74 ms 2168 KB Output is correct
11 Correct 70 ms 2040 KB Output is correct
12 Correct 75 ms 2168 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 8 ms 2040 KB Output is correct
16 Correct 4 ms 2088 KB Output is correct
17 Correct 2 ms 252 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 69 ms 2168 KB Output is correct
20 Correct 37 ms 2296 KB Output is correct
21 Correct 3 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2040 KB Output is correct
2 Correct 76 ms 2168 KB Output is correct
3 Correct 71 ms 2168 KB Output is correct
4 Correct 75 ms 2040 KB Output is correct
5 Correct 70 ms 2160 KB Output is correct
6 Correct 73 ms 2168 KB Output is correct
7 Correct 31 ms 2040 KB Output is correct
8 Correct 28 ms 2040 KB Output is correct
9 Correct 70 ms 2040 KB Output is correct
10 Correct 74 ms 2168 KB Output is correct
11 Correct 70 ms 2040 KB Output is correct
12 Correct 75 ms 2168 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 8 ms 2040 KB Output is correct
16 Correct 4 ms 2088 KB Output is correct
17 Correct 712 ms 2468 KB Output is correct
18 Correct 707 ms 2552 KB Output is correct
19 Correct 718 ms 2552 KB Output is correct
20 Correct 527 ms 2452 KB Output is correct
21 Correct 527 ms 2452 KB Output is correct
22 Correct 534 ms 2456 KB Output is correct
23 Correct 553 ms 2552 KB Output is correct
24 Correct 270 ms 2424 KB Output is correct
25 Correct 2 ms 252 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 69 ms 2168 KB Output is correct
28 Correct 37 ms 2296 KB Output is correct
29 Correct 3 ms 376 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2040 KB Output is correct
2 Correct 76 ms 2168 KB Output is correct
3 Correct 71 ms 2168 KB Output is correct
4 Correct 75 ms 2040 KB Output is correct
5 Correct 70 ms 2160 KB Output is correct
6 Correct 73 ms 2168 KB Output is correct
7 Correct 31 ms 2040 KB Output is correct
8 Correct 28 ms 2040 KB Output is correct
9 Correct 70 ms 2040 KB Output is correct
10 Correct 74 ms 2168 KB Output is correct
11 Correct 70 ms 2040 KB Output is correct
12 Correct 75 ms 2168 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 8 ms 2040 KB Output is correct
16 Correct 4 ms 2088 KB Output is correct
17 Correct 712 ms 2468 KB Output is correct
18 Correct 707 ms 2552 KB Output is correct
19 Correct 718 ms 2552 KB Output is correct
20 Correct 527 ms 2452 KB Output is correct
21 Correct 527 ms 2452 KB Output is correct
22 Correct 534 ms 2456 KB Output is correct
23 Correct 553 ms 2552 KB Output is correct
24 Correct 270 ms 2424 KB Output is correct
25 Runtime error 8 ms 2936 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2040 KB Output is correct
2 Correct 76 ms 2168 KB Output is correct
3 Correct 71 ms 2168 KB Output is correct
4 Correct 75 ms 2040 KB Output is correct
5 Correct 70 ms 2160 KB Output is correct
6 Correct 73 ms 2168 KB Output is correct
7 Correct 31 ms 2040 KB Output is correct
8 Correct 28 ms 2040 KB Output is correct
9 Correct 70 ms 2040 KB Output is correct
10 Correct 74 ms 2168 KB Output is correct
11 Correct 70 ms 2040 KB Output is correct
12 Correct 75 ms 2168 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 8 ms 2040 KB Output is correct
16 Correct 4 ms 2088 KB Output is correct
17 Correct 712 ms 2468 KB Output is correct
18 Correct 707 ms 2552 KB Output is correct
19 Correct 718 ms 2552 KB Output is correct
20 Correct 527 ms 2452 KB Output is correct
21 Correct 527 ms 2452 KB Output is correct
22 Correct 534 ms 2456 KB Output is correct
23 Correct 553 ms 2552 KB Output is correct
24 Correct 270 ms 2424 KB Output is correct
25 Runtime error 8 ms 2936 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5064 ms 2424 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2040 KB Output is correct
2 Runtime error 83 ms 52720 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 4 ms 2040 KB Output is correct
2 Correct 76 ms 2168 KB Output is correct
3 Correct 71 ms 2168 KB Output is correct
4 Correct 75 ms 2040 KB Output is correct
5 Correct 70 ms 2160 KB Output is correct
6 Correct 73 ms 2168 KB Output is correct
7 Correct 31 ms 2040 KB Output is correct
8 Correct 28 ms 2040 KB Output is correct
9 Correct 70 ms 2040 KB Output is correct
10 Correct 74 ms 2168 KB Output is correct
11 Correct 70 ms 2040 KB Output is correct
12 Correct 75 ms 2168 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 8 ms 2040 KB Output is correct
16 Correct 4 ms 2088 KB Output is correct
17 Correct 712 ms 2468 KB Output is correct
18 Correct 707 ms 2552 KB Output is correct
19 Correct 718 ms 2552 KB Output is correct
20 Correct 527 ms 2452 KB Output is correct
21 Correct 527 ms 2452 KB Output is correct
22 Correct 534 ms 2456 KB Output is correct
23 Correct 553 ms 2552 KB Output is correct
24 Correct 270 ms 2424 KB Output is correct
25 Runtime error 8 ms 2936 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -