oj.uz

Submission #144711

# Submission time Handle Problem Language Result Execution time Memory
144711 2019-08-17T14:35:42 Z nvmdava Rectangles (IOI19_rect) C++17
72 / 100
 4219 ms 1048580 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define N 2501

map<int, int> cnt[2][N][N];
int arr[N][N], bit[N][N], temp[N], p[N], lc[N], rc[N], n, m;

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);
	}
}

void update(int x, int y, int v){
	for(int i = x; i < N; i += i & -i){
		for(int j = y; j < N; 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];
	a.clear();
	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.ff);
				if(it != cnt[0][i - 1][j].end())
					x.ss = 1 + it -> ss;
				update(x.ff, x.ss, 1);
			}
			for(auto& x : cnt[1][i][j]){
				auto it = cnt[1][i][j - 1].find(x.ff);
				if(it != cnt[1][i][j - 1].end())
					x.ss = 1 + it -> ss;
				res += query(x.ss, N - 1);
				res -= query(x.ss, x.ff - 1);
			}
			for(auto& x : cnt[0][i][j])
				update(x.ff, x.ss, -1);
		}
	}
	return res;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 612472 KB Output is correct
2 Correct 558 ms 612908 KB Output is correct
3 Correct 554 ms 613048 KB Output is correct
4 Correct 561 ms 612932 KB Output is correct
5 Correct 557 ms 612472 KB Output is correct
6 Correct 562 ms 612904 KB Output is correct
7 Correct 557 ms 612756 KB Output is correct
8 Correct 560 ms 612832 KB Output is correct
9 Correct 561 ms 612708 KB Output is correct
10 Correct 572 ms 612876 KB Output is correct
11 Correct 552 ms 612836 KB Output is correct
12 Correct 557 ms 612824 KB Output is correct
13 Correct 554 ms 612472 KB Output is correct
14 Correct 556 ms 612480 KB Output is correct
15 Correct 577 ms 612448 KB Output is correct
16 Correct 558 ms 612508 KB Output is correct
17 Correct 550 ms 612444 KB Output is correct
18 Correct 554 ms 612376 KB Output is correct
19 Correct 596 ms 612704 KB Output is correct
20 Correct 553 ms 612472 KB Output is correct
21 Correct 556 ms 612524 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 612472 KB Output is correct
2 Correct 558 ms 612908 KB Output is correct
3 Correct 554 ms 613048 KB Output is correct
4 Correct 561 ms 612932 KB Output is correct
5 Correct 557 ms 612472 KB Output is correct
6 Correct 562 ms 612904 KB Output is correct
7 Correct 557 ms 612756 KB Output is correct
8 Correct 560 ms 612832 KB Output is correct
9 Correct 561 ms 612708 KB Output is correct
10 Correct 572 ms 612876 KB Output is correct
11 Correct 552 ms 612836 KB Output is correct
12 Correct 557 ms 612824 KB Output is correct
13 Correct 554 ms 612472 KB Output is correct
14 Correct 556 ms 612480 KB Output is correct
15 Correct 577 ms 612448 KB Output is correct
16 Correct 558 ms 612508 KB Output is correct
17 Correct 564 ms 614056 KB Output is correct
18 Correct 558 ms 613980 KB Output is correct
19 Correct 564 ms 614076 KB Output is correct
20 Correct 557 ms 612936 KB Output is correct
21 Correct 557 ms 613628 KB Output is correct
22 Correct 564 ms 613724 KB Output is correct
23 Correct 561 ms 613640 KB Output is correct
24 Correct 557 ms 612996 KB Output is correct
25 Correct 550 ms 612444 KB Output is correct
26 Correct 554 ms 612376 KB Output is correct
27 Correct 596 ms 612704 KB Output is correct
28 Correct 553 ms 612472 KB Output is correct
29 Correct 556 ms 612524 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 612472 KB Output is correct
2 Correct 558 ms 612908 KB Output is correct
3 Correct 554 ms 613048 KB Output is correct
4 Correct 561 ms 612932 KB Output is correct
5 Correct 557 ms 612472 KB Output is correct
6 Correct 562 ms 612904 KB Output is correct
7 Correct 557 ms 612756 KB Output is correct
8 Correct 560 ms 612832 KB Output is correct
9 Correct 561 ms 612708 KB Output is correct
10 Correct 572 ms 612876 KB Output is correct
11 Correct 552 ms 612836 KB Output is correct
12 Correct 557 ms 612824 KB Output is correct
13 Correct 554 ms 612472 KB Output is correct
14 Correct 556 ms 612480 KB Output is correct
15 Correct 577 ms 612448 KB Output is correct
16 Correct 558 ms 612508 KB Output is correct
17 Correct 564 ms 614056 KB Output is correct
18 Correct 558 ms 613980 KB Output is correct
19 Correct 564 ms 614076 KB Output is correct
20 Correct 557 ms 612936 KB Output is correct
21 Correct 557 ms 613628 KB Output is correct
22 Correct 564 ms 613724 KB Output is correct
23 Correct 561 ms 613640 KB Output is correct
24 Correct 557 ms 612996 KB Output is correct
25 Correct 594 ms 618388 KB Output is correct
26 Correct 602 ms 618380 KB Output is correct
27 Correct 620 ms 618424 KB Output is correct
28 Correct 644 ms 614416 KB Output is correct
29 Correct 596 ms 617600 KB Output is correct
30 Correct 605 ms 618252 KB Output is correct
31 Correct 596 ms 616648 KB Output is correct
32 Correct 595 ms 616968 KB Output is correct
33 Correct 550 ms 612444 KB Output is correct
34 Correct 554 ms 612376 KB Output is correct
35 Correct 596 ms 612704 KB Output is correct
36 Correct 553 ms 612472 KB Output is correct
37 Correct 556 ms 612524 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 612472 KB Output is correct
2 Correct 558 ms 612908 KB Output is correct
3 Correct 554 ms 613048 KB Output is correct
4 Correct 561 ms 612932 KB Output is correct
5 Correct 557 ms 612472 KB Output is correct
6 Correct 562 ms 612904 KB Output is correct
7 Correct 557 ms 612756 KB Output is correct
8 Correct 560 ms 612832 KB Output is correct
9 Correct 561 ms 612708 KB Output is correct
10 Correct 572 ms 612876 KB Output is correct
11 Correct 552 ms 612836 KB Output is correct
12 Correct 557 ms 612824 KB Output is correct
13 Correct 554 ms 612472 KB Output is correct
14 Correct 556 ms 612480 KB Output is correct
15 Correct 577 ms 612448 KB Output is correct
16 Correct 558 ms 612508 KB Output is correct
17 Correct 564 ms 614056 KB Output is correct
18 Correct 558 ms 613980 KB Output is correct
19 Correct 564 ms 614076 KB Output is correct
20 Correct 557 ms 612936 KB Output is correct
21 Correct 557 ms 613628 KB Output is correct
22 Correct 564 ms 613724 KB Output is correct
23 Correct 561 ms 613640 KB Output is correct
24 Correct 557 ms 612996 KB Output is correct
25 Correct 594 ms 618388 KB Output is correct
26 Correct 602 ms 618380 KB Output is correct
27 Correct 620 ms 618424 KB Output is correct
28 Correct 644 ms 614416 KB Output is correct
29 Correct 596 ms 617600 KB Output is correct
30 Correct 605 ms 618252 KB Output is correct
31 Correct 596 ms 616648 KB Output is correct
32 Correct 595 ms 616968 KB Output is correct
33 Correct 806 ms 644236 KB Output is correct
34 Correct 795 ms 644408 KB Output is correct
35 Correct 827 ms 644448 KB Output is correct
36 Correct 797 ms 644308 KB Output is correct
37 Correct 995 ms 667248 KB Output is correct
38 Correct 1004 ms 667276 KB Output is correct
39 Correct 997 ms 667160 KB Output is correct
40 Correct 973 ms 664076 KB Output is correct
41 Correct 736 ms 626288 KB Output is correct
42 Correct 806 ms 632688 KB Output is correct
43 Correct 1091 ms 664560 KB Output is correct
44 Correct 1149 ms 665428 KB Output is correct
45 Correct 826 ms 639100 KB Output is correct
46 Correct 833 ms 641332 KB Output is correct
47 Correct 1059 ms 657900 KB Output is correct
48 Correct 1063 ms 659668 KB Output is correct
49 Correct 550 ms 612444 KB Output is correct
50 Correct 554 ms 612376 KB Output is correct
51 Correct 596 ms 612704 KB Output is correct
52 Correct 553 ms 612472 KB Output is correct
53 Correct 556 ms 612524 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 637404 KB Output is correct
2 Correct 620 ms 633788 KB Output is correct
3 Correct 555 ms 612628 KB Output is correct
4 Correct 549 ms 612472 KB Output is correct
5 Correct 569 ms 616084 KB Output is correct
6 Correct 567 ms 616092 KB Output is correct
7 Correct 607 ms 616236 KB Output is correct
8 Correct 656 ms 615160 KB Output is correct
9 Correct 559 ms 615088 KB Output is correct
10 Correct 555 ms 614648 KB Output is correct
11 Correct 635 ms 615392 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 589 ms 612708 KB Output is correct
2 Correct 1638 ms 691116 KB Output is correct
3 Correct 2936 ms 783056 KB Output is correct
4 Correct 3148 ms 783928 KB Output is correct
5 Correct 2975 ms 784028 KB Output is correct
6 Correct 752 ms 636632 KB Output is correct
7 Correct 919 ms 658416 KB Output is correct
8 Correct 936 ms 661592 KB Output is correct
9 Correct 550 ms 612444 KB Output is correct
10 Correct 554 ms 612376 KB Output is correct
11 Correct 596 ms 612704 KB Output is correct
12 Correct 553 ms 612472 KB Output is correct
13 Correct 556 ms 612524 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 612472 KB Output is correct
2 Correct 558 ms 612908 KB Output is correct
3 Correct 554 ms 613048 KB Output is correct
4 Correct 561 ms 612932 KB Output is correct
5 Correct 557 ms 612472 KB Output is correct
6 Correct 562 ms 612904 KB Output is correct
7 Correct 557 ms 612756 KB Output is correct
8 Correct 560 ms 612832 KB Output is correct
9 Correct 561 ms 612708 KB Output is correct
10 Correct 572 ms 612876 KB Output is correct
11 Correct 552 ms 612836 KB Output is correct
12 Correct 557 ms 612824 KB Output is correct
13 Correct 554 ms 612472 KB Output is correct
14 Correct 556 ms 612480 KB Output is correct
15 Correct 577 ms 612448 KB Output is correct
16 Correct 558 ms 612508 KB Output is correct
17 Correct 564 ms 614056 KB Output is correct
18 Correct 558 ms 613980 KB Output is correct
19 Correct 564 ms 614076 KB Output is correct
20 Correct 557 ms 612936 KB Output is correct
21 Correct 557 ms 613628 KB Output is correct
22 Correct 564 ms 613724 KB Output is correct
23 Correct 561 ms 613640 KB Output is correct
24 Correct 557 ms 612996 KB Output is correct
25 Correct 594 ms 618388 KB Output is correct
26 Correct 602 ms 618380 KB Output is correct
27 Correct 620 ms 618424 KB Output is correct
28 Correct 644 ms 614416 KB Output is correct
29 Correct 596 ms 617600 KB Output is correct
30 Correct 605 ms 618252 KB Output is correct
31 Correct 596 ms 616648 KB Output is correct
32 Correct 595 ms 616968 KB Output is correct
33 Correct 806 ms 644236 KB Output is correct
34 Correct 795 ms 644408 KB Output is correct
35 Correct 827 ms 644448 KB Output is correct
36 Correct 797 ms 644308 KB Output is correct
37 Correct 995 ms 667248 KB Output is correct
38 Correct 1004 ms 667276 KB Output is correct
39 Correct 997 ms 667160 KB Output is correct
40 Correct 973 ms 664076 KB Output is correct
41 Correct 736 ms 626288 KB Output is correct
42 Correct 806 ms 632688 KB Output is correct
43 Correct 1091 ms 664560 KB Output is correct
44 Correct 1149 ms 665428 KB Output is correct
45 Correct 826 ms 639100 KB Output is correct
46 Correct 833 ms 641332 KB Output is correct
47 Correct 1059 ms 657900 KB Output is correct
48 Correct 1063 ms 659668 KB Output is correct
49 Correct 582 ms 637404 KB Output is correct
50 Correct 620 ms 633788 KB Output is correct
51 Correct 555 ms 612628 KB Output is correct
52 Correct 549 ms 612472 KB Output is correct
53 Correct 569 ms 616084 KB Output is correct
54 Correct 567 ms 616092 KB Output is correct
55 Correct 607 ms 616236 KB Output is correct
56 Correct 656 ms 615160 KB Output is correct
57 Correct 559 ms 615088 KB Output is correct
58 Correct 555 ms 614648 KB Output is correct
59 Correct 635 ms 615392 KB Output is correct
60 Correct 589 ms 612708 KB Output is correct
61 Correct 1638 ms 691116 KB Output is correct
62 Correct 2936 ms 783056 KB Output is correct
63 Correct 3148 ms 783928 KB Output is correct
64 Correct 2975 ms 784028 KB Output is correct
65 Correct 752 ms 636632 KB Output is correct
66 Correct 919 ms 658416 KB Output is correct
67 Correct 936 ms 661592 KB Output is correct
68 Correct 3855 ms 955136 KB Output is correct
69 Correct 3349 ms 955096 KB Output is correct
70 Correct 4219 ms 955156 KB Output is correct
71 Correct 3673 ms 955248 KB Output is correct
72 Runtime error 1949 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
73 Halted 0 ms 0 KB -