oj.uz

Submission #144685

# Submission time Handle Problem Language Result Execution time Memory
144685 2019-08-17T13:47:43 Z nvmdava Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 957092 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);
	}
}

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;
			}
			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;
			}
			for(auto& x : cnt[0][i][j])
				for(auto& y : cnt[1][i][j])
					if(x.second >= y.first && y.second >= x.first)
						res++;
		}
	}
	return res;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 614336 KB Output is correct
2 Correct 575 ms 614440 KB Output is correct
3 Correct 558 ms 614588 KB Output is correct
4 Correct 558 ms 614524 KB Output is correct
5 Correct 557 ms 614464 KB Output is correct
6 Correct 630 ms 614516 KB Output is correct
7 Correct 569 ms 614464 KB Output is correct
8 Correct 559 ms 614444 KB Output is correct
9 Correct 572 ms 614492 KB Output is correct
10 Correct 582 ms 614492 KB Output is correct
11 Correct 557 ms 614436 KB Output is correct
12 Correct 554 ms 614376 KB Output is correct
13 Correct 557 ms 614392 KB Output is correct
14 Correct 559 ms 614440 KB Output is correct
15 Correct 568 ms 614292 KB Output is correct
16 Correct 562 ms 614264 KB Output is correct
17 Correct 556 ms 614348 KB Output is correct
18 Correct 592 ms 614392 KB Output is correct
19 Correct 558 ms 614564 KB Output is correct
20 Correct 555 ms 614440 KB Output is correct
21 Correct 555 ms 614568 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 614336 KB Output is correct
2 Correct 575 ms 614440 KB Output is correct
3 Correct 558 ms 614588 KB Output is correct
4 Correct 558 ms 614524 KB Output is correct
5 Correct 557 ms 614464 KB Output is correct
6 Correct 630 ms 614516 KB Output is correct
7 Correct 569 ms 614464 KB Output is correct
8 Correct 559 ms 614444 KB Output is correct
9 Correct 572 ms 614492 KB Output is correct
10 Correct 582 ms 614492 KB Output is correct
11 Correct 557 ms 614436 KB Output is correct
12 Correct 554 ms 614376 KB Output is correct
13 Correct 557 ms 614392 KB Output is correct
14 Correct 559 ms 614440 KB Output is correct
15 Correct 568 ms 614292 KB Output is correct
16 Correct 562 ms 614264 KB Output is correct
17 Correct 565 ms 615032 KB Output is correct
18 Correct 558 ms 615160 KB Output is correct
19 Correct 557 ms 615036 KB Output is correct
20 Correct 559 ms 614676 KB Output is correct
21 Correct 585 ms 614836 KB Output is correct
22 Correct 566 ms 615000 KB Output is correct
23 Correct 563 ms 614936 KB Output is correct
24 Correct 562 ms 614728 KB Output is correct
25 Correct 556 ms 614348 KB Output is correct
26 Correct 592 ms 614392 KB Output is correct
27 Correct 558 ms 614564 KB Output is correct
28 Correct 555 ms 614440 KB Output is correct
29 Correct 555 ms 614568 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 614336 KB Output is correct
2 Correct 575 ms 614440 KB Output is correct
3 Correct 558 ms 614588 KB Output is correct
4 Correct 558 ms 614524 KB Output is correct
5 Correct 557 ms 614464 KB Output is correct
6 Correct 630 ms 614516 KB Output is correct
7 Correct 569 ms 614464 KB Output is correct
8 Correct 559 ms 614444 KB Output is correct
9 Correct 572 ms 614492 KB Output is correct
10 Correct 582 ms 614492 KB Output is correct
11 Correct 557 ms 614436 KB Output is correct
12 Correct 554 ms 614376 KB Output is correct
13 Correct 557 ms 614392 KB Output is correct
14 Correct 559 ms 614440 KB Output is correct
15 Correct 568 ms 614292 KB Output is correct
16 Correct 562 ms 614264 KB Output is correct
17 Correct 565 ms 615032 KB Output is correct
18 Correct 558 ms 615160 KB Output is correct
19 Correct 557 ms 615036 KB Output is correct
20 Correct 559 ms 614676 KB Output is correct
21 Correct 585 ms 614836 KB Output is correct
22 Correct 566 ms 615000 KB Output is correct
23 Correct 563 ms 614936 KB Output is correct
24 Correct 562 ms 614728 KB Output is correct
25 Correct 588 ms 618432 KB Output is correct
26 Correct 594 ms 618528 KB Output is correct
27 Correct 589 ms 618392 KB Output is correct
28 Correct 569 ms 616168 KB Output is correct
29 Correct 580 ms 618200 KB Output is correct
30 Correct 594 ms 618396 KB Output is correct
31 Correct 588 ms 618012 KB Output is correct
32 Correct 577 ms 617988 KB Output is correct
33 Correct 556 ms 614348 KB Output is correct
34 Correct 592 ms 614392 KB Output is correct
35 Correct 558 ms 614564 KB Output is correct
36 Correct 555 ms 614440 KB Output is correct
37 Correct 555 ms 614568 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 614336 KB Output is correct
2 Correct 575 ms 614440 KB Output is correct
3 Correct 558 ms 614588 KB Output is correct
4 Correct 558 ms 614524 KB Output is correct
5 Correct 557 ms 614464 KB Output is correct
6 Correct 630 ms 614516 KB Output is correct
7 Correct 569 ms 614464 KB Output is correct
8 Correct 559 ms 614444 KB Output is correct
9 Correct 572 ms 614492 KB Output is correct
10 Correct 582 ms 614492 KB Output is correct
11 Correct 557 ms 614436 KB Output is correct
12 Correct 554 ms 614376 KB Output is correct
13 Correct 557 ms 614392 KB Output is correct
14 Correct 559 ms 614440 KB Output is correct
15 Correct 568 ms 614292 KB Output is correct
16 Correct 562 ms 614264 KB Output is correct
17 Correct 565 ms 615032 KB Output is correct
18 Correct 558 ms 615160 KB Output is correct
19 Correct 557 ms 615036 KB Output is correct
20 Correct 559 ms 614676 KB Output is correct
21 Correct 585 ms 614836 KB Output is correct
22 Correct 566 ms 615000 KB Output is correct
23 Correct 563 ms 614936 KB Output is correct
24 Correct 562 ms 614728 KB Output is correct
25 Correct 588 ms 618432 KB Output is correct
26 Correct 594 ms 618528 KB Output is correct
27 Correct 589 ms 618392 KB Output is correct
28 Correct 569 ms 616168 KB Output is correct
29 Correct 580 ms 618200 KB Output is correct
30 Correct 594 ms 618396 KB Output is correct
31 Correct 588 ms 618012 KB Output is correct
32 Correct 577 ms 617988 KB Output is correct
33 Correct 1386 ms 641332 KB Output is correct
34 Correct 686 ms 641396 KB Output is correct
35 Correct 789 ms 641236 KB Output is correct
36 Correct 694 ms 641272 KB Output is correct
37 Correct 820 ms 664184 KB Output is correct
38 Correct 823 ms 664124 KB Output is correct
39 Correct 817 ms 664260 KB Output is correct
40 Correct 846 ms 660876 KB Output is correct
41 Correct 679 ms 629840 KB Output is correct
42 Correct 724 ms 636224 KB Output is correct
43 Correct 922 ms 663000 KB Output is correct
44 Correct 897 ms 666008 KB Output is correct
45 Correct 713 ms 640376 KB Output is correct
46 Correct 713 ms 638748 KB Output is correct
47 Correct 855 ms 659840 KB Output is correct
48 Correct 855 ms 659756 KB Output is correct
49 Correct 556 ms 614348 KB Output is correct
50 Correct 592 ms 614392 KB Output is correct
51 Correct 558 ms 614564 KB Output is correct
52 Correct 555 ms 614440 KB Output is correct
53 Correct 555 ms 614568 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 614904 KB Output is correct
2 Correct 560 ms 614924 KB Output is correct
3 Correct 560 ms 614596 KB Output is correct
4 Correct 558 ms 614260 KB Output is correct
5 Correct 559 ms 614976 KB Output is correct
6 Correct 561 ms 614876 KB Output is correct
7 Correct 559 ms 614856 KB Output is correct
8 Correct 559 ms 614828 KB Output is correct
9 Correct 560 ms 614968 KB Output is correct
10 Correct 564 ms 614692 KB Output is correct
11 Correct 559 ms 614792 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 564 ms 614332 KB Output is correct
2 Correct 1299 ms 704312 KB Output is correct
3 Correct 2237 ms 809196 KB Output is correct
4 Correct 2253 ms 810056 KB Output is correct
5 Correct 2290 ms 810204 KB Output is correct
6 Correct 748 ms 638752 KB Output is correct
7 Correct 918 ms 660592 KB Output is correct
8 Correct 947 ms 664004 KB Output is correct
9 Correct 556 ms 614348 KB Output is correct
10 Correct 592 ms 614392 KB Output is correct
11 Correct 558 ms 614564 KB Output is correct
12 Correct 555 ms 614440 KB Output is correct
13 Correct 555 ms 614568 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 563 ms 614336 KB Output is correct
2 Correct 575 ms 614440 KB Output is correct
3 Correct 558 ms 614588 KB Output is correct
4 Correct 558 ms 614524 KB Output is correct
5 Correct 557 ms 614464 KB Output is correct
6 Correct 630 ms 614516 KB Output is correct
7 Correct 569 ms 614464 KB Output is correct
8 Correct 559 ms 614444 KB Output is correct
9 Correct 572 ms 614492 KB Output is correct
10 Correct 582 ms 614492 KB Output is correct
11 Correct 557 ms 614436 KB Output is correct
12 Correct 554 ms 614376 KB Output is correct
13 Correct 557 ms 614392 KB Output is correct
14 Correct 559 ms 614440 KB Output is correct
15 Correct 568 ms 614292 KB Output is correct
16 Correct 562 ms 614264 KB Output is correct
17 Correct 565 ms 615032 KB Output is correct
18 Correct 558 ms 615160 KB Output is correct
19 Correct 557 ms 615036 KB Output is correct
20 Correct 559 ms 614676 KB Output is correct
21 Correct 585 ms 614836 KB Output is correct
22 Correct 566 ms 615000 KB Output is correct
23 Correct 563 ms 614936 KB Output is correct
24 Correct 562 ms 614728 KB Output is correct
25 Correct 588 ms 618432 KB Output is correct
26 Correct 594 ms 618528 KB Output is correct
27 Correct 589 ms 618392 KB Output is correct
28 Correct 569 ms 616168 KB Output is correct
29 Correct 580 ms 618200 KB Output is correct
30 Correct 594 ms 618396 KB Output is correct
31 Correct 588 ms 618012 KB Output is correct
32 Correct 577 ms 617988 KB Output is correct
33 Correct 1386 ms 641332 KB Output is correct
34 Correct 686 ms 641396 KB Output is correct
35 Correct 789 ms 641236 KB Output is correct
36 Correct 694 ms 641272 KB Output is correct
37 Correct 820 ms 664184 KB Output is correct
38 Correct 823 ms 664124 KB Output is correct
39 Correct 817 ms 664260 KB Output is correct
40 Correct 846 ms 660876 KB Output is correct
41 Correct 679 ms 629840 KB Output is correct
42 Correct 724 ms 636224 KB Output is correct
43 Correct 922 ms 663000 KB Output is correct
44 Correct 897 ms 666008 KB Output is correct
45 Correct 713 ms 640376 KB Output is correct
46 Correct 713 ms 638748 KB Output is correct
47 Correct 855 ms 659840 KB Output is correct
48 Correct 855 ms 659756 KB Output is correct
49 Correct 559 ms 614904 KB Output is correct
50 Correct 560 ms 614924 KB Output is correct
51 Correct 560 ms 614596 KB Output is correct
52 Correct 558 ms 614260 KB Output is correct
53 Correct 559 ms 614976 KB Output is correct
54 Correct 561 ms 614876 KB Output is correct
55 Correct 559 ms 614856 KB Output is correct
56 Correct 559 ms 614828 KB Output is correct
57 Correct 560 ms 614968 KB Output is correct
58 Correct 564 ms 614692 KB Output is correct
59 Correct 559 ms 614792 KB Output is correct
60 Correct 564 ms 614332 KB Output is correct
61 Correct 1299 ms 704312 KB Output is correct
62 Correct 2237 ms 809196 KB Output is correct
63 Correct 2253 ms 810056 KB Output is correct
64 Correct 2290 ms 810204 KB Output is correct
65 Correct 748 ms 638752 KB Output is correct
66 Correct 918 ms 660592 KB Output is correct
67 Correct 947 ms 664004 KB Output is correct
68 Execution timed out 5081 ms 957092 KB Time limit exceeded
69 Halted 0 ms 0 KB -