oj.uz

Submission #291797

# Submission time Handle Problem Language Result Execution time Memory
291797 2020-09-05T19:18:19 Z pit4h Rectangles (IOI19_rect) C++14
100 / 100
 3685 ms 833200 KB 
#include "rect.h"
#include <bits/stdc++.h>
#define ll long long
#define st first
#define nd second
#define mp make_pair
using namespace std;
using vec2d = vector<vector<pair<int, int>>>;
int n, m;
struct Segment {
	int l, r, h;
};
ll solve(vector<Segment> a, vector<Segment> b) {
	ll res = 0;
	int nrA = 0, nrB = 0;
	vector<vector<int>> A(m+1), B(m+1);
	for(auto i: a) {
		A[i.h].push_back(nrA);
		nrA++;
	}
	for(auto i: b) {
		B[i.h].push_back(nrB);
		nrB++;
	}
	vector<vector<int>> cnt(n);
	vector<bool> occured(nrA);
	for(int h=m; h>=1; --h) {
		for(int i: A[h]) {
			cnt[a[i].l].push_back(i);
			cnt[a[i].r].push_back(i);
		}
		for(int i: B[h]) {
			for(int j=b[i].l; j<=b[i].r; ++j) {
				for(int k: cnt[j]) {
					if(occured[k]) res++;
					occured[k] = occured[k] ^ 1;
				}
			}
			for(int j=b[i].l; j<=b[i].r; ++j) {
				for(int k: cnt[j]) {
					occured[k] = occured[k] ^ 1;
				}
			}
		}
	}
	return res;
}
ll count_rectangles(vector<vector<int>> a) {
	n = a.size();
	m = a[0].size();
	vector<vec2d> horiz(n, vec2d(m));
	for(int i=0; i<n; ++i) {
		vector<int> mono;
		for(int j=0; j<m; ++j) {
			while(mono.size() && a[i][mono.back()] < a[i][j]) {
				if(mono.back()+1 <= j-1) {
					horiz[i][mono.back()+1].push_back(mp(j-1, 1));
				}
				mono.pop_back();
			}
			if(mono.size() && mono.back()+1 <= j-1) {
				horiz[i][mono.back()+1].push_back(mp(j-1, 1));	
			}
			if(mono.size() && a[i][mono.back()] == a[i][j]) {
				mono.pop_back();
			}
			mono.push_back(j);
		}
		if(i!=0) {
			for(int j=0; j<m; ++j) {
				int k = 0;
				for(auto &it: horiz[i][j]) {
					while(k<(int)horiz[i-1][j].size() && horiz[i-1][j][k].st < it.st) {
						k++;
					}
					if(k<(int)horiz[i-1][j].size() && horiz[i-1][j][k].st == it.st) {
						it.nd = horiz[i-1][j][k].nd + 1;
					}
				}
			}
		}
	}
	vector<vector<Segment>> segh(m);
	for(int i=0; i<n; ++i) {
		if(i < n-1) {
			for(int j=0; j<m; ++j) {
				int k = 0;
				for(auto it: horiz[i][j]) {
					while(k<(int)horiz[i+1][j].size() && horiz[i+1][j][k].st < it.st) {
						k++;
					}
					if(k==(int)horiz[i+1][j].size() || horiz[i+1][j][k].st != it.st) {
						segh[j].push_back({i-it.nd+1, i, it.st-j+1});
					}
				}
			}
		}
		else {
			for(int j=0; j<m; ++j) {
				for(auto it: horiz[i][j]) {
					segh[j].push_back({i-it.nd+1, i, it.st-j+1});
				}
			}
		}
	}
	/// **************************************
	/// *** horizontal segments calculated ***
	/// **************************************
	vector<vec2d> vert(m, vec2d(n));
	for(int j=m-1; j>=0; --j) {
		vector<int> mono;
		for(int i=0; i<n; ++i) {
			while(mono.size() && a[mono.back()][j] < a[i][j]) {
				if(mono.back()+1 <= i-1) {
					vert[j][mono.back()+1].push_back(mp(i-1, 1));
				}
				mono.pop_back();
			}
			if(mono.size() && mono.back()+1 <= i-1) {
				vert[j][mono.back()+1].push_back(mp(i-1, 1));
			}
			if(mono.size() && a[mono.back()][j] == a[i][j]) {
				mono.pop_back();
			}
			mono.push_back(i);
		}
		if(j < m-1) {
			for(int i=0; i<n; ++i) {
				int k = 0;
				for(auto &it: vert[j][i]) {
					while(k<(int)vert[j+1][i].size() && vert[j+1][i][k].st < it.st) {
						k++;
					}
					if(k<(int)vert[j+1][i].size() && vert[j+1][i][k].st == it.st) {
						it.nd = vert[j+1][i][k].nd + 1;
					}
				}
			}
		}
	}

	vector<vector<Segment>> segv(m);
	for(int j=m-1; j>=0; --j) {
		for(int i=0; i<n; ++i) {
			for(auto it: vert[j][i]) {
				segv[j].push_back({i, it.st, it.nd});
			}
		}
	}
	ll ans = 0;
	for(int col=0; col<m; ++col) {
		ans += solve(segv[col], segh[col]);
	}
	return ans;
}

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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 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 1 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 5 ms 1152 KB Output is correct
19 Correct 5 ms 1152 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1152 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 640 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 1 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 5 ms 1152 KB Output is correct
19 Correct 5 ms 1152 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1152 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 18 ms 5632 KB Output is correct
26 Correct 16 ms 5632 KB Output is correct
27 Correct 24 ms 5632 KB Output is correct
28 Correct 14 ms 3968 KB Output is correct
29 Correct 23 ms 5120 KB Output is correct
30 Correct 23 ms 5120 KB Output is correct
31 Correct 22 ms 4992 KB Output is correct
32 Correct 22 ms 4864 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 1 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 5 ms 1152 KB Output is correct
19 Correct 5 ms 1152 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1152 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 18 ms 5632 KB Output is correct
26 Correct 16 ms 5632 KB Output is correct
27 Correct 24 ms 5632 KB Output is correct
28 Correct 14 ms 3968 KB Output is correct
29 Correct 23 ms 5120 KB Output is correct
30 Correct 23 ms 5120 KB Output is correct
31 Correct 22 ms 4992 KB Output is correct
32 Correct 22 ms 4864 KB Output is correct
33 Correct 137 ms 50296 KB Output is correct
34 Correct 131 ms 46200 KB Output is correct
35 Correct 125 ms 45944 KB Output is correct
36 Correct 112 ms 41464 KB Output is correct
37 Correct 184 ms 66428 KB Output is correct
38 Correct 188 ms 66296 KB Output is correct
39 Correct 191 ms 66424 KB Output is correct
40 Correct 173 ms 62328 KB Output is correct
41 Correct 116 ms 39160 KB Output is correct
42 Correct 140 ms 44024 KB Output is correct
43 Correct 260 ms 61432 KB Output is correct
44 Correct 272 ms 61816 KB Output is correct
45 Correct 134 ms 30840 KB Output is correct
46 Correct 143 ms 33016 KB Output is correct
47 Correct 251 ms 59000 KB Output is correct
48 Correct 260 ms 60408 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 1 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 1536 KB Output is correct
2 Correct 44 ms 1408 KB Output is correct
3 Correct 56 ms 1024 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 70 ms 1408 KB Output is correct
6 Correct 59 ms 1408 KB Output is correct
7 Correct 58 ms 1408 KB Output is correct
8 Correct 60 ms 1408 KB Output is correct
9 Correct 58 ms 1408 KB Output is correct
10 Correct 55 ms 896 KB Output is correct
11 Correct 57 ms 1152 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 735 ms 230396 KB Output is correct
3 Correct 1546 ms 499076 KB Output is correct
4 Correct 1539 ms 501764 KB Output is correct
5 Correct 1527 ms 502504 KB Output is correct
6 Correct 307 ms 173692 KB Output is correct
7 Correct 609 ms 326644 KB Output is correct
8 Correct 637 ms 347944 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 1 ms 256 KB Output is correct

