oj.uz

Submission #1064690

# Submission time Handle Problem Language Result Execution time Memory
1064690 2024-08-18T16:53:20 Z jamjanek Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 697292 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>>stosy[2510];
int nast[2510][2510][4];
int nast2[2510][2510][4];

const int base = 1<<12;
int tree1[2510][2*base];
int tree2[2510][2*base];
int tree3[2*base][2510];
int tree4[2*base][2510];

int MAXI1(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return -1;
	if(a<=l && p<=b)return tree3[w][war];
	return max(MAXI1(w*2, l, (l+p)/2, a, b, war), MAXI1(w*2+1, (l+p)/2+1, p, a, b, war));
}
int MINI1(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return 2600;
	if(a<=l && p<=b)return tree4[w][war];
	return min(MINI1(w*2, l, (l+p)/2, a, b, war), MINI1(w*2+1, (l+p)/2+1, p, a, b, war));
}
int MAXI2(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return -1;
	if(a<=l && p<=b)return tree1[war][w];
	return max(MAXI2(w*2, l, (l+p)/2, a, b, war), MAXI2(w*2+1, (l+p)/2+1, p, a, b, war));
}
int MINI2(int w, int l, int p, int a, int b, int war){
	if(p<a || b<l)return 2600;
	if(a<=l && p<=b)return tree2[war][w];
	return min(MINI2(w*2, l, (l+p)/2, a, b, war), MINI2(w*2+1, (l+p)/2+1, p, a, b, war));
}

