oj.uz

Submission #144705

# Submission time Handle Problem Language Result Execution time Memory
144705 2019-08-17T14:27:37 Z nvmdava Rectangles (IOI19_rect) C++17
72 / 100
 4224 ms 1048576 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

int n, m;
int p[2505], lc[2505], rc[2505];

map<int, int> cnt[2][2505][2505];
int dir[2505][2505][4];
int arr[2505][2505];

int temp[2505];
void buildtree(int sz){

	vector<int> v = {0};
	for(int i = 1; i <= sz; i++){
		vector<int> t;
		while(temp[v.back()] < temp[i]){
			t.push_back(v.back());
			v.pop_back();
		}
		v.push_back(i);
		for(int j = t.size() - 1; j > 0; j--){
			p[t[j - 1]] = t[j];
		}
		if(!t.empty())p[t.back()] = i;
	}
	for(int i = v.size() - 1; i > 0; i--)
		p[v[i]] = v[i - 1];
	for(int i = 1; i <= sz; i++){
		if(p[i] > i){
			lc[p[i]] = i;
		} else {
			rc[p[i]] = i;
		}
	}

}

void travtree(int i1, int i2, int v, int l, int r){
	if(l != 0 && r != (i1 == 1 ? n + 1 : m + 1) && r - l > 1 && temp[l] != temp[v] && temp[r] != temp[v]){
		if(i1 == 0)
			cnt[i1][i2][r - 1][r - l - 1]++;
		else 
			cnt[i1][r - 1][i2][r - l - 1]++;
	}
	if(lc[v] != 0){
		travtree(i1, i2, lc[v], l, v);
	}
	if(rc[v] != 0){
		travtree(i1, i2, rc[v], v, r);
	}
}

void build(){
	for(int i = 1; i <= n; i++){
		memset(lc, 0, sizeof lc);
		memset(rc, 0, sizeof rc);
		
		for(int j = 0; j <= m; j++)
			temp[j] = arr[i][j];
		buildtree(m);
		travtree(0, i, 0, 0, m + 1);
	}
	for(int j = 1; j <= m; j++){
		memset(lc, 0, sizeof lc);
		memset(rc, 0, sizeof rc);

		for(int i = 0; i <= n; i++)
			temp[i] = arr[i][j];
		
		buildtree(n);
		travtree(1, j, 0, 0, n + 1);
	}
}

int bit[2505][2505];

void update(int x, int y, int v){
	for(int i = x; i < 2505; i += i & -i){
		for(int j = y; j < 2505; j += j & -j){
			bit[i][j] += v;
		}
	}
}

int query(int x, int y){
	int res = 0;
	for(int i = x; i > 0; i -= i & -i){
		for(int j = y; j > 0; j -= j & -j){
			res += bit[i][j];
		}
	}
	return res;
}

long long count_rectangles(vector<vector<int> > a){
	n = a.size();
	m = a[0].size();
	
	memset(arr, 0x3f, sizeof arr);

	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			arr[i + 1][j + 1] = a[i][j];
		}
	}

	build();
	int res = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			for(auto& x : cnt[0][i][j]){
				auto it = cnt[0][i - 1][j].find(x.first);
				if(it != cnt[0][i - 1][j].end())
					x.second = 1 + it -> second;
				update(x.first, x.second, 1);
			}
			for(auto& x : cnt[1][i][j]){
				auto it = cnt[1][i][j - 1].find(x.first);
				if(it != cnt[1][i][j - 1].end())
					x.second = 1 + it -> second;
				res += query(x.second, 2504);
				res -= query(x.second, x.first - 1);
			}
			for(auto& x : cnt[0][i][j])
				update(x.first, x.second, -1);
		}
	}
	return res;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 614628 KB Output is correct
