oj.uz

답안 #145193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
145193 2019-08-19T08:39:59 Z ecnerwala Rectangles (IOI19_rect) C++14
100 / 100
 1495 ms 176504 KB 
#include "rect.h"

#include<bits/stdc++.h>
using namespace std;

using ll = long long;

ll count_rectangles(vector<vector<int>> G) {
	int N = int(G.size()) - 1;
	int M = int(G[0].size()) - 1;

	if (N <= 1 || M <= 1) return 0;

	vector<stack<int>> stacks(M);
	for (int j = 1; j < M; j++) {
		if (G[0][j] > G[1][j]) {
			stacks[j].push(0);
		}
		stacks[j].push(1);
	}

	vector<vector<pair<int, int>>> history(M, vector<pair<int, int>>(M, pair<int, int>(-1, -1)));

	ll ans = 0;

	for (int i = 1; i < N; i++) {
		stack<pair<int, vector<int>>> s;
		s.emplace(0, vector<int>());
		for (int j = 1; j <= M; j++) {
			vector<int> curSet;
			bool initialized = false;

			auto merge = [&](const vector<int>& v) {
				if (!initialized) {
					curSet = v;
					initialized = true;
					return;
				}
				vector<int> nCurSet;
				set_intersection(curSet.begin(), curSet.end(), v.begin(), v.end(), back_inserter(nCurSet));
				curSet = std::move(nCurSet);
			};

			while (!s.empty() && G[i][j] >= G[i][s.top().first]) {
				merge(s.top().second);
				if (G[i][j] > G[i][s.top().first]) {
					s.pop();
					if (!s.empty()) {
						int l = s.top().first + 1;
						int r = j-1;
						if (history[l][r].second != i-1) {
							history[l][r].first = i;
						}
						history[l][r].second = i;
						//cerr << i << ' ' << l << ' ' << r << ' ' << history[l][r].first << '\n';
						//for (auto it : curSet) { cerr << it << ' '; } cerr << '\n';

						assert(initialized);
						int numGood = int(curSet.end() - lower_bound(curSet.begin(), curSet.end(), history[l][r].first));
						//cerr << numGood << '\n';
						ans += numGood;
					}
				} else {
					s.pop();
				}
			}
			if (j == M) break;
			vector<int> heights;
			{ // build heights
				while (!stacks[j].empty() && G[i+1][j] >= G[stacks[j].top()][j]){
					if (G[i+1][j] > G[stacks[j].top()][j]) {
						stacks[j].pop();
						if (!stacks[j].empty()) {
							heights.push_back(stacks[j].top()+1);
						}
					} else {
						stacks[j].pop();
					}
				}
				stacks[j].push(i+1);
			}
			reverse(heights.begin(), heights.end());
			merge(heights);
			s.emplace(j, std::move(curSet));
		}
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 252 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 476 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 420 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 252 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 476 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 420 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 6 ms 1400 KB Output is correct
26 Correct 6 ms 1528 KB Output is correct
27 Correct 6 ms 1528 KB Output is correct
28 Correct 7 ms 1144 KB Output is correct
29 Correct 10 ms 1320 KB Output is correct
30 Correct 10 ms 1400 KB Output is correct
31 Correct 10 ms 1272 KB Output is correct
32 Correct 10 ms 1412 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 252 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 476 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 420 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 6 ms 1400 KB Output is correct
26 Correct 6 ms 1528 KB Output is correct
27 Correct 6 ms 1528 KB Output is correct
28 Correct 7 ms 1144 KB Output is correct
29 Correct 10 ms 1320 KB Output is correct
30 Correct 10 ms 1400 KB Output is correct
31 Correct 10 ms 1272 KB Output is correct
32 Correct 10 ms 1412 KB Output is correct
33 Correct 47 ms 12152 KB Output is correct
34 Correct 42 ms 12140 KB Output is correct
35 Correct 54 ms 12524 KB Output is correct
36 Correct 62 ms 12512 KB Output is correct
37 Correct 55 ms 14196 KB Output is correct
38 Correct 54 ms 14200 KB Output is correct
39 Correct 56 ms 14568 KB Output is correct
40 Correct 54 ms 14072 KB Output is correct
41 Correct 51 ms 9464 KB Output is correct
42 Correct 58 ms 9448 KB Output is correct
43 Correct 95 ms 10360 KB Output is correct
44 Correct 105 ms 11812 KB Output is correct
45 Correct 50 ms 5292 KB Output is correct
46 Correct 54 ms 6648 KB Output is correct
47 Correct 96 ms 8568 KB Output is correct
48 Correct 99 ms 8568 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 252 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 51196 KB Output is correct
2 Correct 35 ms 37336 KB Output is correct
3 Correct 46 ms 50988 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 48 ms 51028 KB Output is correct
6 Correct 47 ms 51064 KB Output is correct
7 Correct 47 ms 51064 KB Output is correct
8 Correct 49 ms 51064 KB Output is correct
9 Correct 50 ms 51152 KB Output is correct
10 Correct 0 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 358 ms 66692 KB Output is correct
3 Correct 718 ms 100108 KB Output is correct
4 Correct 727 ms 112344 KB Output is correct
5 Correct 750 ms 112368 KB Output is correct
6 Correct 206 ms 81332 KB Output is correct
7 Correct 352 ms 102640 KB Output is correct
8 Correct 380 ms 112504 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 292 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 476 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 420 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 6 ms 1400 KB Output is correct
26 Correct 6 ms 1528 KB Output is correct
27 Correct 6 ms 1528 KB Output is correct
28 Correct 7 ms 1144 KB Output is correct
29 Correct 10 ms 1320 KB Output is correct
30 Correct 10 ms 1400 KB Output is correct
31 Correct 10 ms 1272 KB Output is correct
32 Correct 10 ms 1412 KB Output is correct
33 Correct 47 ms 12152 KB Output is correct
34 Correct 42 ms 12140 KB Output is correct
35 Correct 54 ms 12524 KB Output is correct
36 Correct 62 ms 12512 KB Output is correct
37 Correct 55 ms 14196 KB Output is correct
38 Correct 54 ms 14200 KB Output is correct
39 Correct 56 ms 14568 KB Output is correct
40 Correct 54 ms 14072 KB Output is correct
41 Correct 51 ms 9464 KB Output is correct
42 Correct 58 ms 9448 KB Output is correct
43 Correct 95 ms 10360 KB Output is correct
44 Correct 105 ms 11812 KB Output is correct
45 Correct 50 ms 5292 KB Output is correct
46 Correct 54 ms 6648 KB Output is correct
47 Correct 96 ms 8568 KB Output is correct
48 Correct 99 ms 8568 KB Output is correct
49 Correct 47 ms 51196 KB Output is correct
50 Correct 35 ms 37336 KB Output is correct
51 Correct 46 ms 50988 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 48 ms 51028 KB Output is correct
54 Correct 47 ms 51064 KB Output is correct
55 Correct 47 ms 51064 KB Output is correct
56 Correct 49 ms 51064 KB Output is correct
57 Correct 50 ms 51152 KB Output is correct
58 Correct 0 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 256 KB Output is correct
61 Correct 358 ms 66692 KB Output is correct
62 Correct 718 ms 100108 KB Output is correct
63 Correct 727 ms 112344 KB Output is correct
64 Correct 750 ms 112368 KB Output is correct
65 Correct 206 ms 81332 KB Output is correct
66 Correct 352 ms 102640 KB Output is correct
67 Correct 380 ms 112504 KB Output is correct
68 Correct 670 ms 106964 KB Output is correct
69 Correct 563 ms 131472 KB Output is correct
70 Correct 894 ms 159480 KB Output is correct
71 Correct 942 ms 159608 KB Output is correct
72 Correct 862 ms 176392 KB Output is correct
73 Correct 870 ms 94188 KB Output is correct
74 Correct 869 ms 74024 KB Output is correct
75 Correct 1463 ms 122896 KB Output is correct
76 Correct 933 ms 109304 KB Output is correct
77 Correct 1174 ms 110684 KB Output is correct
78 Correct 1495 ms 147960 KB Output is correct
79 Correct 832 ms 102224 KB Output is correct
80 Correct 1394 ms 148164 KB Output is correct
81 Correct 1366 ms 145496 KB Output is correct
82 Correct 480 ms 94072 KB Output is correct
83 Correct 858 ms 176248 KB Output is correct
84 Correct 855 ms 176320 KB Output is correct
85 Correct 859 ms 176504 KB Output is correct
86 Correct 2 ms 256 KB Output is correct
87 Correct 2 ms 252 KB Output is correct
88 Correct 2 ms 376 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 256 KB Output is correct