Submission #200935

# Submission time Handle Problem Language Result Execution time Memory
200935 2020-02-08T16:50:26 Z Lawliet Rectangles (IOI19_rect) C++17
15 / 100
74 ms 46076 KB
#include <bits/stdc++.h>
#include "rect.h"

using namespace std;
typedef long long int lli;

const int MAXN = 90;

int n, m;

int v[MAXN][MAXN];

bool counted[MAXN][MAXN][MAXN][MAXN];

bool isAnswer(int x1, int y1, int x2, int y2)
{
	if( counted[x1][y1][x2][y2] ) return false;

	for(int i = x1 ; i <= x2 ; i++)
	{
		for(int j = y1 ; j <= y2 ; j++)
		{
			if( v[i][j] >= v[i][y1 - 1] || v[i][j] >= v[i][y2 + 1] ) return false;
			if( v[i][j] >= v[x1 - 1][j] || v[i][j] >= v[x2 + 1][j] ) return false;
		}
	}

	counted[x1][y1][x2][y2] = true;

	return true;
}

long long count_rectangles(vector< vector<int> > a) 
{
	n = a.size();
	m = a[0].size();

	for(int i = 0 ; i < n ; i++)
		for(int j = 0 ; j < m ; j++)
			v[i][j] = a[i][j];

	lli ans = 0;

	for(int i = 0 ; i < n ; i++)
	{
		for(int j = 0 ; j < m ; j++)
		{
			int L, R;
			int up, down;

			L = R = up = down = -1;

			for(int k = 0 ; k < j ; k++)
				if( v[i][k] >= v[i][j] ) L = k;

			for(int k = m - 1 ; k > j ; k--)
				if( v[i][k] > v[i][j] ) R = k;

			for(int k = 0 ; k < i ; k++)
				if( v[k][j] >= v[i][j] ) up = k;

			for(int k = n - 1 ; k > i ; k--)
				if( v[k][j] > v[i][j] ) down = k;

			if( L == -1 || R == -1 || up == -1 || down == -1 ) continue;

			if( isAnswer( up + 1 , L + 1 , down - 1 , R - 1 ) ) ans++;
		}
	}

	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 3448 KB Output is correct
3 Correct 7 ms 3576 KB Output is correct
4 Correct 7 ms 3448 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1016 KB Output is correct
10 Correct 5 ms 1144 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1148 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 3448 KB Output is correct
3 Correct 7 ms 3576 KB Output is correct
4 Correct 7 ms 3448 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1016 KB Output is correct
10 Correct 5 ms 1144 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1148 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 34 ms 24824 KB Output is correct
18 Correct 36 ms 24952 KB Output is correct
19 Correct 35 ms 24824 KB Output is correct
20 Correct 10 ms 2936 KB Output is correct
21 Correct 12 ms 6904 KB Output is correct
22 Correct 12 ms 6776 KB Output is correct
23 Correct 12 ms 6780 KB Output is correct
24 Correct 8 ms 3448 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 504 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 3448 KB Output is correct
3 Correct 7 ms 3576 KB Output is correct
4 Correct 7 ms 3448 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1016 KB Output is correct
10 Correct 5 ms 1144 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1148 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 34 ms 24824 KB Output is correct
18 Correct 36 ms 24952 KB Output is correct
19 Correct 35 ms 24824 KB Output is correct
20 Correct 10 ms 2936 KB Output is correct
21 Correct 12 ms 6904 KB Output is correct
22 Correct 12 ms 6776 KB Output is correct
23 Correct 12 ms 6780 KB Output is correct
24 Correct 8 ms 3448 KB Output is correct
25 Runtime error 10 ms 1400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 3448 KB Output is correct
3 Correct 7 ms 3576 KB Output is correct
4 Correct 7 ms 3448 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1016 KB Output is correct
10 Correct 5 ms 1144 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1148 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 34 ms 24824 KB Output is correct
18 Correct 36 ms 24952 KB Output is correct
19 Correct 35 ms 24824 KB Output is correct
20 Correct 10 ms 2936 KB Output is correct
21 Correct 12 ms 6904 KB Output is correct
22 Correct 12 ms 6776 KB Output is correct
23 Correct 12 ms 6780 KB Output is correct
24 Correct 8 ms 3448 KB Output is correct
25 Runtime error 10 ms 1400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 760 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Runtime error 74 ms 46076 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 3448 KB Output is correct
3 Correct 7 ms 3576 KB Output is correct
4 Correct 7 ms 3448 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 1272 KB Output is correct
7 Correct 5 ms 760 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 6 ms 1016 KB Output is correct
10 Correct 5 ms 1144 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 6 ms 1148 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 34 ms 24824 KB Output is correct
18 Correct 36 ms 24952 KB Output is correct
19 Correct 35 ms 24824 KB Output is correct
20 Correct 10 ms 2936 KB Output is correct
21 Correct 12 ms 6904 KB Output is correct
22 Correct 12 ms 6776 KB Output is correct
23 Correct 12 ms 6780 KB Output is correct
24 Correct 8 ms 3448 KB Output is correct
25 Runtime error 10 ms 1400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -