oj.uz

Submission #153545

# Submission time Handle Problem Language Result Execution time Memory
153545 2019-09-14T15:24:00 Z myungwoo Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 548352 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;
	}
};

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++) horizontal.pb({hor[i][j].fr, hor[i][j].sc, i});
	}
	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++) vertical.pb({ver[i][j].fr, ver[i][j].sc, j});
	}

	sort(all(horizontal));
	sort(all(vertical));
	for (int i=0,j=0;i<sz(horizontal);i++){
		auto &sg = horizontal[i]; sg.dp = 1;
		while (horizontal[j] < SEGMENT{sg.a, sg.b, sg.t-1}) j++;
		if (horizontal[j] == SEGMENT{sg.a, sg.b, sg.t-1}) sg.dp = horizontal[j].dp+1;
	}
	for (int i=0,j=0;i<sz(vertical);i++){
		auto &sg = vertical[i]; sg.dp = 1;
		while (vertical[j] < SEGMENT{sg.a, sg.b, sg.t-1}) j++;
		if (vertical[j] == SEGMENT{sg.a, sg.b, sg.t-1}) sg.dp = vertical[j].dp+1;
	}

	set <tuple<int, int, int, int>> vis;
	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 tp = make_tuple(sy, sx, ey, ex);
		if (vis.count(tp)) 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;
		}
		vis.insert(tp);
	}
	return sz(vis);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 3 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 764 KB Output is correct