int maxi1(int war, int l, int r){
	return MAXI1(1, 0, base-1, l, r, war);
	int res = -1;
	for(int i=l;i<=r;i++)
		res = max(res, nast2[i][war][0]);
	return res;
}
int mini1(int war, int l, int r){
	return MINI1(1, 0, base-1, l, r, war);
	int res = 2600;
	for(int i=l;i<=r;i++)
		res = min(res, nast2[i][war][1]);
	return res;
}
int maxi2(int war, int l, int r){
	return MAXI2(1, 0, base-1, l, r, war);
	int res = -1;
	for(int i=l;i<=r;i++)
		res = max(res, nast2[war][i][2]);
	return res;
}
int mini2(int war, int l, int r){
	return MINI2(1, 0, base-1, l, r, war);
	int res = 2600;
	for(int i=l;i<=r;i++)
		res = min(res, nast2[war][i][3]);
	return res;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = a.size();
	int m = a[0].size();
	int i, j;

	//poprzednie po x [0]	
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			while(stosy[i].size() && stosy[i].back().first<=a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[i][j][0] = stosy[i].back().second;
			else
				nast[i][j][0] = -1;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();

	//nastepne po x [1]

	for(i=0;i<n;i++){
		for(j=m-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<=a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[i][j][1] = stosy[i].back().second;
			else
				nast[i][j][1] = m;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();
	
	//poprzednie po y [2]
	for(i=0;i<m;i++){
		for(j=0;j<n;j++){
			while(stosy[i].size() && stosy[i].back().first<=a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[j][i][2] = stosy[i].back().second;
			else
				nast[j][i][2] = -1;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();

	//nastepne po y [3]
	for(i=0;i<m;i++){
		for(j = n-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<=a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast[j][i][3] = stosy[i].back().second;
			else
				nast[j][i][3] = n;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();
		
		
		
		
		
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			while(stosy[i].size() && stosy[i].back().first<a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[i][j][0] = stosy[i].back().second;
			else
				nast2[i][j][0] = -1;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();

	//nastepne po x [1]

	for(i=0;i<n;i++){
		for(j=m-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<a[i][j])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[i][j][1] = stosy[i].back().second;
			else
				nast2[i][j][1] = m;
			stosy[i].push_back({a[i][j], j});
		}
	}
	for(i=0;i<n;i++)
		stosy[i].clear();
	
	//poprzednie po y [2]
	for(i=0;i<m;i++){
		for(j=0;j<n;j++){
			while(stosy[i].size() && stosy[i].back().first<a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[j][i][2] = stosy[i].back().second;
			else
				nast2[j][i][2] = -1;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();

	//nastepne po y [3]
	for(i=0;i<m;i++){
		for(j = n-1;j>=0;j--){
			while(stosy[i].size() && stosy[i].back().first<a[j][i])
				stosy[i].pop_back();
			if(stosy[i].size())
				nast2[j][i][3] = stosy[i].back().second;
			else
				nast2[j][i][3] = n;
			stosy[i].push_back({a[j][i], j});
		}
	}
	for(i=0;i<m;i++)
		stosy[i].clear();



	vector<pair<pair<int,int>, pair<int,int>>>sett;
	for(i=1;i<n-1;i++)
		for(j=1;j<m-1;j++){
			//printf("%d %d %d %d\n", nast[i][j][0], nast[i][j][1], nast[i][j][2], nast[i][j][3]);
			if(nast[i][j][0]!=-1 && nast[i][j][1]!=m && nast[i][j][2]!=-1 && nast[i][j][3]!=n){
				//printf("dodaje\n");
				sett.push_back({{nast[i][j][0], nast[i][j][1]}, {nast[i][j][2], nast[i][j][3]}});
			}
		}
	
	for(i=0;i<n;i++)
		for(j=0;j<m;j++){
			tree3[base+i][j] = nast2[i][j][0];
			tree4[base+i][j] = nast2[i][j][1];
			tree1[i][base+j] = nast2[i][j][2];
			tree2[i][base+j] = nast2[i][j][3];
		}
	for(i=0;i<n;i++)
		for(j=base-1;j>0;j--){
			tree1[i][j] = max(tree1[i][j*2], tree1[i][j*2+1]);
			tree2[i][j] = min(tree2[i][j*2], tree2[i][j*2+1]);
		}
	for(i=0;i<m;i++)
		for(j=base-1;j>0;j--){
			tree3[j][i] = max(tree3[j*2][i], tree3[j*2+1][i]);
			tree4[j][i] = min(tree4[j*2][i], tree4[j*2+1][i]);
		}
	sort(sett.begin(), sett.end());
	long long wynik = 0;
	for(i=0;i<(int)sett.size();i++){
		if(i!=0 && sett[i-1]==sett[i])continue;
		auto x = sett[i];
		if(mini1(x.first.first, x.second.first+1, x.second.second-1)<x.first.second)continue;
		if(maxi1(x.first.second, x.second.first+1, x.second.second-1)>x.first.first)continue;

		if(mini2(x.second.first, x.first.first+1, x.first.second-1)<x.second.second)continue;
		if(maxi2(x.second.second, x.first.first+1, x.first.second-1)>x.second.first)continue;
		wynik++;
	}
	
	return wynik;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 52056 KB Output is correct
2 Correct 14 ms 53084 KB Output is correct
3 Correct 14 ms 53084 KB Output is correct
4 Correct 20 ms 53084 KB Output is correct
5 Correct 14 ms 55384 KB Output is correct
6 Correct 15 ms 55304 KB Output is correct
7 Correct 14 ms 54876 KB Output is correct
8 Correct 14 ms 54388 KB Output is correct
9 Correct 17 ms 55348 KB Output is correct
10 Correct 15 ms 55412 KB Output is correct
11 Correct 17 ms 55424 KB Output is correct
12 Correct 15 ms 55388 KB Output is correct
13 Correct 12 ms 49500 KB Output is correct
14 Correct 12 ms 51548 KB Output is correct
15 Correct 13 ms 53084 KB Output is correct
16 Correct 12 ms 50780 KB Output is correct
17 Correct 11 ms 52060 KB Output is correct
18 Correct 12 ms 52040 KB Output is correct
19 Correct 21 ms 55388 KB Output is correct
20 Correct 14 ms 52580 KB Output is correct
21 Correct 11 ms 50508 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 52056 KB Output is correct
2 Correct 14 ms 53084 KB Output is correct
3 Correct 14 ms 53084 KB Output is correct
4 Correct 20 ms 53084 KB Output is correct
5 Correct 14 ms 55384 KB Output is correct
6 Correct 15 ms 55304 KB Output is correct
7 Correct 14 ms 54876 KB Output is correct
8 Correct 14 ms 54388 KB Output is correct
9 Correct 17 ms 55348 KB Output is correct
10 Correct 15 ms 55412 KB Output is correct
11 Correct 17 ms 55424 KB Output is correct
12 Correct 15 ms 55388 KB Output is correct
13 Correct 12 ms 49500 KB Output is correct
14 Correct 12 ms 51548 KB Output is correct
15 Correct 13 ms 53084 KB Output is correct
16 Correct 12 ms 50780 KB Output is correct
17 Correct 11 ms 52060 KB Output is correct
18 Correct 12 ms 52040 KB Output is correct
19 Correct 21 ms 55388 KB Output is correct
20 Correct 14 ms 52580 KB Output is correct
21 Correct 11 ms 50508 KB Output is correct
22 Correct 24 ms 57692 KB Output is correct
23 Correct 26 ms 57688 KB Output is correct
24 Correct 26 ms 57708 KB Output is correct
25 Correct 24 ms 59736 KB Output is correct
26 Correct 24 ms 59728 KB Output is correct
27 Correct 24 ms 59800 KB Output is correct
28 Correct 24 ms 57692 KB Output is correct
29 Correct 21 ms 56120 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 52056 KB Output is correct
2 Correct 14 ms 53084 KB Output is correct
3 Correct 14 ms 53084 KB Output is correct
4 Correct 20 ms 53084 KB Output is correct
5 Correct 14 ms 55384 KB Output is correct
6 Correct 15 ms 55304 KB Output is correct
7 Correct 14 ms 54876 KB Output is correct
8 Correct 14 ms 54388 KB Output is correct
9 Correct 17 ms 55348 KB Output is correct
10 Correct 15 ms 55412 KB Output is correct
11 Correct 17 ms 55424 KB Output is correct
12 Correct 15 ms 55388 KB Output is correct
13 Correct 12 ms 49500 KB Output is correct
14 Correct 12 ms 51548 KB Output is correct
15 Correct 13 ms 53084 KB Output is correct
16 Correct 12 ms 50780 KB Output is correct
17 Correct 24 ms 57692 KB Output is correct
18 Correct 26 ms 57688 KB Output is correct
19 Correct 26 ms 57708 KB Output is correct
20 Correct 24 ms 59736 KB Output is correct
21 Correct 24 ms 59728 KB Output is correct
22 Correct 24 ms 59800 KB Output is correct
23 Correct 24 ms 57692 KB Output is correct
24 Correct 21 ms 56120 KB Output is correct
25 Correct 11 ms 52060 KB Output is correct
26 Correct 12 ms 52040 KB Output is correct
27 Correct 21 ms 55388 KB Output is correct
28 Correct 14 ms 52580 KB Output is correct
29 Correct 11 ms 50508 KB Output is correct
30 Correct 60 ms 71884 KB Output is correct
31 Correct 66 ms 73936 KB Output is correct
32 Correct 61 ms 71924 KB Output is correct
33 Correct 62 ms 73420 KB Output is correct
34 Correct 53 ms 73548 KB Output is correct
35 Correct 50 ms 71624 KB Output is correct
36 Correct 55 ms 71616 KB Output is correct
37 Correct 54 ms 73668 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 52056 KB Output is correct
2 Correct 14 ms 53084 KB Output is correct
3 Correct 14 ms 53084 KB Output is correct
4 Correct 20 ms 53084 KB Output is correct
5 Correct 14 ms 55384 KB Output is correct
6 Correct 15 ms 55304 KB Output is correct
7 Correct 14 ms 54876 KB Output is correct
8 Correct 14 ms 54388 KB Output is correct
9 Correct 17 ms 55348 KB Output is correct
10 Correct 15 ms 55412 KB Output is correct
11 Correct 17 ms 55424 KB Output is correct
12 Correct 15 ms 55388 KB Output is correct
13 Correct 12 ms 49500 KB Output is correct
14 Correct 12 ms 51548 KB Output is correct
15 Correct 13 ms 53084 KB Output is correct
16 Correct 12 ms 50780 KB Output is correct
17 Correct 24 ms 57692 KB Output is correct
18 Correct 26 ms 57688 KB Output is correct
19 Correct 26 ms 57708 KB Output is correct
20 Correct 24 ms 59736 KB Output is correct
21 Correct 24 ms 59728 KB Output is correct
22 Correct 24 ms 59800 KB Output is correct
23 Correct 24 ms 57692 KB Output is correct
24 Correct 21 ms 56120 KB Output is correct
25 Correct 60 ms 71884 KB Output is correct
26 Correct 66 ms 73936 KB Output is correct
27 Correct 61 ms 71924 KB Output is correct
28 Correct 62 ms 73420 KB Output is correct
29 Correct 53 ms 73548 KB Output is correct
30 Correct 50 ms 71624 KB Output is correct
31 Correct 55 ms 71616 KB Output is correct
32 Correct 54 ms 73668 KB Output is correct
33 Correct 11 ms 52060 KB Output is correct
34 Correct 12 ms 52040 KB Output is correct
35 Correct 21 ms 55388 KB Output is correct
36 Correct 14 ms 52580 KB Output is correct
37 Correct 11 ms 50508 KB Output is correct
38 Correct 145 ms 143428 KB Output is correct
39 Correct 141 ms 143188 KB Output is correct
40 Correct 136 ms 145808 KB Output is correct
41 Correct 138 ms 144812 KB Output is correct
42 Correct 440 ms 152248 KB Output is correct
43 Correct 413 ms 152276 KB Output is correct
44 Correct 458 ms 155064 KB Output is correct
45 Correct 416 ms 150204 KB Output is correct
46 Correct 209 ms 144544 KB Output is correct
47 Correct 245 ms 147376 KB Output is correct
48 Correct 309 ms 148396 KB Output is correct
49 Correct 313 ms 149436 KB Output is correct
50 Correct 179 ms 118548 KB Output is correct
51 Correct 186 ms 111800 KB Output is correct
52 Correct 321 ms 149228 KB Output is correct
53 Correct 333 ms 149748 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 90956 KB Output is correct
2 Correct 140 ms 90984 KB Output is correct
3 Correct 152 ms 90960 KB Output is correct
4 Correct 12 ms 49496 KB Output is correct
5 Correct 156 ms 90852 KB Output is correct
6 Correct 166 ms 90964 KB Output is correct
7 Correct 154 ms 90936 KB Output is correct
8 Correct 157 ms 90960 KB Output is correct
9 Correct 171 ms 90964 KB Output is correct
10 Correct 155 ms 90872 KB Output is correct
11 Correct 142 ms 90900 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 52060 KB Output is correct
2 Correct 12 ms 52040 KB Output is correct
3 Correct 21 ms 55388 KB Output is correct
4 Correct 14 ms 52580 KB Output is correct
5 Correct 11 ms 50508 KB Output is correct
6 Correct 13 ms 50524 KB Output is correct
7 Correct 1048 ms 346232 KB Output is correct
8 Correct 1954 ms 605252 KB Output is correct
9 Correct 2021 ms 606364 KB Output is correct
10 Correct 1965 ms 606792 KB Output is correct
11 Correct 544 ms 340144 KB Output is correct
12 Correct 880 ms 575432 KB Output is correct
13 Correct 882 ms 581812 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 52056 KB Output is correct
2 Correct 14 ms 53084 KB Output is correct
3 Correct 14 ms 53084 KB Output is correct
4 Correct 20 ms 53084 KB Output is correct
5 Correct 14 ms 55384 KB Output is correct
6 Correct 15 ms 55304 KB Output is correct
7 Correct 14 ms 54876 KB Output is correct
8 Correct 14 ms 54388 KB Output is correct
9 Correct 17 ms 55348 KB Output is correct
10 Correct 15 ms 55412 KB Output is correct
11 Correct 17 ms 55424 KB Output is correct
12 Correct 15 ms 55388 KB Output is correct
13 Correct 12 ms 49500 KB Output is correct
14 Correct 12 ms 51548 KB Output is correct
15 Correct 13 ms 53084 KB Output is correct
16 Correct 12 ms 50780 KB Output is correct
17 Correct 24 ms 57692 KB Output is correct
18 Correct 26 ms 57688 KB Output is correct
19 Correct 26 ms 57708 KB Output is correct
20 Correct 24 ms 59736 KB Output is correct
21 Correct 24 ms 59728 KB Output is correct
22 Correct 24 ms 59800 KB Output is correct
23 Correct 24 ms 57692 KB Output is correct
24 Correct 21 ms 56120 KB Output is correct
25 Correct 60 ms 71884 KB Output is correct
26 Correct 66 ms 73936 KB Output is correct
27 Correct 61 ms 71924 KB Output is correct
28 Correct 62 ms 73420 KB Output is correct
29 Correct 53 ms 73548 KB Output is correct
30 Correct 50 ms 71624 KB Output is correct
31 Correct 55 ms 71616 KB Output is correct
32 Correct 54 ms 73668 KB Output is correct
33 Correct 145 ms 143428 KB Output is correct
34 Correct 141 ms 143188 KB Output is correct
35 Correct 136 ms 145808 KB Output is correct
36 Correct 138 ms 144812 KB Output is correct
37 Correct 440 ms 152248 KB Output is correct
38 Correct 413 ms 152276 KB Output is correct
39 Correct 458 ms 155064 KB Output is correct
40 Correct 416 ms 150204 KB Output is correct
41 Correct 209 ms 144544 KB Output is correct
42 Correct 245 ms 147376 KB Output is correct
43 Correct 309 ms 148396 KB Output is correct
44 Correct 313 ms 149436 KB Output is correct
45 Correct 179 ms 118548 KB Output is correct
46 Correct 186 ms 111800 KB Output is correct
47 Correct 321 ms 149228 KB Output is correct
48 Correct 333 ms 149748 KB Output is correct
49 Correct 155 ms 90956 KB Output is correct
50 Correct 140 ms 90984 KB Output is correct
51 Correct 152 ms 90960 KB Output is correct
52 Correct 12 ms 49496 KB Output is correct
53 Correct 156 ms 90852 KB Output is correct
54 Correct 166 ms 90964 KB Output is correct
55 Correct 154 ms 90936 KB Output is correct
56 Correct 157 ms 90960 KB Output is correct
57 Correct 171 ms 90964 KB Output is correct
58 Correct 155 ms 90872 KB Output is correct
59 Correct 142 ms 90900 KB Output is correct
60 Correct 13 ms 50524 KB Output is correct
61 Correct 1048 ms 346232 KB Output is correct
62 Correct 1954 ms 605252 KB Output is correct
63 Correct 2021 ms 606364 KB Output is correct
64 Correct 1965 ms 606792 KB Output is correct
65 Correct 544 ms 340144 KB Output is correct
66 Correct 880 ms 575432 KB Output is correct
67 Correct 882 ms 581812 KB Output is correct
68 Correct 11 ms 52060 KB Output is correct
69 Correct 12 ms 52040 KB Output is correct
70 Correct 21 ms 55388 KB Output is correct
71 Correct 14 ms 52580 KB Output is correct
72 Correct 11 ms 50508 KB Output is correct
73 Correct 1046 ms 585408 KB Output is correct
74 Correct 1025 ms 584980 KB Output is correct
75 Correct 1049 ms 585016 KB Output is correct
76 Correct 1014 ms 584912 KB Output is correct
77 Execution timed out 5072 ms 697292 KB Time limit exceeded
78 Halted 0 ms 0 KB -