oj.uz

Submission #144709

# Submission time Handle Problem Language Result Execution time Memory
144709 2019-08-17T14:32:03 Z nvmdava Rectangles (IOI19_rect) C++17
72 / 100
 4145 ms 1048576 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define N 2505

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

map<int, int> cnt[2][N][N];
int arr[N][N], bit[N][N];
int temp[N];

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

	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 614 ms 614648 KB Output is correct
2 Correct 879 ms 614856 KB Output is correct
3 Correct 682 ms 614904 KB Output is correct
4 Correct 603 ms 614776 KB Output is correct
5 Correct 574 ms 614448 KB Output is correct
6 Correct 602 ms 614776 KB Output is correct
7 Correct 596 ms 614804 KB Output is correct
8 Correct 577 ms 614680 KB Output is correct
9 Correct 558 ms 614748 KB Output is correct
10 Correct 563 ms 614776 KB Output is correct
11 Correct 566 ms 614960 KB Output is correct
12 Correct 563 ms 614768 KB Output is correct
13 Correct 606 ms 614380 KB Output is correct
14 Correct 558 ms 614356 KB Output is correct
15 Correct 559 ms 614364 KB Output is correct
16 Correct 559 ms 614520 KB Output is correct
17 Correct 560 ms 614308 KB Output is correct
18 Correct 567 ms 614392 KB Output is correct
19 Correct 558 ms 614704 KB Output is correct
20 Correct 562 ms 614520 KB Output is correct
21 Correct 588 ms 614552 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 614648 KB Output is correct
2 Correct 879 ms 614856 KB Output is correct
3 Correct 682 ms 614904 KB Output is correct
4 Correct 603 ms 614776 KB Output is correct
5 Correct 574 ms 614448 KB Output is correct
6 Correct 602 ms 614776 KB Output is correct
7 Correct 596 ms 614804 KB Output is correct
8 Correct 577 ms 614680 KB Output is correct
9 Correct 558 ms 614748 KB Output is correct
10 Correct 563 ms 614776 KB Output is correct
11 Correct 566 ms 614960 KB Output is correct
12 Correct 563 ms 614768 KB Output is correct
13 Correct 606 ms 614380 KB Output is correct
14 Correct 558 ms 614356 KB Output is correct
15 Correct 559 ms 614364 KB Output is correct
16 Correct 559 ms 614520 KB Output is correct
17 Correct 575 ms 615840 KB Output is correct
18 Correct 613 ms 615968 KB Output is correct
19 Correct 594 ms 615908 KB Output is correct
20 Correct 563 ms 614956 KB Output is correct
21 Correct 565 ms 615720 KB Output is correct
22 Correct 567 ms 615632 KB Output is correct
23 Correct 599 ms 615672 KB Output is correct
24 Correct 679 ms 614904 KB Output is correct
25 Correct 560 ms 614308 KB Output is correct
26 Correct 567 ms 614392 KB Output is correct
27 Correct 558 ms 614704 KB Output is correct
28 Correct 562 ms 614520 KB Output is correct
29 Correct 588 ms 614552 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 614648 KB Output is correct
2 Correct 879 ms 614856 KB Output is correct
3 Correct 682 ms 614904 KB Output is correct
4 Correct 603 ms 614776 KB Output is correct
5 Correct 574 ms 614448 KB Output is correct
6 Correct 602 ms 614776 KB Output is correct
7 Correct 596 ms 614804 KB Output is correct
8 Correct 577 ms 614680 KB Output is correct
9 Correct 558 ms 614748 KB Output is correct
10 Correct 563 ms 614776 KB Output is correct
11 Correct 566 ms 614960 KB Output is correct
12 Correct 563 ms 614768 KB Output is correct
13 Correct 606 ms 614380 KB Output is correct
14 Correct 558 ms 614356 KB Output is correct
15 Correct 559 ms 614364 KB Output is correct
16 Correct 559 ms 614520 KB Output is correct
17 Correct 575 ms 615840 KB Output is correct
18 Correct 613 ms 615968 KB Output is correct
19 Correct 594 ms 615908 KB Output is correct
20 Correct 563 ms 614956 KB Output is correct
21 Correct 565 ms 615720 KB Output is correct
22 Correct 567 ms 615632 KB Output is correct
23 Correct 599 ms 615672 KB Output is correct
24 Correct 679 ms 614904 KB Output is correct
25 Correct 665 ms 620496 KB Output is correct
26 Correct 594 ms 620476 KB Output is correct
27 Correct 619 ms 620536 KB Output is correct
28 Correct 582 ms 616388 KB Output is correct
29 Correct 619 ms 619784 KB Output is correct
30 Correct 603 ms 620256 KB Output is correct
31 Correct 600 ms 618744 KB Output is correct
32 Correct 617 ms 619128 KB Output is correct
33 Correct 560 ms 614308 KB Output is correct
34 Correct 567 ms 614392 KB Output is correct
35 Correct 558 ms 614704 KB Output is correct
36 Correct 562 ms 614520 KB Output is correct
37 Correct 588 ms 614552 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 614648 KB Output is correct
2 Correct 879 ms 614856 KB Output is correct
3 Correct 682 ms 614904 KB Output is correct
4 Correct 603 ms 614776 KB Output is correct
5 Correct 574 ms 614448 KB Output is correct
6 Correct 602 ms 614776 KB Output is correct
7 Correct 596 ms 614804 KB Output is correct
8 Correct 577 ms 614680 KB Output is correct
9 Correct 558 ms 614748 KB Output is correct
10 Correct 563 ms 614776 KB Output is correct
11 Correct 566 ms 614960 KB Output is correct
12 Correct 563 ms 614768 KB Output is correct
13 Correct 606 ms 614380 KB Output is correct
14 Correct 558 ms 614356 KB Output is correct
15 Correct 559 ms 614364 KB Output is correct
16 Correct 559 ms 614520 KB Output is correct
17 Correct 575 ms 615840 KB Output is correct
18 Correct 613 ms 615968 KB Output is correct
19 Correct 594 ms 615908 KB Output is correct
20 Correct 563 ms 614956 KB Output is correct
21 Correct 565 ms 615720 KB Output is correct
22 Correct 567 ms 615632 KB Output is correct
23 Correct 599 ms 615672 KB Output is correct
24 Correct 679 ms 614904 KB Output is correct
25 Correct 665 ms 620496 KB Output is correct
26 Correct 594 ms 620476 KB Output is correct
27 Correct 619 ms 620536 KB Output is correct
28 Correct 582 ms 616388 KB Output is correct
29 Correct 619 ms 619784 KB Output is correct
30 Correct 603 ms 620256 KB Output is correct
31 Correct 600 ms 618744 KB Output is correct
32 Correct 617 ms 619128 KB Output is correct
33 Correct 814 ms 648188 KB Output is correct
34 Correct 789 ms 648268 KB Output is correct
35 Correct 862 ms 648348 KB Output is correct
36 Correct 805 ms 648440 KB Output is correct
37 Correct 1000 ms 671068 KB Output is correct
38 Correct 997 ms 671112 KB Output is correct
39 Correct 999 ms 671028 KB Output is correct
40 Correct 970 ms 667944 KB Output is correct
41 Correct 739 ms 630088 KB Output is correct
42 Correct 814 ms 636500 KB Output is correct
43 Correct 1163 ms 668540 KB Output is correct
44 Correct 1181 ms 670056 KB Output is correct
45 Correct 878 ms 642560 KB Output is correct
46 Correct 839 ms 644112 KB Output is correct
47 Correct 1069 ms 661872 KB Output is correct
48 Correct 1126 ms 663572 KB Output is correct
49 Correct 560 ms 614308 KB Output is correct
50 Correct 567 ms 614392 KB Output is correct
51 Correct 558 ms 614704 KB Output is correct
52 Correct 562 ms 614520 KB Output is correct
53 Correct 588 ms 614552 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 628 ms 639552 KB Output is correct
2 Correct 584 ms 635600 KB Output is correct
3 Correct 563 ms 614520 KB Output is correct
4 Correct 559 ms 614364 KB Output is correct
5 Correct 575 ms 618292 KB Output is correct
6 Correct 571 ms 618240 KB Output is correct
7 Correct 573 ms 618292 KB Output is correct
8 Correct 562 ms 617208 KB Output is correct
9 Correct 596 ms 617096 KB Output is correct
10 Correct 568 ms 616640 KB Output is correct
11 Correct 561 ms 617332 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 614648 KB Output is correct
2 Correct 1686 ms 704544 KB Output is correct
3 Correct 3067 ms 809336 KB Output is correct
4 Correct 3003 ms 810296 KB Output is correct
5 Correct 3028 ms 810440 KB Output is correct
6 Correct 757 ms 638712 KB Output is correct
7 Correct 997 ms 660520 KB Output is correct
8 Correct 944 ms 663924 KB Output is correct
9 Correct 560 ms 614308 KB Output is correct
10 Correct 567 ms 614392 KB Output is correct
11 Correct 558 ms 614704 KB Output is correct
12 Correct 562 ms 614520 KB Output is correct
13 Correct 588 ms 614552 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 614648 KB Output is correct
2 Correct 879 ms 614856 KB Output is correct
3 Correct 682 ms 614904 KB Output is correct
4 Correct 603 ms 614776 KB Output is correct
5 Correct 574 ms 614448 KB Output is correct
6 Correct 602 ms 614776 KB Output is correct
7 Correct 596 ms 614804 KB Output is correct
8 Correct 577 ms 614680 KB Output is correct
9 Correct 558 ms 614748 KB Output is correct
10 Correct 563 ms 614776 KB Output is correct
11 Correct 566 ms 614960 KB Output is correct
12 Correct 563 ms 614768 KB Output is correct
13 Correct 606 ms 614380 KB Output is correct
14 Correct 558 ms 614356 KB Output is correct
15 Correct 559 ms 614364 KB Output is correct
16 Correct 559 ms 614520 KB Output is correct
17 Correct 575 ms 615840 KB Output is correct
18 Correct 613 ms 615968 KB Output is correct
19 Correct 594 ms 615908 KB Output is correct
20 Correct 563 ms 614956 KB Output is correct
21 Correct 565 ms 615720 KB Output is correct
22 Correct 567 ms 615632 KB Output is correct
23 Correct 599 ms 615672 KB Output is correct
24 Correct 679 ms 614904 KB Output is correct
25 Correct 665 ms 620496 KB Output is correct
26 Correct 594 ms 620476 KB Output is correct
27 Correct 619 ms 620536 KB Output is correct
28 Correct 582 ms 616388 KB Output is correct
29 Correct 619 ms 619784 KB Output is correct
30 Correct 603 ms 620256 KB Output is correct
31 Correct 600 ms 618744 KB Output is correct
32 Correct 617 ms 619128 KB Output is correct
33 Correct 814 ms 648188 KB Output is correct
34 Correct 789 ms 648268 KB Output is correct
35 Correct 862 ms 648348 KB Output is correct
36 Correct 805 ms 648440 KB Output is correct
37 Correct 1000 ms 671068 KB Output is correct
38 Correct 997 ms 671112 KB Output is correct
39 Correct 999 ms 671028 KB Output is correct
40 Correct 970 ms 667944 KB Output is correct
41 Correct 739 ms 630088 KB Output is correct
42 Correct 814 ms 636500 KB Output is correct
43 Correct 1163 ms 668540 KB Output is correct
44 Correct 1181 ms 670056 KB Output is correct
45 Correct 878 ms 642560 KB Output is correct
46 Correct 839 ms 644112 KB Output is correct
47 Correct 1069 ms 661872 KB Output is correct
48 Correct 1126 ms 663572 KB Output is correct
49 Correct 628 ms 639552 KB Output is correct
50 Correct 584 ms 635600 KB Output is correct
51 Correct 563 ms 614520 KB Output is correct
52 Correct 559 ms 614364 KB Output is correct
53 Correct 575 ms 618292 KB Output is correct
54 Correct 571 ms 618240 KB Output is correct
55 Correct 573 ms 618292 KB Output is correct
56 Correct 562 ms 617208 KB Output is correct
57 Correct 596 ms 617096 KB Output is correct
58 Correct 568 ms 616640 KB Output is correct
59 Correct 561 ms 617332 KB Output is correct
60 Correct 561 ms 614648 KB Output is correct
61 Correct 1686 ms 704544 KB Output is correct
62 Correct 3067 ms 809336 KB Output is correct
63 Correct 3003 ms 810296 KB Output is correct
64 Correct 3028 ms 810440 KB Output is correct
65 Correct 757 ms 638712 KB Output is correct
66 Correct 997 ms 660520 KB Output is correct
67 Correct 944 ms 663924 KB Output is correct
68 Correct 3982 ms 981708 KB Output is correct
69 Correct 3501 ms 981580 KB Output is correct
70 Correct 4145 ms 981632 KB Output is correct
71 Correct 3669 ms 981696 KB Output is correct
72 Runtime error 1862 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
73 Halted 0 ms 0 KB -