oj.uz

Submission #266759

# Submission time Handle Problem Language Result Execution time Memory
266759 2020-08-15T12:40:50 Z dennisstar Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 496964 KB 
#include <bits/stdc++.h>
#include "rect.h"
#define eb emplace_back
using namespace std;
using tii=tuple<int, int, int>;

int N, M;
vector<tii> H, V;

long long count_rectangles(vector<vector<int>> a) {
	N=a.size(); M=a[0].size();
	vector<vector<int>> l, r, u, d;
	for (int i=0; i<N; i++)
		l.eb(vector<int>(M, -1));
	r=u=d=l;

	for (int i=0; i<N; i++) {
		vector<int> st;
		for (int j=0; j<M; j++) {
			while (st.size()&&a[i][st.back()]<a[i][j]) st.pop_back();
			if (st.size()) H.eb(st.back(), j, i);
			st.eb(j);
		}
		st.clear();
		for (int j=M-1; j>=0; j--) {
			while (st.size()&&a[i][st.back()]<a[i][j]) st.pop_back();
			if (st.size()) H.eb(j, st.back(), i);
			st.eb(j);
		}
		st.clear();
		for (int j=0; j<M; j++) {
			while (st.size()&&a[i][st.back()]<=a[i][j]) st.pop_back();
			if (st.size()) l[i][j]=st.back();
			st.eb(j);
		}
		st.clear();
		for (int j=M-1; j>=0; j--) {
			while (st.size()&&a[i][st.back()]<=a[i][j]) st.pop_back();
			if (st.size()) r[i][j]=st.back();
			st.eb(j);
		}
	}

	for (int j=0; j<M; j++) {
		vector<int> st;
		for (int i=0; i<N; i++) {
			while (st.size()&&a[st.back()][j]<a[i][j]) st.pop_back();
			if (st.size()) V.eb(st.back(), i, j);
			st.eb(i);
		}
		st.clear();
		for (int i=N-1; i>=0; i--) {
			while (st.size()&&a[st.back()][j]<a[i][j]) st.pop_back();
			if (st.size()) V.eb(i, st.back(), j);
			st.eb(i);
		}
		st.clear();
		for (int i=0; i<N; i++) {
			while (st.size()&&a[st.back()][j]<=a[i][j]) st.pop_back();
			if (st.size()) u[i][j]=st.back();
			st.eb(i);
		}
		st.clear();
		for (int i=N-1; i>=0; i--) {
			while (st.size()&&a[st.back()][j]<=a[i][j]) st.pop_back();
			if (st.size()) d[i][j]=st.back();
			st.eb(i);
		}
	}

	sort(H.begin(), H.end());
	H.resize(unique(H.begin(), H.end())-H.begin());
	
	sort(V.begin(), V.end());
	V.resize(unique(V.begin(), V.end())-V.begin());

	vector<tuple<int, int, int, int>> A;
	for (int i=1; i<N-1; i++) for (int j=1; j<M-1; j++) {
		int L=l[i][j], R=r[i][j], U=u[i][j], D=d[i][j];
		if (L==-1||R==-1||U==-1||D==-1) continue;

		int b1=lower_bound(H.begin(), H.end(), tii(L, R, U+1))-H.begin();
		int b2=lower_bound(H.begin(), H.end(), tii(L, R, D-1))-H.begin();
		if (b1>=H.size()||tii(L, R, U+1)!=H[b1]) continue;
		if (b2>=H.size()||tii(L, R, D-1)!=H[b2]) continue;
		if (b2-b1!=D-U-2) continue;

		b1=lower_bound(V.begin(), V.end(), tii(U, D, L+1))-V.begin();
		b2=lower_bound(V.begin(), V.end(), tii(U, D, R-1))-V.begin();
		if (b1>=V.size()||tii(U, D, L+1)!=V[b1]) continue;
		if (b2>=V.size()||tii(U, D, R-1)!=V[b2]) continue;
		if (b2-b1!=R-L-2) continue;

		A.eb(L, R, U, D);
	}

	sort(A.begin(), A.end());
	return unique(A.begin(), A.end())-A.begin();
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:84:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   if (b1>=H.size()||tii(L, R, U+1)!=H[b1]) continue;
      |       ~~^~~~~~~~~~
rect.cpp:85:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   if (b2>=H.size()||tii(L, R, D-1)!=H[b2]) continue;
      |       ~~^~~~~~~~~~
rect.cpp:90:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |   if (b1>=V.size()||tii(U, D, L+1)!=V[b1]) continue;
      |       ~~^~~~~~~~~~
rect.cpp:91:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |   if (b2>=V.size()||tii(U, D, R-1)!=V[b2]) continue;
      |       ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 7 ms 1024 KB Output is correct
18 Correct 7 ms 1024 KB Output is correct
19 Correct 7 ms 1024 KB Output is correct
20 Correct 7 ms 960 KB Output is correct
21 Correct 7 ms 960 KB Output is correct
22 Correct 7 ms 960 KB Output is correct
23 Correct 7 ms 960 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 7 ms 1024 KB Output is correct
18 Correct 7 ms 1024 KB Output is correct
19 Correct 7 ms 1024 KB Output is correct
20 Correct 7 ms 960 KB Output is correct
21 Correct 7 ms 960 KB Output is correct
22 Correct 7 ms 960 KB Output is correct
23 Correct 7 ms 960 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 56 ms 4964 KB Output is correct
26 Correct 48 ms 5068 KB Output is correct
27 Correct 49 ms 5092 KB Output is correct
28 Correct 37 ms 4596 KB Output is correct
29 Correct 45 ms 4724 KB Output is correct
30 Correct 46 ms 4852 KB Output is correct
31 Correct 47 ms 4852 KB Output is correct
32 Correct 46 ms 4852 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 7 ms 1024 KB Output is correct
18 Correct 7 ms 1024 KB Output is correct
19 Correct 7 ms 1024 KB Output is correct
20 Correct 7 ms 960 KB Output is correct
21 Correct 7 ms 960 KB Output is correct
22 Correct 7 ms 960 KB Output is correct
23 Correct 7 ms 960 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 56 ms 4964 KB Output is correct
26 Correct 48 ms 5068 KB Output is correct
27 Correct 49 ms 5092 KB Output is correct
28 Correct 37 ms 4596 KB Output is correct
29 Correct 45 ms 4724 KB Output is correct
30 Correct 46 ms 4852 KB Output is correct
31 Correct 47 ms 4852 KB Output is correct
32 Correct 46 ms 4852 KB Output is correct
33 Correct 267 ms 42240 KB Output is correct
34 Correct 250 ms 42304 KB Output is correct
35 Correct 259 ms 42180 KB Output is correct
36 Correct 213 ms 42180 KB Output is correct
37 Correct 681 ms 54060 KB Output is correct
38 Correct 687 ms 54064 KB Output is correct
39 Correct 716 ms 54004 KB Output is correct
40 Correct 642 ms 51372 KB Output is correct
41 Correct 453 ms 42952 KB Output is correct
42 Correct 501 ms 42952 KB Output is correct
43 Correct 641 ms 43600 KB Output is correct
44 Correct 654 ms 45128 KB Output is correct
45 Correct 313 ms 23000 KB Output is correct
46 Correct 354 ms 23004 KB Output is correct
47 Correct 698 ms 45616 KB Output is correct
48 Correct 693 ms 45916 KB Output is correct
49 Correct 0 ms 256 KB Output is correct
50 Correct 1 ms 256 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 960 KB Output is correct
2 Correct 5 ms 948 KB Output is correct
3 Correct 3 ms 960 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 4 ms 896 KB Output is correct
6 Correct 4 ms 896 KB Output is correct
7 Correct 4 ms 896 KB Output is correct
8 Correct 4 ms 968 KB Output is correct
9 Correct 4 ms 896 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 3 ms 768 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3029 ms 238284 KB Output is correct
3 Execution timed out 5061 ms 496964 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 7 ms 1024 KB Output is correct
18 Correct 7 ms 1024 KB Output is correct
19 Correct 7 ms 1024 KB Output is correct
20 Correct 7 ms 960 KB Output is correct
21 Correct 7 ms 960 KB Output is correct
22 Correct 7 ms 960 KB Output is correct
23 Correct 7 ms 960 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 56 ms 4964 KB Output is correct
26 Correct 48 ms 5068 KB Output is correct
27 Correct 49 ms 5092 KB Output is correct
28 Correct 37 ms 4596 KB Output is correct
29 Correct 45 ms 4724 KB Output is correct
30 Correct 46 ms 4852 KB Output is correct
31 Correct 47 ms 4852 KB Output is correct
32 Correct 46 ms 4852 KB Output is correct
33 Correct 267 ms 42240 KB Output is correct
34 Correct 250 ms 42304 KB Output is correct
35 Correct 259 ms 42180 KB Output is correct
36 Correct 213 ms 42180 KB Output is correct
37 Correct 681 ms 54060 KB Output is correct
38 Correct 687 ms 54064 KB Output is correct
39 Correct 716 ms 54004 KB Output is correct
40 Correct 642 ms 51372 KB Output is correct
41 Correct 453 ms 42952 KB Output is correct
42 Correct 501 ms 42952 KB Output is correct
43 Correct 641 ms 43600 KB Output is correct
44 Correct 654 ms 45128 KB Output is correct
45 Correct 313 ms 23000 KB Output is correct
46 Correct 354 ms 23004 KB Output is correct
47 Correct 698 ms 45616 KB Output is correct
48 Correct 693 ms 45916 KB Output is correct
49 Correct 5 ms 960 KB Output is correct
50 Correct 5 ms 948 KB Output is correct
51 Correct 3 ms 960 KB Output is correct
52 Correct 1 ms 256 KB Output is correct
53 Correct 4 ms 896 KB Output is correct
54 Correct 4 ms 896 KB Output is correct
55 Correct 4 ms 896 KB Output is correct
56 Correct 4 ms 968 KB Output is correct
57 Correct 4 ms 896 KB Output is correct
58 Correct 1 ms 512 KB Output is correct
59 Correct 3 ms 768 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 3029 ms 238284 KB Output is correct
62 Execution timed out 5061 ms 496964 KB Time limit exceeded
63 Halted 0 ms 0 KB -