oj.uz

답안 #171204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
171204 2019-12-27T18:23:36 Z nobik Rectangles (IOI19_rect) C++14
100 / 100
 4382 ms 635988 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<pair<int, int>>> CalcSegments(const vector<int>& a) {
	int n = static_cast<int>(a.size());
	vector<vector<pair<int, int>>> segments(n);
	vector<int> s;
	for (int i = 0; i < n; ++i) {
		while (!s.empty()) {
			int segment = i - s.back() - 1;
			if (segment > 0) 
				segments[i].emplace_back(segment, 1);
			if (a[s.back()] >= a[i]) 
				break;
			s.pop_back();
		}

		if (!s.empty() && a[s.back()] == a[i])
			s.pop_back();

		s.push_back(i);
	}

	segments.shrink_to_fit();
	return segments;
}

vector<pair<int, int>> Merge(const vector<pair<int, int>>& a, const vector<pair<int, int>>& b) {
	vector<pair<int, int>> r;
	int a_size = static_cast<int>(a.size());
	int j = 0;
	for (const auto& e: b) {
		while (j < a_size && a[j].first < e.first) {
			++j;
		}

		int cnt = e.second;
		if (j < a_size && a[j].first == e.first) {
			cnt += a[j].second;
		}

		r.emplace_back(e.first, cnt);
	}

	return r;
}

struct Fenwick {
	int n;
	vector<int> f;

	Fenwick(int n): n(n), f(n + 1) {}

	void Add(int pos) {
		for (int i = pos + 1; i <= n; i += i & -i) {
			++f[i];
		}
	}

	int Sum(int pos) {
		int r = 0;
		for (int i = pos + 1; i > 0; i -= i & -i) {
			r += f[i];
		}

		return r;
	}
};

int Count(vector<pair<int, int>> a, vector<pair<int, int>> b) {
	if (a.empty() || b.empty()) return 0;
	sort(a.begin(), a.end(), [&](const pair<int, int>& x, const pair<int, int>& y) {
		return x.second < y.second;
	});

	vector<int> cmp;
	for (auto& e: b) {
		cmp.push_back(e.second);
	}

	sort(cmp.begin(), cmp.end());
	cmp.erase(unique(cmp.begin(), cmp.end()), cmp.end());
	Fenwick f(cmp.size());

	int b_size = static_cast<int>(b.size());
	int j = 0;

	int r = 0;
	for (auto& e: a) {
		while (j < b_size && b[j].first <= e.second) {
			int y = lower_bound(cmp.begin(), cmp.end(), b[j].second) - cmp.begin();
			f.Add(y);
			++j;
		}

		int pos = lower_bound(cmp.begin(), cmp.end(), e.first) - cmp.begin() - 1;
		r += j - f.Sum(pos);
	}

	return r;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = static_cast<int>(a.size());
	int m = static_cast<int>(a.front().size());

	vector<vector<vector<pair<int, int>>>> horizontal_segments(n, vector<vector<pair<int, int>>>(m));
	vector<vector<vector<pair<int, int>>>> vertical_segments(n, vector<vector<pair<int, int>>>(m));

	for (int i = 0; i < n; ++i) {
		horizontal_segments[i] = CalcSegments(a[i]);
	}

	for (int j = 0; j < m; ++j) {
		vector<int> b;
		for (int i = 0; i < n; ++i) {
			b.push_back(a[i][j]);
		}

		auto segments = CalcSegments(b);
		for (int i = 0; i < n; ++i) {
			vertical_segments[i][j] = segments[i];
		}
	}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			if (i > 0) horizontal_segments[i][j] = Merge(horizontal_segments[i - 1][j], horizontal_segments[i][j]);
			if (j > 0) vertical_segments[i][j] = Merge(vertical_segments[i][j - 1], vertical_segments[i][j]);
		}
	}

	long long result = 0;
	for (int i = 1; i < n; ++i) {
		for (int j = 1; j < m; ++j) {
			if (horizontal_segments[i - 1][j].size() * vertical_segments[i][j - 1].size () <= 100) {
				for (auto& x: horizontal_segments[i - 1][j]) {
					for (auto& y: vertical_segments[i][j - 1]) {
						if (x.first <= y.second && y.first <= x.second)
							++result;
					}
				}
				continue;
			}
			/* for (auto& x: horizontal_segments[i - 1][j]) {
				for (auto& y: vertical_segments[i][j - 1]) {
					if (x.first <= y.second && y.first <= x.second)
						++result;
				}
			} */

			result += Count(horizontal_segments[i - 1][j], vertical_segments[i][j - 1]);
		}
	}

	/* for (int i = 1; i < n; ++i) {
		for (int j = 1; j < m; ++j) {
			cout << i << ' ' << j << ": " << endl;
			cout << "HORIZONTAL: "; for (auto& x: horizontal_segments[i - 1][j]) cout << x.first << ' '; cout << endl;
			cout << "VERTICAL: "; for (auto& x: vertical_segments[i][j - 1]) cout << x.first << ' '; cout << endl;
		}
	} */

	return result;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 888 KB Output is correct