8 Correct 3 ms 476 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 764 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 760 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 380 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 3 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 764 KB Output is correct
8 Correct 3 ms 476 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 764 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 2040 KB Output is correct
18 Correct 7 ms 2168 KB Output is correct
19 Correct 7 ms 2172 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 7 ms 1788 KB Output is correct
22 Correct 7 ms 1868 KB Output is correct
23 Correct 7 ms 1912 KB Output is correct
24 Correct 5 ms 1528 KB Output is correct
25 Correct 2 ms 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 760 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 380 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 3 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 764 KB Output is correct
8 Correct 3 ms 476 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 764 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 2040 KB Output is correct
18 Correct 7 ms 2168 KB Output is correct
19 Correct 7 ms 2172 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 7 ms 1788 KB Output is correct
22 Correct 7 ms 1868 KB Output is correct
23 Correct 7 ms 1912 KB Output is correct
24 Correct 5 ms 1528 KB Output is correct
25 Correct 40 ms 7856 KB Output is correct
26 Correct 41 ms 7740 KB Output is correct
27 Correct 41 ms 7920 KB Output is correct
28 Correct 25 ms 5996 KB Output is correct
29 Correct 33 ms 6128 KB Output is correct
30 Correct 34 ms 6256 KB Output is correct
31 Correct 32 ms 6256 KB Output is correct
32 Correct 32 ms 6248 KB Output is correct
33 Correct 2 ms 380 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 760 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 380 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 3 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 764 KB Output is correct
8 Correct 3 ms 476 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 764 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 2040 KB Output is correct
18 Correct 7 ms 2168 KB Output is correct
19 Correct 7 ms 2172 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 7 ms 1788 KB Output is correct
22 Correct 7 ms 1868 KB Output is correct
23 Correct 7 ms 1912 KB Output is correct
24 Correct 5 ms 1528 KB Output is correct
25 Correct 40 ms 7856 KB Output is correct
26 Correct 41 ms 7740 KB Output is correct
27 Correct 41 ms 7920 KB Output is correct
28 Correct 25 ms 5996 KB Output is correct
29 Correct 33 ms 6128 KB Output is correct
30 Correct 34 ms 6256 KB Output is correct
31 Correct 32 ms 6256 KB Output is correct
32 Correct 32 ms 6248 KB Output is correct
33 Correct 170 ms 43600 KB Output is correct
34 Correct 158 ms 43860 KB Output is correct
35 Correct 152 ms 43600 KB Output is correct
36 Correct 154 ms 43592 KB Output is correct
37 Correct 572 ms 71444 KB Output is correct
38 Correct 571 ms 71352 KB Output is correct
39 Correct 574 ms 71636 KB Output is correct
40 Correct 539 ms 67244 KB Output is correct
41 Correct 275 ms 41424 KB Output is correct
42 Correct 309 ms 41568 KB Output is correct
43 Correct 450 ms 50028 KB Output is correct
44 Correct 457 ms 51832 KB Output is correct
45 Correct 219 ms 30300 KB Output is correct
46 Correct 214 ms 26124 KB Output is correct
47 Correct 433 ms 50788 KB Output is correct
48 Correct 443 ms 51888 KB Output is correct
49 Correct 2 ms 380 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 760 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 6 ms 1016 KB Output is correct
2 Correct 5 ms 888 KB Output is correct
3 Correct 4 ms 888 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 492 KB Output is correct
11 Correct 4 ms 760 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2001 ms 196848 KB Output is correct
3 Correct 4582 ms 405976 KB Output is correct
4 Correct 4662 ms 407268 KB Output is correct
5 Correct 4697 ms 407252 KB Output is correct
6 Correct 833 ms 202424 KB Output is correct
7 Correct 1706 ms 397520 KB Output is correct
8 Correct 1809 ms 407304 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 760 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 380 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 3 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 764 KB Output is correct
8 Correct 3 ms 476 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 764 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 2040 KB Output is correct
18 Correct 7 ms 2168 KB Output is correct
19 Correct 7 ms 2172 KB Output is correct
20 Correct 6 ms 1784 KB Output is correct
21 Correct 7 ms 1788 KB Output is correct
22 Correct 7 ms 1868 KB Output is correct
23 Correct 7 ms 1912 KB Output is correct
24 Correct 5 ms 1528 KB Output is correct
25 Correct 40 ms 7856 KB Output is correct
26 Correct 41 ms 7740 KB Output is correct
27 Correct 41 ms 7920 KB Output is correct
28 Correct 25 ms 5996 KB Output is correct
29 Correct 33 ms 6128 KB Output is correct
30 Correct 34 ms 6256 KB Output is correct
31 Correct 32 ms 6256 KB Output is correct
32 Correct 32 ms 6248 KB Output is correct
33 Correct 170 ms 43600 KB Output is correct
34 Correct 158 ms 43860 KB Output is correct
35 Correct 152 ms 43600 KB Output is correct
36 Correct 154 ms 43592 KB Output is correct
37 Correct 572 ms 71444 KB Output is correct
38 Correct 571 ms 71352 KB Output is correct
39 Correct 574 ms 71636 KB Output is correct
40 Correct 539 ms 67244 KB Output is correct
41 Correct 275 ms 41424 KB Output is correct
42 Correct 309 ms 41568 KB Output is correct
43 Correct 450 ms 50028 KB Output is correct
44 Correct 457 ms 51832 KB Output is correct
45 Correct 219 ms 30300 KB Output is correct
46 Correct 214 ms 26124 KB Output is correct
47 Correct 433 ms 50788 KB Output is correct
48 Correct 443 ms 51888 KB Output is correct
49 Correct 6 ms 1016 KB Output is correct
50 Correct 5 ms 888 KB Output is correct
51 Correct 4 ms 888 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 492 KB Output is correct
59 Correct 4 ms 760 KB Output is correct
60 Correct 2 ms 504 KB Output is correct
61 Correct 2001 ms 196848 KB Output is correct
62 Correct 4582 ms 405976 KB Output is correct
63 Correct 4662 ms 407268 KB Output is correct
64 Correct 4697 ms 407252 KB Output is correct
65 Correct 833 ms 202424 KB Output is correct
66 Correct 1706 ms 397520 KB Output is correct
67 Correct 1809 ms 407304 KB Output is correct
68 Correct 2649 ms 441780 KB Output is correct
69 Correct 2368 ms 441764 KB Output is correct
70 Correct 2346 ms 441728 KB Output is correct
71 Correct 2073 ms 441760 KB Output is correct
72 Execution timed out 5089 ms 548352 KB Time limit exceeded
73 Halted 0 ms 0 KB -