oj.uz

Submission #1064645

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

int maxi1(int war, int l, int r){
	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){
	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){
	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){
	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]}});
			}
		}
	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 1 ms 6492 KB Output is correct
2 Correct 1 ms 6692 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6692 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 3 ms 11100 KB Output is correct
23 Correct 3 ms 11100 KB Output is correct
24 Correct 3 ms 11100 KB Output is correct
25 Correct 2 ms 10844 KB Output is correct
26 Correct 3 ms 11100 KB Output is correct
27 Correct 3 ms 11100 KB Output is correct
28 Correct 3 ms 11100 KB Output is correct
29 Correct 2 ms 10844 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6692 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 3 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 11100 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 3 ms 11100 KB Output is correct
22 Correct 3 ms 11100 KB Output is correct
23 Correct 3 ms 11100 KB Output is correct
24 Correct 2 ms 10844 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 2 ms 6748 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 21 ms 22240 KB Output is correct
31 Correct 23 ms 22360 KB Output is correct
32 Correct 22 ms 22360 KB Output is correct
33 Correct 11 ms 20828 KB Output is correct
34 Correct 16 ms 21764 KB Output is correct
35 Correct 17 ms 21848 KB Output is correct
36 Correct 15 ms 21500 KB Output is correct
37 Correct 15 ms 21592 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6692 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 3 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 11100 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 3 ms 11100 KB Output is correct
22 Correct 3 ms 11100 KB Output is correct
23 Correct 3 ms 11100 KB Output is correct
24 Correct 2 ms 10844 KB Output is correct
25 Correct 21 ms 22240 KB Output is correct
26 Correct 23 ms 22360 KB Output is correct
27 Correct 22 ms 22360 KB Output is correct
28 Correct 11 ms 20828 KB Output is correct
29 Correct 16 ms 21764 KB Output is correct
30 Correct 17 ms 21848 KB Output is correct
31 Correct 15 ms 21500 KB Output is correct
32 Correct 15 ms 21592 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 2 ms 6748 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 1 ms 6492 KB Output is correct
38 Correct 56 ms 55624 KB Output is correct
39 Correct 55 ms 55636 KB Output is correct
40 Correct 54 ms 55696 KB Output is correct
41 Correct 58 ms 55632 KB Output is correct
42 Correct 650 ms 87520 KB Output is correct
43 Correct 630 ms 87376 KB Output is correct
44 Correct 642 ms 87636 KB Output is correct
45 Correct 594 ms 84252 KB Output is correct
46 Correct 127 ms 64336 KB Output is correct
47 Correct 177 ms 69144 KB Output is correct
48 Correct 303 ms 79604 KB Output is correct
49 Correct 319 ms 81560 KB Output is correct
50 Correct 125 ms 59384 KB Output is correct
51 Correct 130 ms 49748 KB Output is correct
52 Correct 254 ms 75764 KB Output is correct
53 Correct 264 ms 76852 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4952 KB Output is correct
2 Correct 5 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 2 ms 6748 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 995 ms 225472 KB Output is correct
8 Correct 2402 ms 450132 KB Output is correct
9 Correct 2399 ms 451920 KB Output is correct
10 Correct 2423 ms 451392 KB Output is correct
11 Correct 294 ms 168904 KB Output is correct
12 Correct 578 ms 310868 KB Output is correct
13 Correct 598 ms 317504 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6692 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 3 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 3 ms 11100 KB Output is correct
20 Correct 2 ms 10844 KB Output is correct
21 Correct 3 ms 11100 KB Output is correct
22 Correct 3 ms 11100 KB Output is correct
23 Correct 3 ms 11100 KB Output is correct
24 Correct 2 ms 10844 KB Output is correct
25 Correct 21 ms 22240 KB Output is correct
26 Correct 23 ms 22360 KB Output is correct
27 Correct 22 ms 22360 KB Output is correct
28 Correct 11 ms 20828 KB Output is correct
29 Correct 16 ms 21764 KB Output is correct
30 Correct 17 ms 21848 KB Output is correct
31 Correct 15 ms 21500 KB Output is correct
32 Correct 15 ms 21592 KB Output is correct
33 Correct 56 ms 55624 KB Output is correct
34 Correct 55 ms 55636 KB Output is correct
35 Correct 54 ms 55696 KB Output is correct
36 Correct 58 ms 55632 KB Output is correct
37 Correct 650 ms 87520 KB Output is correct
38 Correct 630 ms 87376 KB Output is correct
39 Correct 642 ms 87636 KB Output is correct
40 Correct 594 ms 84252 KB Output is correct
41 Correct 127 ms 64336 KB Output is correct
42 Correct 177 ms 69144 KB Output is correct
43 Correct 303 ms 79604 KB Output is correct
44 Correct 319 ms 81560 KB Output is correct
45 Correct 125 ms 59384 KB Output is correct
46 Correct 130 ms 49748 KB Output is correct
47 Correct 254 ms 75764 KB Output is correct
48 Correct 264 ms 76852 KB Output is correct
49 Correct 6 ms 4952 KB Output is correct
50 Correct 5 ms 4956 KB Output is correct
51 Correct 1 ms 4956 KB Output is correct
52 Correct 1 ms 4444 KB Output is correct
53 Correct 2 ms 4956 KB Output is correct
54 Correct 2 ms 4956 KB Output is correct
55 Correct 2 ms 4956 KB Output is correct
56 Correct 2 ms 4956 KB Output is correct
57 Correct 2 ms 4956 KB Output is correct
58 Correct 1 ms 4700 KB Output is correct
59 Correct 1 ms 4700 KB Output is correct
60 Correct 1 ms 6492 KB Output is correct
61 Correct 995 ms 225472 KB Output is correct
62 Correct 2402 ms 450132 KB Output is correct
63 Correct 2399 ms 451920 KB Output is correct
64 Correct 2423 ms 451392 KB Output is correct
65 Correct 294 ms 168904 KB Output is correct
66 Correct 578 ms 310868 KB Output is correct
67 Correct 598 ms 317504 KB Output is correct
68 Correct 0 ms 2396 KB Output is correct
69 Correct 0 ms 2396 KB Output is correct
70 Correct 2 ms 6748 KB Output is correct
71 Correct 1 ms 6492 KB Output is correct
72 Correct 1 ms 6492 KB Output is correct
73 Correct 750 ms 337976 KB Output is correct
74 Correct 711 ms 338260 KB Output is correct
75 Correct 732 ms 338244 KB Output is correct
76 Correct 733 ms 338004 KB Output is correct
77 Execution timed out 5062 ms 744020 KB Time limit exceeded
78 Halted 0 ms 0 KB -