18 Correct 4 ms 888 KB Output is correct
19 Correct 4 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 888 KB Output is correct
18 Correct 4 ms 888 KB Output is correct
19 Correct 4 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 10 ms 3576 KB Output is correct
26 Correct 10 ms 3576 KB Output is correct
27 Correct 10 ms 3704 KB Output is correct
28 Correct 15 ms 3448 KB Output is correct
29 Correct 23 ms 4216 KB Output is correct
30 Correct 24 ms 4344 KB Output is correct
31 Correct 22 ms 4216 KB Output is correct
32 Correct 22 ms 4216 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 888 KB Output is correct
18 Correct 4 ms 888 KB Output is correct
19 Correct 4 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 10 ms 3576 KB Output is correct
26 Correct 10 ms 3576 KB Output is correct
27 Correct 10 ms 3704 KB Output is correct
28 Correct 15 ms 3448 KB Output is correct
29 Correct 23 ms 4216 KB Output is correct
30 Correct 24 ms 4344 KB Output is correct
31 Correct 22 ms 4216 KB Output is correct
32 Correct 22 ms 4216 KB Output is correct
33 Correct 97 ms 36216 KB Output is correct
34 Correct 114 ms 41504 KB Output is correct
35 Correct 153 ms 40952 KB Output is correct
36 Correct 165 ms 45856 KB Output is correct
37 Correct 102 ms 41816 KB Output is correct
38 Correct 104 ms 41720 KB Output is correct
39 Correct 114 ms 41720 KB Output is correct
40 Correct 104 ms 39564 KB Output is correct
41 Correct 167 ms 35832 KB Output is correct
42 Correct 201 ms 38500 KB Output is correct
43 Correct 311 ms 48088 KB Output is correct
44 Correct 326 ms 49616 KB Output is correct
45 Correct 148 ms 25308 KB Output is correct
46 Correct 147 ms 25116 KB Output is correct
47 Correct 274 ms 47736 KB Output is correct
48 Correct 280 ms 48112 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1016 KB Output is correct
2 Correct 4 ms 892 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 5 ms 1016 KB Output is correct
6 Correct 5 ms 1016 KB Output is correct
7 Correct 5 ms 1016 KB Output is correct
8 Correct 5 ms 892 KB Output is correct
9 Correct 5 ms 1016 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 4 ms 760 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 931 ms 205148 KB Output is correct
3 Correct 2089 ms 440176 KB Output is correct
4 Correct 2100 ms 442148 KB Output is correct
5 Correct 2120 ms 442232 KB Output is correct
6 Correct 463 ms 172436 KB Output is correct
7 Correct 899 ms 323384 KB Output is correct
8 Correct 911 ms 344704 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 888 KB Output is correct
18 Correct 4 ms 888 KB Output is correct
19 Correct 4 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 10 ms 3576 KB Output is correct
26 Correct 10 ms 3576 KB Output is correct
27 Correct 10 ms 3704 KB Output is correct
28 Correct 15 ms 3448 KB Output is correct
29 Correct 23 ms 4216 KB Output is correct
30 Correct 24 ms 4344 KB Output is correct
31 Correct 22 ms 4216 KB Output is correct
32 Correct 22 ms 4216 KB Output is correct
33 Correct 97 ms 36216 KB Output is correct
34 Correct 114 ms 41504 KB Output is correct
35 Correct 153 ms 40952 KB Output is correct
36 Correct 165 ms 45856 KB Output is correct
37 Correct 102 ms 41816 KB Output is correct
38 Correct 104 ms 41720 KB Output is correct
39 Correct 114 ms 41720 KB Output is correct
40 Correct 104 ms 39564 KB Output is correct
41 Correct 167 ms 35832 KB Output is correct
42 Correct 201 ms 38500 KB Output is correct
43 Correct 311 ms 48088 KB Output is correct
44 Correct 326 ms 49616 KB Output is correct
45 Correct 148 ms 25308 KB Output is correct
46 Correct 147 ms 25116 KB Output is correct
47 Correct 274 ms 47736 KB Output is correct
48 Correct 280 ms 48112 KB Output is correct
49 Correct 4 ms 1016 KB Output is correct
50 Correct 4 ms 892 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 5 ms 1016 KB Output is correct
54 Correct 5 ms 1016 KB Output is correct
55 Correct 5 ms 1016 KB Output is correct
56 Correct 5 ms 892 KB Output is correct
57 Correct 5 ms 1016 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 4 ms 760 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 931 ms 205148 KB Output is correct
62 Correct 2089 ms 440176 KB Output is correct
63 Correct 2100 ms 442148 KB Output is correct
64 Correct 2120 ms 442232 KB Output is correct
65 Correct 463 ms 172436 KB Output is correct
66 Correct 899 ms 323384 KB Output is correct
67 Correct 911 ms 344704 KB Output is correct
68 Correct 1358 ms 409096 KB Output is correct
69 Correct 1559 ms 481500 KB Output is correct
70 Correct 2631 ms 472328 KB Output is correct
71 Correct 2427 ms 539436 KB Output is correct
72 Correct 1333 ms 474676 KB Output is correct
73 Correct 2498 ms 352388 KB Output is correct
74 Correct 2709 ms 371460 KB Output is correct
75 Correct 4325 ms 586232 KB Output is correct
76 Correct 2618 ms 381736 KB Output is correct
77 Correct 3411 ms 509048 KB Output is correct
78 Correct 4382 ms 635988 KB Output is correct
79 Correct 2393 ms 363128 KB Output is correct
80 Correct 4136 ms 618916 KB Output is correct
81 Correct 4045 ms 600864 KB Output is correct
82 Correct 813 ms 317560 KB Output is correct
83 Correct 1347 ms 521612 KB Output is correct
84 Correct 1376 ms 521420 KB Output is correct
85 Correct 1416 ms 522140 KB Output is correct
86 Correct 2 ms 256 KB Output is correct
87 Correct 2 ms 256 KB Output is correct
88 Correct 2 ms 376 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 256 KB Output is correct