oj.uz

Submission #1064664

# Submission time Handle Problem Language Result Execution time Memory
1064664 2024-08-18T16:33:18 Z jamjanek Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 965996 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();



	set<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.insert({{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]);
		}
	long long wynik = 0;
	for(auto x: sett){
		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 16 ms 50776 KB Output is correct
2 Correct 20 ms 55388 KB Output is correct
3 Correct 18 ms 48220 KB Output is correct
4 Correct 20 ms 56516 KB Output is correct
5 Correct 18 ms 48216 KB Output is correct
6 Correct 14 ms 48220 KB Output is correct
7 Correct 18 ms 47708 KB Output is correct
8 Correct 18 ms 55560 KB Output is correct
9 Correct 19 ms 56508 KB Output is correct
10 Correct 20 ms 56408 KB Output is correct
11 Correct 16 ms 56408 KB Output is correct
12 Correct 19 ms 56636 KB Output is correct
13 Correct 15 ms 53084 KB Output is correct
14 Correct 18 ms 54108 KB Output is correct
15 Correct 12 ms 58972 KB Output is correct
16 Correct 14 ms 53340 KB Output is correct
17 Correct 11 ms 53084 KB Output is correct
18 Correct 15 ms 53340 KB Output is correct
19 Correct 20 ms 56400 KB Output is correct
20 Correct 13 ms 56156 KB Output is correct
21 Correct 16 ms 53940 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 50776 KB Output is correct
2 Correct 20 ms 55388 KB Output is correct
3 Correct 18 ms 48220 KB Output is correct
4 Correct 20 ms 56516 KB Output is correct
5 Correct 18 ms 48216 KB Output is correct
6 Correct 14 ms 48220 KB Output is correct
7 Correct 18 ms 47708 KB Output is correct
8 Correct 18 ms 55560 KB Output is correct
9 Correct 19 ms 56508 KB Output is correct
10 Correct 20 ms 56408 KB Output is correct
11 Correct 16 ms 56408 KB Output is correct
12 Correct 19 ms 56636 KB Output is correct
13 Correct 15 ms 53084 KB Output is correct
14 Correct 18 ms 54108 KB Output is correct
15 Correct 12 ms 58972 KB Output is correct
16 Correct 14 ms 53340 KB Output is correct
17 Correct 11 ms 53084 KB Output is correct
18 Correct 15 ms 53340 KB Output is correct
19 Correct 20 ms 56400 KB Output is correct
20 Correct 13 ms 56156 KB Output is correct
21 Correct 16 ms 53940 KB Output is correct
22 Correct 29 ms 62044 KB Output is correct
23 Correct 32 ms 62036 KB Output is correct
24 Correct 24 ms 62044 KB Output is correct
25 Correct 27 ms 61848 KB Output is correct
26 Correct 23 ms 61776 KB Output is correct
27 Correct 29 ms 61776 KB Output is correct
28 Correct 30 ms 61784 KB Output is correct
29 Correct 25 ms 60508 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 50776 KB Output is correct
2 Correct 20 ms 55388 KB Output is correct
3 Correct 18 ms 48220 KB Output is correct
4 Correct 20 ms 56516 KB Output is correct
5 Correct 18 ms 48216 KB Output is correct
6 Correct 14 ms 48220 KB Output is correct
7 Correct 18 ms 47708 KB Output is correct
8 Correct 18 ms 55560 KB Output is correct
9 Correct 19 ms 56508 KB Output is correct
10 Correct 20 ms 56408 KB Output is correct
11 Correct 16 ms 56408 KB Output is correct
12 Correct 19 ms 56636 KB Output is correct
13 Correct 15 ms 53084 KB Output is correct
14 Correct 18 ms 54108 KB Output is correct
15 Correct 12 ms 58972 KB Output is correct
16 Correct 14 ms 53340 KB Output is correct
17 Correct 29 ms 62044 KB Output is correct
18 Correct 32 ms 62036 KB Output is correct
19 Correct 24 ms 62044 KB Output is correct
20 Correct 27 ms 61848 KB Output is correct
21 Correct 23 ms 61776 KB Output is correct
22 Correct 29 ms 61776 KB Output is correct
23 Correct 30 ms 61784 KB Output is correct
24 Correct 25 ms 60508 KB Output is correct
25 Correct 11 ms 53084 KB Output is correct
26 Correct 15 ms 53340 KB Output is correct
27 Correct 20 ms 56400 KB Output is correct
28 Correct 13 ms 56156 KB Output is correct
29 Correct 16 ms 53940 KB Output is correct
30 Correct 65 ms 77136 KB Output is correct
31 Correct 67 ms 76980 KB Output is correct
32 Correct 69 ms 77136 KB Output is correct
33 Correct 54 ms 75780 KB Output is correct
34 Correct 63 ms 76368 KB Output is correct
35 Correct 76 ms 76372 KB Output is correct
36 Correct 59 ms 76308 KB Output is correct
37 Correct 70 ms 76108 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 50776 KB Output is correct
2 Correct 20 ms 55388 KB Output is correct
3 Correct 18 ms 48220 KB Output is correct
4 Correct 20 ms 56516 KB Output is correct
5 Correct 18 ms 48216 KB Output is correct
6 Correct 14 ms 48220 KB Output is correct
7 Correct 18 ms 47708 KB Output is correct
8 Correct 18 ms 55560 KB Output is correct
9 Correct 19 ms 56508 KB Output is correct
10 Correct 20 ms 56408 KB Output is correct
11 Correct 16 ms 56408 KB Output is correct
12 Correct 19 ms 56636 KB Output is correct
13 Correct 15 ms 53084 KB Output is correct
14 Correct 18 ms 54108 KB Output is correct
15 Correct 12 ms 58972 KB Output is correct
16 Correct 14 ms 53340 KB Output is correct
17 Correct 29 ms 62044 KB Output is correct
18 Correct 32 ms 62036 KB Output is correct
19 Correct 24 ms 62044 KB Output is correct
20 Correct 27 ms 61848 KB Output is correct
21 Correct 23 ms 61776 KB Output is correct
22 Correct 29 ms 61776 KB Output is correct
23 Correct 30 ms 61784 KB Output is correct
24 Correct 25 ms 60508 KB Output is correct
25 Correct 65 ms 77136 KB Output is correct
26 Correct 67 ms 76980 KB Output is correct
27 Correct 69 ms 77136 KB Output is correct
28 Correct 54 ms 75780 KB Output is correct
29 Correct 63 ms 76368 KB Output is correct
30 Correct 76 ms 76372 KB Output is correct
31 Correct 59 ms 76308 KB Output is correct
32 Correct 70 ms 76108 KB Output is correct
33 Correct 11 ms 53084 KB Output is correct
34 Correct 15 ms 53340 KB Output is correct
35 Correct 20 ms 56400 KB Output is correct
36 Correct 13 ms 56156 KB Output is correct
37 Correct 16 ms 53940 KB Output is correct
38 Correct 148 ms 151632 KB Output is correct
39 Correct 140 ms 148320 KB Output is correct
40 Correct 147 ms 148308 KB Output is correct
41 Correct 133 ms 148300 KB Output is correct
42 Correct 537 ms 180052 KB Output is correct
43 Correct 573 ms 180048 KB Output is correct
44 Correct 509 ms 181984 KB Output is correct
45 Correct 470 ms 174328 KB Output is correct
46 Correct 256 ms 160620 KB Output is correct
47 Correct 344 ms 166224 KB Output is correct
48 Correct 562 ms 177432 KB Output is correct
49 Correct 509 ms 176980 KB Output is correct
50 Correct 255 ms 137664 KB Output is correct
51 Correct 285 ms 126748 KB Output is correct
52 Correct 456 ms 172112 KB Output is correct
53 Correct 474 ms 172588 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 90960 KB Output is correct
2 Correct 128 ms 90884 KB Output is correct
3 Correct 141 ms 90968 KB Output is correct
4 Correct 12 ms 57972 KB Output is correct
5 Correct 140 ms 90912 KB Output is correct
6 Correct 153 ms 91004 KB Output is correct
7 Correct 137 ms 90888 KB Output is correct
8 Correct 139 ms 90900 KB Output is correct
9 Correct 151 ms 90960 KB Output is correct
10 Correct 135 ms 90704 KB Output is correct
11 Correct 137 ms 90784 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 53084 KB Output is correct
2 Correct 15 ms 53340 KB Output is correct
3 Correct 20 ms 56400 KB Output is correct
4 Correct 13 ms 56156 KB Output is correct
5 Correct 16 ms 53940 KB Output is correct
6 Correct 12 ms 58968 KB Output is correct
7 Correct 1405 ms 393812 KB Output is correct
8 Correct 3032 ms 706868 KB Output is correct
9 Correct 3191 ms 709704 KB Output is correct
10 Correct 3161 ms 709200 KB Output is correct
11 Correct 517 ms 336820 KB Output is correct
12 Correct 820 ms 569452 KB Output is correct
13 Correct 913 ms 575304 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 50776 KB Output is correct
2 Correct 20 ms 55388 KB Output is correct
3 Correct 18 ms 48220 KB Output is correct
4 Correct 20 ms 56516 KB Output is correct
5 Correct 18 ms 48216 KB Output is correct
6 Correct 14 ms 48220 KB Output is correct
7 Correct 18 ms 47708 KB Output is correct
8 Correct 18 ms 55560 KB Output is correct
9 Correct 19 ms 56508 KB Output is correct
10 Correct 20 ms 56408 KB Output is correct
11 Correct 16 ms 56408 KB Output is correct
12 Correct 19 ms 56636 KB Output is correct
13 Correct 15 ms 53084 KB Output is correct
14 Correct 18 ms 54108 KB Output is correct
15 Correct 12 ms 58972 KB Output is correct
16 Correct 14 ms 53340 KB Output is correct
17 Correct 29 ms 62044 KB Output is correct
18 Correct 32 ms 62036 KB Output is correct
19 Correct 24 ms 62044 KB Output is correct
20 Correct 27 ms 61848 KB Output is correct
21 Correct 23 ms 61776 KB Output is correct
22 Correct 29 ms 61776 KB Output is correct
23 Correct 30 ms 61784 KB Output is correct
24 Correct 25 ms 60508 KB Output is correct
25 Correct 65 ms 77136 KB Output is correct
26 Correct 67 ms 76980 KB Output is correct
27 Correct 69 ms 77136 KB Output is correct
28 Correct 54 ms 75780 KB Output is correct
29 Correct 63 ms 76368 KB Output is correct
30 Correct 76 ms 76372 KB Output is correct
31 Correct 59 ms 76308 KB Output is correct
32 Correct 70 ms 76108 KB Output is correct
33 Correct 148 ms 151632 KB Output is correct
34 Correct 140 ms 148320 KB Output is correct
35 Correct 147 ms 148308 KB Output is correct
36 Correct 133 ms 148300 KB Output is correct
37 Correct 537 ms 180052 KB Output is correct
38 Correct 573 ms 180048 KB Output is correct
39 Correct 509 ms 181984 KB Output is correct
40 Correct 470 ms 174328 KB Output is correct
41 Correct 256 ms 160620 KB Output is correct
42 Correct 344 ms 166224 KB Output is correct
43 Correct 562 ms 177432 KB Output is correct
44 Correct 509 ms 176980 KB Output is correct
45 Correct 255 ms 137664 KB Output is correct
46 Correct 285 ms 126748 KB Output is correct
47 Correct 456 ms 172112 KB Output is correct
48 Correct 474 ms 172588 KB Output is correct
49 Correct 147 ms 90960 KB Output is correct
50 Correct 128 ms 90884 KB Output is correct
51 Correct 141 ms 90968 KB Output is correct
52 Correct 12 ms 57972 KB Output is correct
53 Correct 140 ms 90912 KB Output is correct
54 Correct 153 ms 91004 KB Output is correct
55 Correct 137 ms 90888 KB Output is correct
56 Correct 139 ms 90900 KB Output is correct
57 Correct 151 ms 90960 KB Output is correct
58 Correct 135 ms 90704 KB Output is correct
59 Correct 137 ms 90784 KB Output is correct
60 Correct 12 ms 58968 KB Output is correct
61 Correct 1405 ms 393812 KB Output is correct
62 Correct 3032 ms 706868 KB Output is correct
63 Correct 3191 ms 709704 KB Output is correct
64 Correct 3161 ms 709200 KB Output is correct
65 Correct 517 ms 336820 KB Output is correct
66 Correct 820 ms 569452 KB Output is correct
67 Correct 913 ms 575304 KB Output is correct
68 Correct 11 ms 53084 KB Output is correct
69 Correct 15 ms 53340 KB Output is correct
70 Correct 20 ms 56400 KB Output is correct
71 Correct 13 ms 56156 KB Output is correct
72 Correct 16 ms 53940 KB Output is correct
73 Correct 989 ms 561364 KB Output is correct
74 Correct 975 ms 561492 KB Output is correct
75 Correct 986 ms 561612 KB Output is correct
76 Correct 1002 ms 561372 KB Output is correct
77 Execution timed out 5107 ms 965996 KB Time limit exceeded
78 Halted 0 ms 0 KB -