oj.uz

Submission #153569

# Submission time Handle Problem Language Result Execution time Memory
153569 2019-09-14T15:57:38 Z myungwoo Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 499044 KB 
#include <bits/stdc++.h>
#include "rect.h"
using namespace std;

#define fr first
#define sc second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
typedef long long lld;
typedef pair<int, int> pii;

int N, M;
int A[2502][2502];
pii ver[2502][2502], hor[2502][2502];

struct SEGMENT {
	int a, b, t, dp;
	bool operator < (const SEGMENT &ot)const{
		if (t != ot.t) return t < ot.t;
		if (a != ot.a) return a < ot.a;
		return b < ot.b;
	}
	bool operator == (const SEGMENT &ot)const{
		return a == ot.a && b == ot.b && t == ot.t;
	}
	bool operator != (const SEGMENT &ot)const{
		return a != ot.a || b != ot.b || t != ot.t;
	}
};

struct RECT {
	int a, b, c, d;
	bool operator < (const RECT &ot)const{
		if (a != ot.a) return a < ot.a;
		if (b != ot.b) return b < ot.b;
		if (c != ot.c) return c < ot.c;
		return d < ot.d;
	}
	bool operator != (const RECT &ot)const{
		return a != ot.a || b != ot.b || c != ot.c || d != ot.d;
	}
};

template<typename T>
typename vector<T>::iterator _lower_bound(typename vector<T>::iterator st, typename vector<T>::iterator ed, T v)
{
	int n = ed-st;
	int s = 0, e = n-1;
	while (s <= e){
		int m = s+e >> 1;
		if (*(st+m) < v) s = m+1;
		else e = m-1;
	}
	return st+s;
}

lld count_rectangles(vector<vector<int> > a)
{
	N = sz(a); M = sz(a[0]);
	for (int i=1;i<=N;i++) for (int j=1;j<=M;j++) A[i][j] = a[i-1][j-1];
	vector <SEGMENT> vertical, horizontal;
	for (int i=1;i<=N;i++){
		{
			stack <int> stk;
			for (int j=1;j<=M;j++){
				while (!stk.empty() && A[i][stk.top()] <= A[i][j]) stk.pop();
				hor[i][j].fr = stk.empty() ? 1 : stk.top()+1;
				stk.push(j);
			}
		}
		{
			stack <int> stk;
			for (int j=M;j;j--){
				while (!stk.empty() && A[i][stk.top()] <= A[i][j]) stk.pop();
				hor[i][j].sc = stk.empty() ? M : stk.top()-1;
				stk.push(j);
			}
		}
	}
	for (int j=1;j<=M;j++){
		{
			stack <int> stk;
			for (int i=1;i<=N;i++){
				while (!stk.empty() && A[stk.top()][j] <= A[i][j]) stk.pop();
				ver[i][j].fr = stk.empty() ? 1 : stk.top()+1;
				stk.push(i);
			}
		}
		{
			stack <int> stk;
			for (int i=N;i;i--){
				while (!stk.empty() && A[stk.top()][j] <= A[i][j]) stk.pop();
				ver[i][j].sc = stk.empty() ? N : stk.top()-1;
				stk.push(i);
			}
		}
	}

	for (int i=1;i<=N;i++) for (int j=1;j<=M;j++){
		horizontal.pb({hor[i][j].fr, hor[i][j].sc, i});
		vertical.pb({ver[i][j].fr, ver[i][j].sc, j});
	}

	sort(all(horizontal));
	sort(all(vertical));
	for (auto i=horizontal.begin(),j=i;i!=horizontal.end();i++){
		while (*j < SEGMENT{i->a, i->b, i->t-1}) j++;
		if (*j == SEGMENT{i->a, i->b, i->t-1}) i->dp = j->dp+1;
		else i->dp = 1;
	}
	for (auto i=vertical.begin(),j=i;i!=vertical.end();i++){
		while (*j < SEGMENT{i->a, i->b, i->t-1}) j++;
		if (*j == SEGMENT{i->a, i->b, i->t-1}) i->dp = j->dp+1;
		else i->dp = 1;
	}

	vector <RECT> rects;
	for (int i=1;i<=N;i++) for (int j=1;j<=M;j++){
		int sy = ver[i][j].fr, ey = ver[i][j].sc;
		int sx = hor[i][j].fr, ex = hor[i][j].sc;

		if (sy == 1 || sx == 1 || ey == N || ex == M) continue;
		{
			auto it = _lower_bound(all(vertical), SEGMENT{sy, ey, ex});
			if (it == vertical.end() || *it != SEGMENT{sy, ey, ex} || it->dp <= ex-sx) continue;
		}
		{
			auto it = _lower_bound(all(horizontal), SEGMENT{sx, ex, ey});
			if (it == horizontal.end() || *it != SEGMENT{sx, ex, ey} || it->dp <= ey-sy) continue;
		}
		rects.pb({sy, sx, ey, ex});
	}
	sort(all(rects));
	int ans = 0;
	for (int i=0;i<sz(rects);i++) if (i == 0 || rects[i-1] != rects[i]) ans++;
	return ans;
}

