Submission #340136

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
340136	2020-12-27T03:12:54 Z	shrek12357	Rectangles (IOI19_rect)	C++14	37 / 100	5000 ms	40556 KB

rect

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
#include "rect.h"
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0);

const int MAXN = 2505;
int grid[MAXN][MAXN];
int n, m;

ll ans1() {
	if (n == 1 || n == 2) {
		return 0;
	}
	int cnt = 0;
	for (int i = 1; i < m - 1; i++) {
		int cur = grid[1][i - 1];
		int mx = grid[1][i];
		for (int j = i; j < m - 1; j++) {
			mx = max(mx, grid[1][j]);
			if (grid[1][j] >= cur || grid[1][j] >= grid[0][j] || grid[1][j] >= grid[2][j]) {
				break;
			}
			if (grid[1][j] >= grid[1][j + 1] || mx >= cur || mx >= grid[1][j + 1]) {
				continue;
			}
			cnt++;
		}
	}
	return cnt;
}

ll ans2() {
	ll cnt = 0;
	for (int i = 1; i < n - 1; i++) {
		for (int j = 1; j < m - 1; j++) {
			for (int k = i; k < n - 1; k++) {
				for (int l = j; l < m - 1; l++) {
					bool bad = false;
					for (int a = i; a <= k; a++) {
						for (int b = j; b <= l; b++) {
							if (grid[a][b] >= grid[i - 1][b] || grid[a][b] >= grid[k + 1][b] || grid[a][b] >= grid[a][j - 1] || grid[a][b] >= grid[a][l + 1]) {
								bad = true;
								break;
							}
						}
						if (bad) {
							break;
						}
					}
					if (!bad) {
						cnt++;
					}
				}
			}
		}
	}
	return cnt;
}

ll 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++) {
			grid[i][j] = a[i][j];
		}
	}
	if (n <= 3) {
		return ans1();
	}
	return ans2();
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	2 ms	492 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	2 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	492 KB	Output is correct
20	Correct	1 ms	492 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	2 ms	492 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	2 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	46 ms	748 KB	Output is correct
18	Correct	36 ms	748 KB	Output is correct
19	Correct	37 ms	876 KB	Output is correct
20	Correct	22 ms	748 KB	Output is correct
21	Correct	28 ms	748 KB	Output is correct
22	Correct	28 ms	748 KB	Output is correct
23	Correct	28 ms	876 KB	Output is correct
24	Correct	8 ms	748 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	2 ms	492 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	2 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	46 ms	748 KB	Output is correct
18	Correct	36 ms	748 KB	Output is correct
19	Correct	37 ms	876 KB	Output is correct
20	Correct	22 ms	748 KB	Output is correct
21	Correct	28 ms	748 KB	Output is correct
22	Correct	28 ms	748 KB	Output is correct
23	Correct	28 ms	876 KB	Output is correct
24	Correct	8 ms	748 KB	Output is correct
25	Correct	1381 ms	1880 KB	Output is correct
26	Correct	1350 ms	1880 KB	Output is correct
27	Correct	1354 ms	2028 KB	Output is correct
28	Correct	821 ms	1772 KB	Output is correct
29	Correct	1044 ms	1900 KB	Output is correct
30	Correct	1045 ms	1900 KB	Output is correct
31	Correct	1024 ms	1940 KB	Output is correct
32	Correct	987 ms	2156 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	492 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	2 ms	492 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	2 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	46 ms	748 KB	Output is correct
18	Correct	36 ms	748 KB	Output is correct
19	Correct	37 ms	876 KB	Output is correct
20	Correct	22 ms	748 KB	Output is correct
21	Correct	28 ms	748 KB	Output is correct
22	Correct	28 ms	748 KB	Output is correct
23	Correct	28 ms	876 KB	Output is correct
24	Correct	8 ms	748 KB	Output is correct
25	Correct	1381 ms	1880 KB	Output is correct
26	Correct	1350 ms	1880 KB	Output is correct
27	Correct	1354 ms	2028 KB	Output is correct
28	Correct	821 ms	1772 KB	Output is correct
29	Correct	1044 ms	1900 KB	Output is correct
30	Correct	1045 ms	1900 KB	Output is correct
31	Correct	1024 ms	1940 KB	Output is correct
32	Correct	987 ms	2156 KB	Output is correct
33	Execution timed out	5051 ms	12140 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	364 KB	Output is correct
2	Correct	4 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct

Subtask #6
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	364 KB	Output is correct
2	Execution timed out	5049 ms	40556 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #7
0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	2 ms	492 KB	Output is correct
3	Correct	2 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	1 ms	492 KB	Output is correct
7	Correct	1 ms	492 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	492 KB	Output is correct
10	Correct	1 ms	492 KB	Output is correct
11	Correct	2 ms	492 KB	Output is correct
12	Correct	1 ms	492 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	46 ms	748 KB	Output is correct
18	Correct	36 ms	748 KB	Output is correct
19	Correct	37 ms	876 KB	Output is correct
20	Correct	22 ms	748 KB	Output is correct
21	Correct	28 ms	748 KB	Output is correct
22	Correct	28 ms	748 KB	Output is correct
23	Correct	28 ms	876 KB	Output is correct
24	Correct	8 ms	748 KB	Output is correct
25	Correct	1381 ms	1880 KB	Output is correct
26	Correct	1350 ms	1880 KB	Output is correct
27	Correct	1354 ms	2028 KB	Output is correct
28	Correct	821 ms	1772 KB	Output is correct
29	Correct	1044 ms	1900 KB	Output is correct
30	Correct	1045 ms	1900 KB	Output is correct
31	Correct	1024 ms	1940 KB	Output is correct
32	Correct	987 ms	2156 KB	Output is correct
33	Execution timed out	5051 ms	12140 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Submission #340136

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 7.0 / 7.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 22.0

Subtask #5 10.0 / 10.0

Subtask #6 0 / 13.0

Subtask #7 0 / 28.0

Subtask #1
8.0 / 8.0

Subtask #2
7.0 / 7.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 22.0

Subtask #5
10.0 / 10.0

Subtask #6
0 / 13.0

Subtask #7
0 / 28.0