oj.uz

Submission #267149

# Submission time Handle Problem Language Result Execution time Memory
267149 2020-08-15T22:07:10 Z johutha Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 606032 KB 
#include "rect.h"
#include <vector>
#include <iostream>
#include <algorithm>

#define int long long

using namespace std;

struct fenw
{
	int n;
	vector<int> table;

	int query(int k)
	{
		int res = 0;
		for (; k; k -= (k & (-k))) res += table[k];
		return res;
	}

	void update(int k, int v)
	{
		k++;
		for (; k <= n; k += (k & (-k))) table[k] += v;
	}

	fenw(int in) : n(in), table(vector<int>(n + 1)) {}
};

struct bord
{
	int a, b;
	int st, en;

	bool operator<(const bord& ot)
	const {
		if (a != ot.a) return a < ot.a;
		if (b != ot.b) return b < ot.b;
		if (st != ot.st) return st < ot.st;
		return en < ot.en;
	}
};

vector<bord> compress(vector<bord> ip)
{
	vector<bord> res;
	sort(ip.begin(), ip.end());

	for (auto gp : ip)
	{
		if (res.empty() || res.back().a != gp.a || res.back().b != gp.b || res.back().en + 1 != gp.st) res.push_back(gp);
		else res.back().en = gp.en;
	}
	return res;
}

int count(vector<pair<int,int>> a, vector<pair<int,int>> b)
{
	/*
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());

	auto b2 = b;
	for (auto &p : b2) swap(p.first, p.second);
	sort(b2.begin(), b2.end());
	for (auto &p : b2) swap(p.first, p.second);

	fenw f(b.size());

	int res = 0;
	int s = 0;
	for (int i = 0; i < (int)a.size(); i++)
	{
		while (s < (int)b2.size() && b2[s].second <= a[i].first)
		{
			int id = lower_bound(b.begin(), b.end(), b2[i]) - b.begin();
			f.update(id, 1);
			s++;
		}
		int lb = lower_bound(b.begin(), b.end(), make_pair(a[i].second, -1000ll)) - b.begin();
		res += f.query(b.size()) - f.query(lb);
	}
	*/
	int res = 0;
	for (auto p1 : a)
	{
		for (auto p2 : b)
		{
			if (p1.first >= p2.second && p2.first >= p1.second) res++;
		}
	}
	return res;
}