Compilation message

rect.cpp: In instantiation of 'typename std::vector<_Tp>::iterator _lower_bound(typename std::vector<_Tp>::iterator, typename std::vector<_Tp>::iterator, T) [with T = SEGMENT; typename std::vector<_Tp>::iterator = __gnu_cxx::__normal_iterator<SEGMENT*, std::vector<SEGMENT> >]':
rect.cpp:125:61:   required from here
rect.cpp:51:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = s+e >> 1;
           ~^~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 732 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1912 KB Output is correct
18 Correct 5 ms 1912 KB Output is correct
19 Correct 5 ms 1912 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 6 ms 1784 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 380 KB Output is correct
27 Correct 3 ms 732 KB Output is correct
28 Correct 2 ms 760 KB Output is correct
29 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 732 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1912 KB Output is correct
18 Correct 5 ms 1912 KB Output is correct
19 Correct 5 ms 1912 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 6 ms 1784 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 23 ms 6716 KB Output is correct
26 Correct 22 ms 6624 KB Output is correct
27 Correct 23 ms 6624 KB Output is correct
28 Correct 23 ms 5740 KB Output is correct
29 Correct 28 ms 5612 KB Output is correct
30 Correct 29 ms 5612 KB Output is correct
31 Correct 29 ms 5856 KB Output is correct
32 Correct 28 ms 5568 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 380 KB Output is correct
35 Correct 3 ms 732 KB Output is correct
36 Correct 2 ms 760 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 732 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1912 KB Output is correct
18 Correct 5 ms 1912 KB Output is correct
19 Correct 5 ms 1912 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 6 ms 1784 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 23 ms 6716 KB Output is correct
26 Correct 22 ms 6624 KB Output is correct
27 Correct 23 ms 6624 KB Output is correct
28 Correct 23 ms 5740 KB Output is correct
29 Correct 28 ms 5612 KB Output is correct
30 Correct 29 ms 5612 KB Output is correct
31 Correct 29 ms 5856 KB Output is correct
32 Correct 28 ms 5568 KB Output is correct
33 Correct 176 ms 37820 KB Output is correct
34 Correct 171 ms 37884 KB Output is correct
35 Correct 177 ms 37924 KB Output is correct
36 Correct 165 ms 37992 KB Output is correct
37 Correct 269 ms 49876 KB Output is correct
38 Correct 284 ms 49916 KB Output is correct
39 Correct 270 ms 50056 KB Output is correct
40 Correct 255 ms 47576 KB Output is correct
41 Correct 236 ms 38532 KB Output is correct
42 Correct 273 ms 39728 KB Output is correct
43 Correct 358 ms 44356 KB Output is correct
44 Correct 362 ms 44404 KB Output is correct
45 Correct 177 ms 26568 KB Output is correct
46 Correct 172 ms 22600 KB Output is correct
47 Correct 372 ms 45584 KB Output is correct
48 Correct 371 ms 45456 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 380 KB Output is correct
51 Correct 3 ms 732 KB Output is correct
52 Correct 2 ms 760 KB Output is correct
53 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 888 KB Output is correct
2 Correct 4 ms 888 KB Output is correct
3 Correct 5 ms 1016 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 5 ms 1016 KB Output is correct
6 Correct 6 ms 1016 KB Output is correct
7 Correct 5 ms 1016 KB Output is correct
8 Correct 5 ms 888 KB Output is correct
9 Correct 5 ms 1016 KB Output is correct
10 Correct 3 ms 636 KB Output is correct
11 Correct 5 ms 888 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1572 ms 182020 KB Output is correct
3 Correct 3604 ms 378932 KB Output is correct
4 Correct 3703 ms 380668 KB Output is correct
5 Correct 3650 ms 380720 KB Output is correct
6 Correct 929 ms 183832 KB Output is correct
7 Correct 1891 ms 366004 KB Output is correct
8 Correct 1977 ms 369280 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 3 ms 732 KB Output is correct
12 Correct 2 ms 760 KB Output is correct
13 Correct 2 ms 376 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 732 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 1912 KB Output is correct
18 Correct 5 ms 1912 KB Output is correct
19 Correct 5 ms 1912 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 6 ms 1784 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 23 ms 6716 KB Output is correct
26 Correct 22 ms 6624 KB Output is correct
27 Correct 23 ms 6624 KB Output is correct
28 Correct 23 ms 5740 KB Output is correct
29 Correct 28 ms 5612 KB Output is correct
30 Correct 29 ms 5612 KB Output is correct
31 Correct 29 ms 5856 KB Output is correct
32 Correct 28 ms 5568 KB Output is correct
33 Correct 176 ms 37820 KB Output is correct
34 Correct 171 ms 37884 KB Output is correct
35 Correct 177 ms 37924 KB Output is correct
36 Correct 165 ms 37992 KB Output is correct
37 Correct 269 ms 49876 KB Output is correct
38 Correct 284 ms 49916 KB Output is correct
39 Correct 270 ms 50056 KB Output is correct
40 Correct 255 ms 47576 KB Output is correct
41 Correct 236 ms 38532 KB Output is correct
42 Correct 273 ms 39728 KB Output is correct
43 Correct 358 ms 44356 KB Output is correct
44 Correct 362 ms 44404 KB Output is correct
45 Correct 177 ms 26568 KB Output is correct
46 Correct 172 ms 22600 KB Output is correct
47 Correct 372 ms 45584 KB Output is correct
48 Correct 371 ms 45456 KB Output is correct
49 Correct 5 ms 888 KB Output is correct
50 Correct 4 ms 888 KB Output is correct
51 Correct 5 ms 1016 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 5 ms 1016 KB Output is correct
54 Correct 6 ms 1016 KB Output is correct
55 Correct 5 ms 1016 KB Output is correct
56 Correct 5 ms 888 KB Output is correct
57 Correct 5 ms 1016 KB Output is correct
58 Correct 3 ms 636 KB Output is correct
59 Correct 5 ms 888 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 1572 ms 182020 KB Output is correct
62 Correct 3604 ms 378932 KB Output is correct
63 Correct 3703 ms 380668 KB Output is correct
64 Correct 3650 ms 380720 KB Output is correct
65 Correct 929 ms 183832 KB Output is correct
66 Correct 1891 ms 366004 KB Output is correct
67 Correct 1977 ms 369280 KB Output is correct
68 Correct 2823 ms 369128 KB Output is correct
69 Correct 2589 ms 369356 KB Output is correct
70 Correct 2748 ms 369140 KB Output is correct
71 Correct 2458 ms 369288 KB Output is correct
72 Correct 4075 ms 499044 KB Output is correct
73 Correct 3153 ms 269964 KB Output is correct
74 Correct 3339 ms 310412 KB Output is correct
75 Execution timed out 5106 ms 416904 KB Time limit exceeded
76 Halted 0 ms 0 KB -