oj.uz

Submission #171201

# Submission time Handle Problem Language Result Execution time Memory
171201 2019-12-27T18:20:47 Z nobik Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 608712 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) {
			/* 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 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 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 1 ms 380 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 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 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 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 760 KB Output is correct
19 Correct 9 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 6 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 1 ms 380 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 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 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 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 760 KB Output is correct
19 Correct 9 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 6 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 10 ms 3320 KB Output is correct
26 Correct 11 ms 3320 KB Output is correct
27 Correct 10 ms 3320 KB Output is correct
28 Correct 17 ms 3320 KB Output is correct
29 Correct 27 ms 4088 KB Output is correct
30 Correct 28 ms 4088 KB Output is correct
31 Correct 26 ms 3960 KB Output is correct
32 Correct 25 ms 3832 KB Output is correct
33 Correct 1 ms 380 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 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 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 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 760 KB Output is correct
19 Correct 9 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 6 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 10 ms 3320 KB Output is correct
26 Correct 11 ms 3320 KB Output is correct
27 Correct 10 ms 3320 KB Output is correct
28 Correct 17 ms 3320 KB Output is correct
29 Correct 27 ms 4088 KB Output is correct
30 Correct 28 ms 4088 KB Output is correct
31 Correct 26 ms 3960 KB Output is correct
32 Correct 25 ms 3832 KB Output is correct
33 Correct 99 ms 33032 KB Output is correct
34 Correct 129 ms 38296 KB Output is correct
35 Correct 177 ms 37872 KB Output is correct
36 Correct 198 ms 42608 KB Output is correct
37 Correct 107 ms 38460 KB Output is correct
38 Correct 112 ms 38648 KB Output is correct
39 Correct 116 ms 38524 KB Output is correct
40 Correct 104 ms 36344 KB Output is correct
41 Correct 173 ms 35116 KB Output is correct
42 Correct 216 ms 37496 KB Output is correct
43 Correct 356 ms 46328 KB Output is correct
44 Correct 378 ms 46392 KB Output is correct
45 Correct 192 ms 23404 KB Output is correct
46 Correct 177 ms 23392 KB Output is correct
47 Correct 335 ms 44792 KB Output is correct
48 Correct 339 ms 44768 KB Output is correct
49 Correct 1 ms 380 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

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1016 KB Output is correct
2 Correct 4 ms 888 KB Output is correct
3 Correct 4 ms 760 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 5 ms 888 KB Output is correct
7 Correct 5 ms 888 KB Output is correct
8 Correct 5 ms 888 KB Output is correct
9 Correct 5 ms 888 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1111 ms 202296 KB Output is correct
3 Correct 2466 ms 438864 KB Output is correct
4 Correct 2539 ms 440900 KB Output is correct
5 Correct 2480 ms 441064 KB Output is correct
6 Correct 462 ms 169748 KB Output is correct
7 Correct 924 ms 322124 KB Output is correct
8 Correct 966 ms 343288 KB Output is correct
9 Correct 1 ms 380 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
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 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 348 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 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 760 KB Output is correct
19 Correct 9 ms 888 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 6 ms 888 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 6 ms 888 KB Output is correct
24 Correct 4 ms 632 KB Output is correct
25 Correct 10 ms 3320 KB Output is correct
26 Correct 11 ms 3320 KB Output is correct
27 Correct 10 ms 3320 KB Output is correct
28 Correct 17 ms 3320 KB Output is correct
29 Correct 27 ms 4088 KB Output is correct
30 Correct 28 ms 4088 KB Output is correct
31 Correct 26 ms 3960 KB Output is correct
32 Correct 25 ms 3832 KB Output is correct
33 Correct 99 ms 33032 KB Output is correct
34 Correct 129 ms 38296 KB Output is correct
35 Correct 177 ms 37872 KB Output is correct
36 Correct 198 ms 42608 KB Output is correct
37 Correct 107 ms 38460 KB Output is correct
38 Correct 112 ms 38648 KB Output is correct
39 Correct 116 ms 38524 KB Output is correct
40 Correct 104 ms 36344 KB Output is correct
41 Correct 173 ms 35116 KB Output is correct
42 Correct 216 ms 37496 KB Output is correct
43 Correct 356 ms 46328 KB Output is correct
44 Correct 378 ms 46392 KB Output is correct
45 Correct 192 ms 23404 KB Output is correct
46 Correct 177 ms 23392 KB Output is correct
47 Correct 335 ms 44792 KB Output is correct
48 Correct 339 ms 44768 KB Output is correct
49 Correct 4 ms 1016 KB Output is correct
50 Correct 4 ms 888 KB Output is correct
51 Correct 4 ms 760 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 5 ms 888 KB Output is correct
54 Correct 5 ms 888 KB Output is correct
55 Correct 5 ms 888 KB Output is correct
56 Correct 5 ms 888 KB Output is correct
57 Correct 5 ms 888 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 4 ms 760 KB Output is correct
60 Correct 1 ms 376 KB Output is correct
61 Correct 1111 ms 202296 KB Output is correct
62 Correct 2466 ms 438864 KB Output is correct
63 Correct 2539 ms 440900 KB Output is correct
64 Correct 2480 ms 441064 KB Output is correct
65 Correct 462 ms 169748 KB Output is correct
66 Correct 924 ms 322124 KB Output is correct
67 Correct 966 ms 343288 KB Output is correct
68 Correct 1306 ms 408516 KB Output is correct
69 Correct 1680 ms 527576 KB Output is correct
70 Correct 2909 ms 495644 KB Output is correct
71 Correct 2979 ms 562784 KB Output is correct
72 Correct 1407 ms 522148 KB Output is correct
73 Correct 3033 ms 365384 KB Output is correct
74 Correct 3191 ms 393464 KB Output is correct
75 Execution timed out 5105 ms 608712 KB Time limit exceeded
76 Halted 0 ms 0 KB -