oj.uz

Submission #272822

# Submission time Handle Problem Language Result Execution time Memory
272822 2020-08-18T15:50:41 Z maximath_1 Rectangles (IOI19_rect) C++17
100 / 100
 2125 ms 213112 KB 
#include "rect.h"
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long

vector<int> row[2505], col[2505];
int n, m, fwt[2505];
int lr[2505][2505], cr[2505][2505];
int lc[2505][2505], cc[2505][2505];

void upd(int ps, int v){
	for(; ps < 2505; ps += ps & -ps)
		fwt[ps] += v;
}
int que(int ps){
	int rs = 0;
	for(; ps > 0; ps -= ps & -ps)
		rs += fwt[ps];
	return rs;
}

pair<int, int> get_row(int l, int r, int cr_){
	if(lr[l][r] != cr_ - 1) cr[l][r] = 0;
	cr[l][r] ++; lr[l][r] = cr_;
	return {r - l - 1, cr[l][r]};
}
pair<int, int> get_col(int l, int r, int cr_){
	if(lc[l][r] != cr_ - 1) cc[l][r] = 0;
	cc[l][r] ++; lc[l][r] = cr_;
	return {r - l - 1, cc[l][r]};
}

ll solve(vector<pair<int, int> > pr, vector<pair<int, int> > pc){
	ll rs = 0ll;
	for(auto &i : pc) swap(i.first, i.second);
	sort(pr.rbegin(), pr.rend());
	sort(pc.rbegin(), pc.rend());

	int ps = 0;
	for(auto i : pr){
		for(; ps < pc.size() && i.first <= pc[ps].first; ps ++)
			upd(pc[ps].second, 1);
		rs += que(i.second);
	}
	for(int i = 0; i < ps; i ++)
		upd(pc[i].second, -1);

	return rs;
}

ll count_rectangles(vector<vector<int> > a){
	n = a.size(), m = a[0].size();
	for(int i = 0; i < n; i ++) row[i] = {0};
	for(int i = 0; i < m; i ++) col[i] = {0};

	ll ans = 0ll;
	
	for(int i = 0; i < n - 1; i ++) for(int j = 0; j < m - 1; j ++){
		bool eq = false;
		vector<pair<int, int> > pr;
		for(; row[i].size();){
			int nw = row[i].back();
			if(nw < j && !eq)
				pr.push_back(get_row(nw, j + 1, i));
			if(a[i][nw] <= a[i][j + 1]){
				if(a[i][nw] == a[i][j + 1]) eq = true;
				row[i].pop_back();
			}else break;
		}
		row[i].push_back(j + 1);

		eq = false;
		vector<pair<int, int> > pc;
		for(; col[j].size();){
			int nw = col[j].back();
			if(nw < i && !eq)
				pc.push_back(get_col(nw, i + 1, j));
			if(a[nw][j] <= a[i + 1][j]){
				if(a[nw][j] == a[i + 1][j]) eq = true;
				col[j].pop_back();
			}else break;
		}
		col[j].push_back(i + 1);

		ans += solve(pr, pc);
	}

	return ans;
}

Compilation message

rect.cpp: In function 'long long int solve(std::vector<std::pair<int, int> >, std::vector<std::pair<int, int> >)':
rect.cpp:42:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |   for(; ps < pc.size() && i.first <= pc[ps].first; ps ++)
      |         ~~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 1792 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 3 ms 1792 KB Output is correct