int count_rectangles(vector<vector<signed>> ip)
{
	int r = ip.size();
	int c = ip[0].size();

	vector<bord> hor;
	vector<bord> ver;

	for (int y = 0; y < r; y++)
	{
		vector<pair<int,int>> st;
		for (int x = 0; x < c; x++)
		{
			int sts = st.size();

			for (int i = sts - 1; i >= 0; i--)
			{
				if (st[i].first + 1 < x) hor.push_back(bord{st[i].first, x, y, y});
				if (st[i].second >= ip[y][x]) break;
			}

			while (!st.empty() && st.back().second <= ip[y][x]) st.pop_back();
			st.emplace_back(x, ip[y][x]);
		}
	}

	for (int x = 0; x < c; x++)
	{
		vector<pair<int,int>> st;
		for (int y = 0; y < r; y++)
		{
			int sts = st.size();

			for (int i = sts - 1; i >= 0; i--)
			{
				if (st[i].first + 1 < y) ver.push_back(bord{st[i].first, y, x, x});
				if (st[i].second >= ip[y][x]) break;
			}

			while (!st.empty() && st.back().second <= ip[y][x]) st.pop_back();
			st.emplace_back(y, ip[y][x]);
		}
	}

	hor = compress(hor);
	ver = compress(ver);

	vector<vector<vector<int>>> lw(r, vector<vector<int>>(c));
	vector<vector<vector<int>>> rg(r, vector<vector<int>>(c));

	for (int i = 0; i < (int)hor.size(); i++)
	{
		for (int j = hor[i].st; j <= hor[i].en; j++)
		{
			rg[j][hor[i].b - 1].push_back(i);
		}
	}

	for (int i = 0; i < (int)ver.size(); i++)
	{
		for (int j = ver[i].st; j <= ver[i].en; j++)
		{
			lw[ver[i].b - 1][j].push_back(i);
		}
	}

	int res = 0;

	for (int i = 0; i < r; i++)
	{
		for (int j = 0; j < c; j++)
		{
			vector<pair<int,int>> nhor;
			vector<pair<int,int>> nver;
			for (auto k : lw[i][j]) nver.emplace_back(j - ver[k].st + 1, ver[k].b - ver[k].a - 1);
			for (auto k : rg[i][j]) nhor.emplace_back(i - hor[k].st + 1, hor[k].b - hor[k].a - 1);
			res += count(nhor, nver);
		}
	}

	return res;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 496 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 3 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 3 ms 1000 KB Output is correct
21 Correct 5 ms 1308 KB Output is correct
22 Correct 7 ms 1308 KB Output is correct
23 Correct 5 ms 1276 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 496 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 3 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 3 ms 1000 KB Output is correct
21 Correct 5 ms 1308 KB Output is correct
22 Correct 7 ms 1308 KB Output is correct
23 Correct 5 ms 1276 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 20 ms 4976 KB Output is correct
26 Correct 20 ms 4976 KB Output is correct
27 Correct 20 ms 4976 KB Output is correct
28 Correct 16 ms 4188 KB Output is correct
29 Correct 41 ms 6260 KB Output is correct
30 Correct 35 ms 6260 KB Output is correct
31 Correct 33 ms 5748 KB Output is correct
32 Correct 36 ms 5744 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 496 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 3 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 3 ms 1000 KB Output is correct
21 Correct 5 ms 1308 KB Output is correct
22 Correct 7 ms 1308 KB Output is correct
23 Correct 5 ms 1276 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 20 ms 4976 KB Output is correct
26 Correct 20 ms 4976 KB Output is correct
27 Correct 20 ms 4976 KB Output is correct
28 Correct 16 ms 4188 KB Output is correct
29 Correct 41 ms 6260 KB Output is correct
30 Correct 35 ms 6260 KB Output is correct
31 Correct 33 ms 5748 KB Output is correct
32 Correct 36 ms 5744 KB Output is correct
33 Correct 273 ms 48456 KB Output is correct
34 Correct 189 ms 53328 KB Output is correct
35 Correct 208 ms 53036 KB Output is correct
36 Correct 218 ms 57776 KB Output is correct
37 Correct 297 ms 50464 KB Output is correct
38 Correct 250 ms 50272 KB Output is correct
39 Correct 271 ms 50240 KB Output is correct
40 Correct 249 ms 47044 KB Output is correct
41 Correct 154 ms 41864 KB Output is correct
42 Correct 249 ms 48024 KB Output is correct
43 Correct 506 ms 75348 KB Output is correct
44 Correct 515 ms 76008 KB Output is correct
45 Correct 265 ms 38056 KB Output is correct
46 Correct 249 ms 37992 KB Output is correct
47 Correct 471 ms 70304 KB Output is correct
48 Correct 467 ms 70300 KB Output is correct
49 Correct 0 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 0 ms 384 KB Output is correct
53 Correct 0 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1096 KB Output is correct
2 Correct 3 ms 1096 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 5 ms 1404 KB Output is correct
6 Correct 4 ms 1276 KB Output is correct
7 Correct 4 ms 1404 KB Output is correct
8 Correct 4 ms 1276 KB Output is correct
9 Correct 4 ms 1276 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 3 ms 1020 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1111 ms 243248 KB Output is correct
3 Correct 2468 ms 527808 KB Output is correct
4 Correct 2588 ms 530180 KB Output is correct
5 Correct 2529 ms 530488 KB Output is correct
6 Correct 237 ms 169720 KB Output is correct
7 Correct 484 ms 322040 KB Output is correct
8 Correct 524 ms 343364 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 496 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 3 ms 1016 KB Output is correct
19 Correct 4 ms 1016 KB Output is correct
20 Correct 3 ms 1000 KB Output is correct
21 Correct 5 ms 1308 KB Output is correct
22 Correct 7 ms 1308 KB Output is correct
23 Correct 5 ms 1276 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 20 ms 4976 KB Output is correct
26 Correct 20 ms 4976 KB Output is correct
27 Correct 20 ms 4976 KB Output is correct
28 Correct 16 ms 4188 KB Output is correct
29 Correct 41 ms 6260 KB Output is correct
30 Correct 35 ms 6260 KB Output is correct
31 Correct 33 ms 5748 KB Output is correct
32 Correct 36 ms 5744 KB Output is correct
33 Correct 273 ms 48456 KB Output is correct
34 Correct 189 ms 53328 KB Output is correct
35 Correct 208 ms 53036 KB Output is correct
36 Correct 218 ms 57776 KB Output is correct
37 Correct 297 ms 50464 KB Output is correct
38 Correct 250 ms 50272 KB Output is correct
39 Correct 271 ms 50240 KB Output is correct
40 Correct 249 ms 47044 KB Output is correct
41 Correct 154 ms 41864 KB Output is correct
42 Correct 249 ms 48024 KB Output is correct
43 Correct 506 ms 75348 KB Output is correct
44 Correct 515 ms 76008 KB Output is correct
45 Correct 265 ms 38056 KB Output is correct
46 Correct 249 ms 37992 KB Output is correct
47 Correct 471 ms 70304 KB Output is correct
48 Correct 467 ms 70300 KB Output is correct
49 Correct 3 ms 1096 KB Output is correct
50 Correct 3 ms 1096 KB Output is correct
51 Correct 1 ms 768 KB Output is correct
52 Correct 0 ms 256 KB Output is correct
53 Correct 5 ms 1404 KB Output is correct
54 Correct 4 ms 1276 KB Output is correct
55 Correct 4 ms 1404 KB Output is correct
56 Correct 4 ms 1276 KB Output is correct
57 Correct 4 ms 1276 KB Output is correct
58 Correct 2 ms 640 KB Output is correct
59 Correct 3 ms 1020 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 1111 ms 243248 KB Output is correct
62 Correct 2468 ms 527808 KB Output is correct
63 Correct 2588 ms 530180 KB Output is correct
64 Correct 2529 ms 530488 KB Output is correct
65 Correct 237 ms 169720 KB Output is correct
66 Correct 484 ms 322040 KB Output is correct
67 Correct 524 ms 343364 KB Output is correct
68 Execution timed out 5098 ms 606032 KB Time limit exceeded
69 Halted 0 ms 0 KB -