Subtask #7
28.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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 4 ms 1152 KB Output is correct
18 Correct 5 ms 1152 KB Output is correct
19 Correct 5 ms 1152 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1152 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 18 ms 5632 KB Output is correct
26 Correct 16 ms 5632 KB Output is correct
27 Correct 24 ms 5632 KB Output is correct
28 Correct 14 ms 3968 KB Output is correct
29 Correct 23 ms 5120 KB Output is correct
30 Correct 23 ms 5120 KB Output is correct
31 Correct 22 ms 4992 KB Output is correct
32 Correct 22 ms 4864 KB Output is correct
33 Correct 137 ms 50296 KB Output is correct
34 Correct 131 ms 46200 KB Output is correct
35 Correct 125 ms 45944 KB Output is correct
36 Correct 112 ms 41464 KB Output is correct
37 Correct 184 ms 66428 KB Output is correct
38 Correct 188 ms 66296 KB Output is correct
39 Correct 191 ms 66424 KB Output is correct
40 Correct 173 ms 62328 KB Output is correct
41 Correct 116 ms 39160 KB Output is correct
42 Correct 140 ms 44024 KB Output is correct
43 Correct 260 ms 61432 KB Output is correct
44 Correct 272 ms 61816 KB Output is correct
45 Correct 134 ms 30840 KB Output is correct
46 Correct 143 ms 33016 KB Output is correct
47 Correct 251 ms 59000 KB Output is correct
48 Correct 260 ms 60408 KB Output is correct
49 Correct 58 ms 1536 KB Output is correct
50 Correct 44 ms 1408 KB Output is correct
51 Correct 56 ms 1024 KB Output is correct
52 Correct 1 ms 288 KB Output is correct
53 Correct 70 ms 1408 KB Output is correct
54 Correct 59 ms 1408 KB Output is correct
55 Correct 58 ms 1408 KB Output is correct
56 Correct 60 ms 1408 KB Output is correct
57 Correct 58 ms 1408 KB Output is correct
58 Correct 55 ms 896 KB Output is correct
59 Correct 57 ms 1152 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 735 ms 230396 KB Output is correct
62 Correct 1546 ms 499076 KB Output is correct
63 Correct 1539 ms 501764 KB Output is correct
64 Correct 1527 ms 502504 KB Output is correct
65 Correct 307 ms 173692 KB Output is correct
66 Correct 609 ms 326644 KB Output is correct
67 Correct 637 ms 347944 KB Output is correct
68 Correct 2027 ms 634492 KB Output is correct
69 Correct 1864 ms 587160 KB Output is correct
70 Correct 1843 ms 592484 KB Output is correct
71 Correct 1606 ms 520500 KB Output is correct
72 Correct 2711 ms 822024 KB Output is correct
73 Correct 2242 ms 464108 KB Output is correct
74 Correct 2162 ms 470352 KB Output is correct
75 Correct 3631 ms 738912 KB Output is correct
76 Correct 2280 ms 458652 KB Output is correct
77 Correct 2870 ms 612244 KB Output is correct
78 Correct 3685 ms 746056 KB Output is correct
79 Correct 2092 ms 440380 KB Output is correct
80 Correct 3487 ms 699760 KB Output is correct
81 Correct 3398 ms 679480 KB Output is correct
82 Correct 1463 ms 497144 KB Output is correct
83 Correct 2691 ms 818788 KB Output is correct
84 Correct 2667 ms 819792 KB Output is correct
85 Correct 2686 ms 833200 KB Output is correct
86 Correct 0 ms 256 KB Output is correct
87 Correct 0 ms 256 KB Output is correct
88 Correct 1 ms 384 KB Output is correct
89 Correct 0 ms 384 KB Output is correct
90 Correct 1 ms 256 KB Output is correct