21 Correct 5 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 4 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 896 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 512 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 1792 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 3 ms 1792 KB Output is correct
21 Correct 5 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 4 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 9 ms 4608 KB Output is correct
26 Correct 12 ms 4608 KB Output is correct
27 Correct 9 ms 4736 KB Output is correct
28 Correct 13 ms 4096 KB Output is correct
29 Correct 16 ms 4352 KB Output is correct
30 Correct 14 ms 4480 KB Output is correct
31 Correct 14 ms 4328 KB Output is correct
32 Correct 14 ms 4352 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 896 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 512 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 1792 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 3 ms 1792 KB Output is correct
21 Correct 5 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 4 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 9 ms 4608 KB Output is correct
26 Correct 12 ms 4608 KB Output is correct
27 Correct 9 ms 4736 KB Output is correct
28 Correct 13 ms 4096 KB Output is correct
29 Correct 16 ms 4352 KB Output is correct
30 Correct 14 ms 4480 KB Output is correct
31 Correct 14 ms 4328 KB Output is correct
32 Correct 14 ms 4352 KB Output is correct
33 Correct 90 ms 25464 KB Output is correct
34 Correct 94 ms 25336 KB Output is correct
35 Correct 108 ms 25336 KB Output is correct
36 Correct 121 ms 25336 KB Output is correct
37 Correct 104 ms 24568 KB Output is correct
38 Correct 107 ms 24568 KB Output is correct
39 Correct 108 ms 24824 KB Output is correct
40 Correct 100 ms 23884 KB Output is correct
41 Correct 66 ms 16632 KB Output is correct
42 Correct 98 ms 16632 KB Output is correct
43 Correct 192 ms 20088 KB Output is correct
44 Correct 170 ms 22264 KB Output is correct
45 Correct 100 ms 14456 KB Output is correct
46 Correct 107 ms 14324 KB Output is correct
47 Correct 165 ms 19064 KB Output is correct
48 Correct 156 ms 20088 KB Output is correct
49 Correct 0 ms 384 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 1 ms 896 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 512 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 20864 KB Output is correct
2 Correct 15 ms 17792 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 13 ms 16128 KB Output is correct
6 Correct 14 ms 15616 KB Output is correct
7 Correct 12 ms 16000 KB Output is correct
8 Correct 11 ms 14848 KB Output is correct
9 Correct 11 ms 14720 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 10 ms 10752 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 408 ms 57464 KB Output is correct
3 Correct 833 ms 102040 KB Output is correct
4 Correct 862 ms 102364 KB Output is correct
5 Correct 836 ms 102648 KB Output is correct
6 Correct 149 ms 30840 KB Output is correct
7 Correct 284 ms 58168 KB Output is correct
8 Correct 293 ms 62072 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 768 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 1792 KB Output is correct
18 Correct 3 ms 1920 KB Output is correct
19 Correct 3 ms 1920 KB Output is correct
20 Correct 3 ms 1792 KB Output is correct
21 Correct 5 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 4 ms 1792 KB Output is correct
24 Correct 2 ms 1408 KB Output is correct
25 Correct 9 ms 4608 KB Output is correct
26 Correct 12 ms 4608 KB Output is correct
27 Correct 9 ms 4736 KB Output is correct
28 Correct 13 ms 4096 KB Output is correct
29 Correct 16 ms 4352 KB Output is correct
30 Correct 14 ms 4480 KB Output is correct
31 Correct 14 ms 4328 KB Output is correct
32 Correct 14 ms 4352 KB Output is correct
33 Correct 90 ms 25464 KB Output is correct
34 Correct 94 ms 25336 KB Output is correct
35 Correct 108 ms 25336 KB Output is correct
36 Correct 121 ms 25336 KB Output is correct
37 Correct 104 ms 24568 KB Output is correct
38 Correct 107 ms 24568 KB Output is correct
39 Correct 108 ms 24824 KB Output is correct
40 Correct 100 ms 23884 KB Output is correct
41 Correct 66 ms 16632 KB Output is correct
42 Correct 98 ms 16632 KB Output is correct
43 Correct 192 ms 20088 KB Output is correct
44 Correct 170 ms 22264 KB Output is correct
45 Correct 100 ms 14456 KB Output is correct
46 Correct 107 ms 14324 KB Output is correct
47 Correct 165 ms 19064 KB Output is correct
48 Correct 156 ms 20088 KB Output is correct
49 Correct 14 ms 20864 KB Output is correct
50 Correct 15 ms 17792 KB Output is correct
51 Correct 1 ms 640 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 13 ms 16128 KB Output is correct
54 Correct 14 ms 15616 KB Output is correct
55 Correct 12 ms 16000 KB Output is correct
56 Correct 11 ms 14848 KB Output is correct
57 Correct 11 ms 14720 KB Output is correct
58 Correct 1 ms 512 KB Output is correct
59 Correct 10 ms 10752 KB Output is correct
60 Correct 1 ms 512 KB Output is correct
61 Correct 408 ms 57464 KB Output is correct
62 Correct 833 ms 102040 KB Output is correct
63 Correct 862 ms 102364 KB Output is correct
64 Correct 836 ms 102648 KB Output is correct
65 Correct 149 ms 30840 KB Output is correct
66 Correct 284 ms 58168 KB Output is correct
67 Correct 293 ms 62072 KB Output is correct
68 Correct 1140 ms 213112 KB Output is correct
69 Correct 1293 ms 211260 KB Output is correct
70 Correct 1528 ms 185876 KB Output is correct
71 Correct 1647 ms 184692 KB Output is correct
72 Correct 1540 ms 187560 KB Output is correct
73 Correct 1291 ms 94072 KB Output is correct
74 Correct 1392 ms 110584 KB Output is correct
75 Correct 2125 ms 139932 KB Output is correct
76 Correct 1277 ms 97528 KB Output is correct
77 Correct 1725 ms 120824 KB Output is correct
78 Correct 2089 ms 145236 KB Output is correct
79 Correct 1134 ms 87472 KB Output is correct
80 Correct 1930 ms 117496 KB Output is correct
81 Correct 1915 ms 113388 KB Output is correct
82 Correct 829 ms 116856 KB Output is correct
83 Correct 1347 ms 187512 KB Output is correct
84 Correct 1339 ms 187616 KB Output is correct
85 Correct 1340 ms 187548 KB Output is correct
86 Correct 0 ms 384 KB Output is correct
87 Correct 0 ms 384 KB Output is correct
88 Correct 1 ms 896 KB Output is correct
89 Correct 1 ms 384 KB Output is correct
90 Correct 1 ms 512 KB Output is correct