oj.uz

Submission #144715

# Submission time Handle Problem Language Result Execution time Memory
144715 2019-08-17T14:48:14 Z nvmdava Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 954868 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 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++){
		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++){
			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);
			cnt[0][i - 1][j].clear();
			cnt[1][i - 1][j].clear();
		}
	}
	return res;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 612600 KB Output is correct
2 Correct 561 ms 612816 KB Output is correct
3 Correct 555 ms 612840 KB Output is correct
4 Correct 566 ms 612932 KB Output is correct
5 Correct 554 ms 612600 KB Output is correct
6 Correct 560 ms 612896 KB Output is correct
7 Correct 560 ms 612624 KB Output is correct
8 Correct 552 ms 612728 KB Output is correct
9 Correct 556 ms 612856 KB Output is correct
10 Correct 599 ms 612728 KB Output is correct
11 Correct 557 ms 613064 KB Output is correct
12 Correct 560 ms 612732 KB Output is correct
13 Correct 555 ms 612348 KB Output is correct
14 Correct 556 ms 612436 KB Output is correct
15 Correct 553 ms 612476 KB Output is correct
16 Correct 623 ms 612648 KB Output is correct
17 Correct 560 ms 612432 KB Output is correct
18 Correct 562 ms 612344 KB Output is correct
19 Correct 555 ms 612684 KB Output is correct
20 Correct 559 ms 612444 KB Output is correct
21 Correct 553 ms 612444 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 612600 KB Output is correct
2 Correct 561 ms 612816 KB Output is correct
3 Correct 555 ms 612840 KB Output is correct
4 Correct 566 ms 612932 KB Output is correct
5 Correct 554 ms 612600 KB Output is correct
6 Correct 560 ms 612896 KB Output is correct
7 Correct 560 ms 612624 KB Output is correct
8 Correct 552 ms 612728 KB Output is correct
9 Correct 556 ms 612856 KB Output is correct
10 Correct 599 ms 612728 KB Output is correct
11 Correct 557 ms 613064 KB Output is correct
12 Correct 560 ms 612732 KB Output is correct
13 Correct 555 ms 612348 KB Output is correct
14 Correct 556 ms 612436 KB Output is correct
15 Correct 553 ms 612476 KB Output is correct
16 Correct 623 ms 612648 KB Output is correct
17 Correct 576 ms 613592 KB Output is correct
18 Correct 559 ms 613576 KB Output is correct
19 Correct 559 ms 613624 KB Output is correct
20 Correct 589 ms 612780 KB Output is correct
21 Correct 580 ms 613496 KB Output is correct
22 Correct 560 ms 613328 KB Output is correct
23 Correct 595 ms 613580 KB Output is correct
24 Correct 558 ms 612956 KB Output is correct
25 Correct 560 ms 612432 KB Output is correct
26 Correct 562 ms 612344 KB Output is correct
27 Correct 555 ms 612684 KB Output is correct
28 Correct 559 ms 612444 KB Output is correct
29 Correct 553 ms 612444 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 612600 KB Output is correct
2 Correct 561 ms 612816 KB Output is correct
3 Correct 555 ms 612840 KB Output is correct
4 Correct 566 ms 612932 KB Output is correct
5 Correct 554 ms 612600 KB Output is correct
6 Correct 560 ms 612896 KB Output is correct
7 Correct 560 ms 612624 KB Output is correct
8 Correct 552 ms 612728 KB Output is correct
9 Correct 556 ms 612856 KB Output is correct
10 Correct 599 ms 612728 KB Output is correct
11 Correct 557 ms 613064 KB Output is correct
12 Correct 560 ms 612732 KB Output is correct
13 Correct 555 ms 612348 KB Output is correct
14 Correct 556 ms 612436 KB Output is correct
15 Correct 553 ms 612476 KB Output is correct
16 Correct 623 ms 612648 KB Output is correct
17 Correct 576 ms 613592 KB Output is correct
18 Correct 559 ms 613576 KB Output is correct
19 Correct 559 ms 613624 KB Output is correct
20 Correct 589 ms 612780 KB Output is correct
21 Correct 580 ms 613496 KB Output is correct
22 Correct 560 ms 613328 KB Output is correct
23 Correct 595 ms 613580 KB Output is correct
24 Correct 558 ms 612956 KB Output is correct
25 Correct 600 ms 616536 KB Output is correct
26 Correct 585 ms 616424 KB Output is correct
27 Correct 584 ms 616508 KB Output is correct
28 Correct 573 ms 613712 KB Output is correct
29 Correct 636 ms 616012 KB Output is correct
30 Correct 599 ms 616300 KB Output is correct
31 Correct 594 ms 615132 KB Output is correct
32 Correct 594 ms 615388 KB Output is correct
33 Correct 560 ms 612432 KB Output is correct
34 Correct 562 ms 612344 KB Output is correct
35 Correct 555 ms 612684 KB Output is correct
36 Correct 559 ms 612444 KB Output is correct
37 Correct 553 ms 612444 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 612600 KB Output is correct
2 Correct 561 ms 612816 KB Output is correct
3 Correct 555 ms 612840 KB Output is correct
4 Correct 566 ms 612932 KB Output is correct
5 Correct 554 ms 612600 KB Output is correct
6 Correct 560 ms 612896 KB Output is correct
7 Correct 560 ms 612624 KB Output is correct
8 Correct 552 ms 612728 KB Output is correct
9 Correct 556 ms 612856 KB Output is correct
10 Correct 599 ms 612728 KB Output is correct
11 Correct 557 ms 613064 KB Output is correct
12 Correct 560 ms 612732 KB Output is correct
13 Correct 555 ms 612348 KB Output is correct
14 Correct 556 ms 612436 KB Output is correct
15 Correct 553 ms 612476 KB Output is correct
16 Correct 623 ms 612648 KB Output is correct
17 Correct 576 ms 613592 KB Output is correct
18 Correct 559 ms 613576 KB Output is correct
19 Correct 559 ms 613624 KB Output is correct
20 Correct 589 ms 612780 KB Output is correct
21 Correct 580 ms 613496 KB Output is correct
22 Correct 560 ms 613328 KB Output is correct
23 Correct 595 ms 613580 KB Output is correct
24 Correct 558 ms 612956 KB Output is correct
25 Correct 600 ms 616536 KB Output is correct
26 Correct 585 ms 616424 KB Output is correct
27 Correct 584 ms 616508 KB Output is correct
28 Correct 573 ms 613712 KB Output is correct
29 Correct 636 ms 616012 KB Output is correct
30 Correct 599 ms 616300 KB Output is correct
31 Correct 594 ms 615132 KB Output is correct
32 Correct 594 ms 615388 KB Output is correct
33 Correct 806 ms 632880 KB Output is correct
34 Correct 771 ms 627476 KB Output is correct
35 Correct 851 ms 633072 KB Output is correct
36 Correct 839 ms 633072 KB Output is correct
37 Correct 1002 ms 644280 KB Output is correct
38 Correct 974 ms 644336 KB Output is correct
39 Correct 987 ms 644504 KB Output is correct
40 Correct 959 ms 642628 KB Output is correct
41 Correct 744 ms 620528 KB Output is correct
42 Correct 814 ms 623960 KB Output is correct
43 Correct 1077 ms 642348 KB Output is correct
44 Correct 1174 ms 644152 KB Output is correct
45 Correct 812 ms 629172 KB Output is correct
46 Correct 816 ms 630068 KB Output is correct
47 Correct 1042 ms 637168 KB Output is correct
48 Correct 1060 ms 638976 KB Output is correct
49 Correct 560 ms 612432 KB Output is correct
50 Correct 562 ms 612344 KB Output is correct
51 Correct 555 ms 612684 KB Output is correct
52 Correct 559 ms 612444 KB Output is correct
53 Correct 553 ms 612444 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 590 ms 637364 KB Output is correct
2 Correct 596 ms 633664 KB Output is correct
3 Correct 555 ms 612476 KB Output is correct
4 Correct 554 ms 612368 KB Output is correct
5 Correct 564 ms 616056 KB Output is correct
6 Correct 564 ms 615968 KB Output is correct
7 Correct 562 ms 616068 KB Output is correct
8 Correct 559 ms 615072 KB Output is correct
9 Correct 562 ms 615084 KB Output is correct
10 Correct 575 ms 614588 KB Output is correct
11 Correct 556 ms 615260 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 612580 KB Output is correct
2 Correct 1764 ms 657612 KB Output is correct
3 Correct 3200 ms 710140 KB Output is correct
4 Correct 3330 ms 710636 KB Output is correct
5 Correct 3259 ms 710628 KB Output is correct
6 Correct 759 ms 636692 KB Output is correct
7 Correct 960 ms 658552 KB Output is correct
8 Correct 994 ms 662008 KB Output is correct
9 Correct 560 ms 612432 KB Output is correct
10 Correct 562 ms 612344 KB Output is correct
11 Correct 555 ms 612684 KB Output is correct
12 Correct 559 ms 612444 KB Output is correct
13 Correct 553 ms 612444 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 612600 KB Output is correct
2 Correct 561 ms 612816 KB Output is correct
3 Correct 555 ms 612840 KB Output is correct
4 Correct 566 ms 612932 KB Output is correct
5 Correct 554 ms 612600 KB Output is correct
6 Correct 560 ms 612896 KB Output is correct
7 Correct 560 ms 612624 KB Output is correct
8 Correct 552 ms 612728 KB Output is correct
9 Correct 556 ms 612856 KB Output is correct
10 Correct 599 ms 612728 KB Output is correct
11 Correct 557 ms 613064 KB Output is correct
12 Correct 560 ms 612732 KB Output is correct
13 Correct 555 ms 612348 KB Output is correct
14 Correct 556 ms 612436 KB Output is correct
15 Correct 553 ms 612476 KB Output is correct
16 Correct 623 ms 612648 KB Output is correct
17 Correct 576 ms 613592 KB Output is correct
18 Correct 559 ms 613576 KB Output is correct
19 Correct 559 ms 613624 KB Output is correct
20 Correct 589 ms 612780 KB Output is correct
21 Correct 580 ms 613496 KB Output is correct
22 Correct 560 ms 613328 KB Output is correct
23 Correct 595 ms 613580 KB Output is correct
24 Correct 558 ms 612956 KB Output is correct
25 Correct 600 ms 616536 KB Output is correct
26 Correct 585 ms 616424 KB Output is correct
27 Correct 584 ms 616508 KB Output is correct
28 Correct 573 ms 613712 KB Output is correct
29 Correct 636 ms 616012 KB Output is correct
30 Correct 599 ms 616300 KB Output is correct
31 Correct 594 ms 615132 KB Output is correct
32 Correct 594 ms 615388 KB Output is correct
33 Correct 806 ms 632880 KB Output is correct
34 Correct 771 ms 627476 KB Output is correct
35 Correct 851 ms 633072 KB Output is correct
36 Correct 839 ms 633072 KB Output is correct
37 Correct 1002 ms 644280 KB Output is correct
38 Correct 974 ms 644336 KB Output is correct
39 Correct 987 ms 644504 KB Output is correct
40 Correct 959 ms 642628 KB Output is correct
41 Correct 744 ms 620528 KB Output is correct
42 Correct 814 ms 623960 KB Output is correct
43 Correct 1077 ms 642348 KB Output is correct
44 Correct 1174 ms 644152 KB Output is correct
45 Correct 812 ms 629172 KB Output is correct
46 Correct 816 ms 630068 KB Output is correct
47 Correct 1042 ms 637168 KB Output is correct
48 Correct 1060 ms 638976 KB Output is correct
49 Correct 590 ms 637364 KB Output is correct
50 Correct 596 ms 633664 KB Output is correct
51 Correct 555 ms 612476 KB Output is correct
52 Correct 554 ms 612368 KB Output is correct
53 Correct 564 ms 616056 KB Output is correct
54 Correct 564 ms 615968 KB Output is correct
55 Correct 562 ms 616068 KB Output is correct
56 Correct 559 ms 615072 KB Output is correct
57 Correct 562 ms 615084 KB Output is correct
58 Correct 575 ms 614588 KB Output is correct
59 Correct 556 ms 615260 KB Output is correct
60 Correct 559 ms 612580 KB Output is correct
61 Correct 1764 ms 657612 KB Output is correct
62 Correct 3200 ms 710140 KB Output is correct
63 Correct 3330 ms 710636 KB Output is correct
64 Correct 3259 ms 710628 KB Output is correct
65 Correct 759 ms 636692 KB Output is correct
66 Correct 960 ms 658552 KB Output is correct
67 Correct 994 ms 662008 KB Output is correct
68 Correct 3769 ms 808640 KB Output is correct
69 Correct 3318 ms 785624 KB Output is correct
70 Correct 4498 ms 808744 KB Output is correct
71 Correct 3964 ms 808680 KB Output is correct
72 Execution timed out 5126 ms 954868 KB Time limit exceeded
73 Halted 0 ms 0 KB -