2 Correct 597 ms 615044 KB Output is correct
3 Correct 562 ms 614776 KB Output is correct
4 Correct 571 ms 614856 KB Output is correct
5 Correct 555 ms 614540 KB Output is correct
6 Correct 560 ms 614852 KB Output is correct
7 Correct 558 ms 614748 KB Output is correct
8 Correct 556 ms 614852 KB Output is correct
9 Correct 562 ms 614776 KB Output is correct
10 Correct 598 ms 614736 KB Output is correct
11 Correct 562 ms 615016 KB Output is correct
12 Correct 560 ms 614712 KB Output is correct
13 Correct 560 ms 614484 KB Output is correct
14 Correct 569 ms 614388 KB Output is correct
15 Correct 552 ms 614416 KB Output is correct
16 Correct 555 ms 614636 KB Output is correct
17 Correct 575 ms 614516 KB Output is correct
18 Correct 555 ms 614392 KB Output is correct
19 Correct 558 ms 614752 KB Output is correct
20 Correct 590 ms 614460 KB Output is correct
21 Correct 550 ms 614520 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 614628 KB Output is correct
2 Correct 597 ms 615044 KB Output is correct
3 Correct 562 ms 614776 KB Output is correct
4 Correct 571 ms 614856 KB Output is correct
5 Correct 555 ms 614540 KB Output is correct
6 Correct 560 ms 614852 KB Output is correct
7 Correct 558 ms 614748 KB Output is correct
8 Correct 556 ms 614852 KB Output is correct
9 Correct 562 ms 614776 KB Output is correct
10 Correct 598 ms 614736 KB Output is correct
11 Correct 562 ms 615016 KB Output is correct
12 Correct 560 ms 614712 KB Output is correct
13 Correct 560 ms 614484 KB Output is correct
14 Correct 569 ms 614388 KB Output is correct
15 Correct 552 ms 614416 KB Output is correct
16 Correct 555 ms 614636 KB Output is correct
17 Correct 570 ms 616060 KB Output is correct
18 Correct 561 ms 615888 KB Output is correct
19 Correct 561 ms 615952 KB Output is correct
20 Correct 566 ms 614928 KB Output is correct
21 Correct 559 ms 615664 KB Output is correct
22 Correct 565 ms 615736 KB Output is correct
23 Correct 600 ms 615776 KB Output is correct
24 Correct 557 ms 614972 KB Output is correct
25 Correct 575 ms 614516 KB Output is correct
26 Correct 555 ms 614392 KB Output is correct
27 Correct 558 ms 614752 KB Output is correct
28 Correct 590 ms 614460 KB Output is correct
29 Correct 550 ms 614520 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 614628 KB Output is correct
2 Correct 597 ms 615044 KB Output is correct
3 Correct 562 ms 614776 KB Output is correct
4 Correct 571 ms 614856 KB Output is correct
5 Correct 555 ms 614540 KB Output is correct
6 Correct 560 ms 614852 KB Output is correct
7 Correct 558 ms 614748 KB Output is correct
8 Correct 556 ms 614852 KB Output is correct
9 Correct 562 ms 614776 KB Output is correct
10 Correct 598 ms 614736 KB Output is correct
11 Correct 562 ms 615016 KB Output is correct
12 Correct 560 ms 614712 KB Output is correct
13 Correct 560 ms 614484 KB Output is correct
14 Correct 569 ms 614388 KB Output is correct
15 Correct 552 ms 614416 KB Output is correct
16 Correct 555 ms 614636 KB Output is correct
17 Correct 570 ms 616060 KB Output is correct
18 Correct 561 ms 615888 KB Output is correct
19 Correct 561 ms 615952 KB Output is correct
20 Correct 566 ms 614928 KB Output is correct
21 Correct 559 ms 615664 KB Output is correct
22 Correct 565 ms 615736 KB Output is correct
23 Correct 600 ms 615776 KB Output is correct
24 Correct 557 ms 614972 KB Output is correct
25 Correct 593 ms 620580 KB Output is correct
26 Correct 593 ms 620572 KB Output is correct
27 Correct 589 ms 620416 KB Output is correct
28 Correct 579 ms 616456 KB Output is correct
29 Correct 601 ms 620024 KB Output is correct
30 Correct 606 ms 620144 KB Output is correct
31 Correct 597 ms 618868 KB Output is correct
32 Correct 602 ms 619312 KB Output is correct
33 Correct 575 ms 614516 KB Output is correct
34 Correct 555 ms 614392 KB Output is correct
35 Correct 558 ms 614752 KB Output is correct
36 Correct 590 ms 614460 KB Output is correct
37 Correct 550 ms 614520 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 614628 KB Output is correct
2 Correct 597 ms 615044 KB Output is correct
3 Correct 562 ms 614776 KB Output is correct
4 Correct 571 ms 614856 KB Output is correct
5 Correct 555 ms 614540 KB Output is correct
6 Correct 560 ms 614852 KB Output is correct
7 Correct 558 ms 614748 KB Output is correct
8 Correct 556 ms 614852 KB Output is correct
9 Correct 562 ms 614776 KB Output is correct
10 Correct 598 ms 614736 KB Output is correct
11 Correct 562 ms 615016 KB Output is correct
12 Correct 560 ms 614712 KB Output is correct
13 Correct 560 ms 614484 KB Output is correct
14 Correct 569 ms 614388 KB Output is correct
15 Correct 552 ms 614416 KB Output is correct
16 Correct 555 ms 614636 KB Output is correct
17 Correct 570 ms 616060 KB Output is correct
18 Correct 561 ms 615888 KB Output is correct
19 Correct 561 ms 615952 KB Output is correct
20 Correct 566 ms 614928 KB Output is correct
21 Correct 559 ms 615664 KB Output is correct
22 Correct 565 ms 615736 KB Output is correct
23 Correct 600 ms 615776 KB Output is correct
24 Correct 557 ms 614972 KB Output is correct
25 Correct 593 ms 620580 KB Output is correct
26 Correct 593 ms 620572 KB Output is correct
27 Correct 589 ms 620416 KB Output is correct
28 Correct 579 ms 616456 KB Output is correct
29 Correct 601 ms 620024 KB Output is correct
30 Correct 606 ms 620144 KB Output is correct
31 Correct 597 ms 618868 KB Output is correct
32 Correct 602 ms 619312 KB Output is correct
33 Correct 818 ms 648132 KB Output is correct
34 Correct 792 ms 648252 KB Output is correct
35 Correct 822 ms 648312 KB Output is correct
36 Correct 788 ms 648348 KB Output is correct
37 Correct 1032 ms 671228 KB Output is correct
38 Correct 1004 ms 671176 KB Output is correct
39 Correct 988 ms 671044 KB Output is correct
40 Correct 965 ms 667780 KB Output is correct
41 Correct 734 ms 630008 KB Output is correct
42 Correct 809 ms 636468 KB Output is correct
43 Correct 1088 ms 668548 KB Output is correct
44 Correct 1109 ms 672232 KB Output is correct
45 Correct 829 ms 643708 KB Output is correct
46 Correct 829 ms 644204 KB Output is correct
47 Correct 1077 ms 661756 KB Output is correct
48 Correct 1088 ms 663544 KB Output is correct
49 Correct 575 ms 614516 KB Output is correct
50 Correct 555 ms 614392 KB Output is correct
51 Correct 558 ms 614752 KB Output is correct
52 Correct 590 ms 614460 KB Output is correct
53 Correct 550 ms 614520 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 598 ms 639436 KB Output is correct
2 Correct 575 ms 635640 KB Output is correct
3 Correct 556 ms 614456 KB Output is correct
4 Correct 554 ms 614432 KB Output is correct
5 Correct 581 ms 618032 KB Output is correct
6 Correct 590 ms 618124 KB Output is correct
7 Correct 570 ms 618232 KB Output is correct
8 Correct 577 ms 617080 KB Output is correct
9 Correct 568 ms 617020 KB Output is correct
10 Correct 559 ms 616868 KB Output is correct
11 Correct 562 ms 617268 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 553 ms 614564 KB Output is correct
2 Correct 1631 ms 704300 KB Output is correct
3 Correct 2994 ms 809352 KB Output is correct
4 Correct 2970 ms 810204 KB Output is correct
5 Correct 2975 ms 810460 KB Output is correct
6 Correct 766 ms 638720 KB Output is correct
7 Correct 933 ms 660472 KB Output is correct
8 Correct 973 ms 663900 KB Output is correct
9 Correct 575 ms 614516 KB Output is correct
10 Correct 555 ms 614392 KB Output is correct
11 Correct 558 ms 614752 KB Output is correct
12 Correct 590 ms 614460 KB Output is correct
13 Correct 550 ms 614520 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 614628 KB Output is correct
2 Correct 597 ms 615044 KB Output is correct
3 Correct 562 ms 614776 KB Output is correct
4 Correct 571 ms 614856 KB Output is correct
5 Correct 555 ms 614540 KB Output is correct
6 Correct 560 ms 614852 KB Output is correct
7 Correct 558 ms 614748 KB Output is correct
8 Correct 556 ms 614852 KB Output is correct
9 Correct 562 ms 614776 KB Output is correct
10 Correct 598 ms 614736 KB Output is correct
11 Correct 562 ms 615016 KB Output is correct
12 Correct 560 ms 614712 KB Output is correct
13 Correct 560 ms 614484 KB Output is correct
14 Correct 569 ms 614388 KB Output is correct
15 Correct 552 ms 614416 KB Output is correct
16 Correct 555 ms 614636 KB Output is correct
17 Correct 570 ms 616060 KB Output is correct
18 Correct 561 ms 615888 KB Output is correct
19 Correct 561 ms 615952 KB Output is correct
20 Correct 566 ms 614928 KB Output is correct
21 Correct 559 ms 615664 KB Output is correct
22 Correct 565 ms 615736 KB Output is correct
23 Correct 600 ms 615776 KB Output is correct
24 Correct 557 ms 614972 KB Output is correct
25 Correct 593 ms 620580 KB Output is correct
26 Correct 593 ms 620572 KB Output is correct
27 Correct 589 ms 620416 KB Output is correct
28 Correct 579 ms 616456 KB Output is correct
29 Correct 601 ms 620024 KB Output is correct
30 Correct 606 ms 620144 KB Output is correct
31 Correct 597 ms 618868 KB Output is correct
32 Correct 602 ms 619312 KB Output is correct
33 Correct 818 ms 648132 KB Output is correct
34 Correct 792 ms 648252 KB Output is correct
35 Correct 822 ms 648312 KB Output is correct
36 Correct 788 ms 648348 KB Output is correct
37 Correct 1032 ms 671228 KB Output is correct
38 Correct 1004 ms 671176 KB Output is correct
39 Correct 988 ms 671044 KB Output is correct
40 Correct 965 ms 667780 KB Output is correct
41 Correct 734 ms 630008 KB Output is correct
42 Correct 809 ms 636468 KB Output is correct
43 Correct 1088 ms 668548 KB Output is correct
44 Correct 1109 ms 672232 KB Output is correct
45 Correct 829 ms 643708 KB Output is correct
46 Correct 829 ms 644204 KB Output is correct
47 Correct 1077 ms 661756 KB Output is correct
48 Correct 1088 ms 663544 KB Output is correct
49 Correct 598 ms 639436 KB Output is correct
50 Correct 575 ms 635640 KB Output is correct
51 Correct 556 ms 614456 KB Output is correct
52 Correct 554 ms 614432 KB Output is correct
53 Correct 581 ms 618032 KB Output is correct
54 Correct 590 ms 618124 KB Output is correct
55 Correct 570 ms 618232 KB Output is correct
56 Correct 577 ms 617080 KB Output is correct
57 Correct 568 ms 617020 KB Output is correct
58 Correct 559 ms 616868 KB Output is correct
59 Correct 562 ms 617268 KB Output is correct
60 Correct 553 ms 614564 KB Output is correct
61 Correct 1631 ms 704300 KB Output is correct
62 Correct 2994 ms 809352 KB Output is correct
63 Correct 2970 ms 810204 KB Output is correct
64 Correct 2975 ms 810460 KB Output is correct
65 Correct 766 ms 638720 KB Output is correct
66 Correct 933 ms 660472 KB Output is correct
67 Correct 973 ms 663900 KB Output is correct
68 Correct 3888 ms 981680 KB Output is correct
69 Correct 3369 ms 981536 KB Output is correct
70 Correct 4224 ms 981604 KB Output is correct
71 Correct 3673 ms 981840 KB Output is correct
72 Runtime error 1989 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
73 Halted 0 ms 0 KB -