oj.uz

Submission #585497

# Submission time Handle Problem Language Result Execution time Memory
585497 2022-06-29T02:44:44 Z 8e7 Rectangles (IOI19_rect) C++17
100 / 100
 1958 ms 101128 KB 
#include "rect.h"
//Challenge: Accepted
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 2505
#define mod 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
struct BIT{
	vector<int> ch;
	int bit[maxn];
	void modify(int ind) {
		ind++;
		ch.push_back(ind);
		for (;ind < maxn;ind += ind & (-ind)) bit[ind]++;
	}
	int query(int ind) {
		ind++;
		int ret = 0;
		for (;ind > 0;ind -= ind & (-ind)) ret += bit[ind];
		return ret;
	}
	void undo() {
		for (int ind:ch) {
			for (;ind < maxn;ind += ind & (-ind)) bit[ind]--;
		}
		ch.clear();
	}
} bit;
long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = a.size(), m = a[0].size();	
	ll ret = 0;

	vector<vector<pii> > row(m);
	vector<vector<int> > stk(m);

	auto merge = [&] (vector<pii> &vec, vector<pii> &prv) { //merges prv to vec
		int ind = 0;	
		for (auto &[f, s]:vec) {
			while (ind < prv.size() && prv[ind].ff > f) ind++;
			if (ind < prv.size() && prv[ind].ff == f) s = prv[ind].ss;
		}
		prv = vec;
		vec.clear();
	};
	for (int i = 0;i < n;i++) {
		vector<int> cstk; //col stack
		vector<pii> col;
		for (int j = 0;j < m;j++) {
			{
				vector<pii> to;
				vector<int> &s = cstk;
				int prv = -1;
				while (s.size() && a[i][j] >= a[i][s.back()]) {
					int v = a[i][s.back()];
					to.push_back({s.back(), i});	
					prv = v;
					s.pop_back();
				}
				if (prv < a[i][j] && s.size()) {
					to.push_back({s.back(), i});
				}
				s.push_back(j);

				merge(to, row[j]);

			}

			{
				vector<pii> to;
				vector<int> &s = stk[j];
				int prv = -1;
				while (s.size() && a[i][j] >= a[s.back()][j]) {
					int v = a[s.back()][j];
					to.push_back({s.back(), j});	
					prv = v;
					s.pop_back();
				}
				if (prv < a[i][j] && s.size()) {
					to.push_back({s.back(), j});
				}
				s.push_back(i);
				merge(to, col);
			}

			if (j < m-1) {
				vector<pii> orig = col;
				sort(col.begin(), col.end(), [&] (pii p, pii q){return p.ss > q.ss;});
				int ind = 0;
				debug(i, j);
				for (auto q:col) {
					while (ind < row[j+1].size() && row[j+1][ind].ff+1 >= q.ss) {
						//debug("mod", col[ind].ff);
						if (row[j+1][ind].ff < j) bit.modify(row[j+1][ind].ss);
						ind++;
					}
					if (q.ff < i-1) {
						debug(q.ff, q.ss, bit.query(q.ff+1));
						ret += bit.query(q.ff+1);
					}
				}
				bit.undo();
				col = orig;
			}
		}
	}
	return ret;
}

Compilation message

rect.cpp: In lambda function:
rect.cpp:55:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |    while (ind < prv.size() && prv[ind].ff > f) ind++;
      |           ~~~~^~~~~~~~~~~~
rect.cpp:56:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |    if (ind < prv.size() && prv[ind].ff == f) s = prv[ind].ss;
      |        ~~~~^~~~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
rect.cpp:105:5: note: in expansion of macro 'debug'
  105 |     debug(i, j);
      |     ^~~~~
rect.cpp:107:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |      while (ind < row[j+1].size() && row[j+1][ind].ff+1 >= q.ss) {
      |             ~~~~^~~~~~~~~~~~~~~~~
rect.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
rect.cpp:113:7: note: in expansion of macro 'debug'
  113 |       debug(q.ff, q.ss, bit.query(q.ff+1));
      |       ^~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 12 ms 1108 KB Output is correct
31 Correct 10 ms 996 KB Output is correct
32 Correct 13 ms 1184 KB Output is correct
33 Correct 8 ms 740 KB Output is correct
34 Correct 12 ms 724 KB Output is correct
35 Correct 13 ms 964 KB Output is correct
36 Correct 12 ms 960 KB Output is correct
37 Correct 12 ms 980 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 12 ms 1108 KB Output is correct
26 Correct 10 ms 996 KB Output is correct
27 Correct 13 ms 1184 KB Output is correct
28 Correct 8 ms 740 KB Output is correct
29 Correct 12 ms 724 KB Output is correct
30 Correct 13 ms 964 KB Output is correct
31 Correct 12 ms 960 KB Output is correct
32 Correct 12 ms 980 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 86 ms 11488 KB Output is correct
39 Correct 106 ms 8868 KB Output is correct
40 Correct 100 ms 10684 KB Output is correct
41 Correct 93 ms 8348 KB Output is correct
42 Correct 112 ms 10404 KB Output is correct
43 Correct 112 ms 10316 KB Output is correct
44 Correct 113 ms 10712 KB Output is correct
45 Correct 107 ms 10400 KB Output is correct
46 Correct 105 ms 5204 KB Output is correct
47 Correct 94 ms 5212 KB Output is correct
48 Correct 139 ms 6152 KB Output is correct
49 Correct 150 ms 8108 KB Output is correct
50 Correct 81 ms 4080 KB Output is correct
51 Correct 79 ms 4308 KB Output is correct
52 Correct 138 ms 7116 KB Output is correct
53 Correct 151 ms 8140 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 556 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 481 ms 27752 KB Output is correct
8 Correct 977 ms 54028 KB Output is correct
9 Correct 1025 ms 52364 KB Output is correct
10 Correct 1002 ms 52416 KB Output is correct
11 Correct 314 ms 27320 KB Output is correct
12 Correct 648 ms 49172 KB Output is correct
13 Correct 636 ms 52364 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 12 ms 1108 KB Output is correct
26 Correct 10 ms 996 KB Output is correct
27 Correct 13 ms 1184 KB Output is correct
28 Correct 8 ms 740 KB Output is correct
29 Correct 12 ms 724 KB Output is correct
30 Correct 13 ms 964 KB Output is correct
31 Correct 12 ms 960 KB Output is correct
32 Correct 12 ms 980 KB Output is correct
33 Correct 86 ms 11488 KB Output is correct
34 Correct 106 ms 8868 KB Output is correct
35 Correct 100 ms 10684 KB Output is correct
36 Correct 93 ms 8348 KB Output is correct
37 Correct 112 ms 10404 KB Output is correct
38 Correct 112 ms 10316 KB Output is correct
39 Correct 113 ms 10712 KB Output is correct
40 Correct 107 ms 10400 KB Output is correct
41 Correct 105 ms 5204 KB Output is correct
42 Correct 94 ms 5212 KB Output is correct
43 Correct 139 ms 6152 KB Output is correct
44 Correct 150 ms 8108 KB Output is correct
45 Correct 81 ms 4080 KB Output is correct
46 Correct 79 ms 4308 KB Output is correct
47 Correct 138 ms 7116 KB Output is correct
48 Correct 151 ms 8140 KB Output is correct
49 Correct 3 ms 724 KB Output is correct
50 Correct 2 ms 724 KB Output is correct
51 Correct 2 ms 556 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 4 ms 768 KB Output is correct
54 Correct 3 ms 724 KB Output is correct
55 Correct 3 ms 724 KB Output is correct
56 Correct 4 ms 596 KB Output is correct
57 Correct 3 ms 596 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 2 ms 596 KB Output is correct
60 Correct 1 ms 308 KB Output is correct
61 Correct 481 ms 27752 KB Output is correct
62 Correct 977 ms 54028 KB Output is correct
63 Correct 1025 ms 52364 KB Output is correct
64 Correct 1002 ms 52416 KB Output is correct
65 Correct 314 ms 27320 KB Output is correct
66 Correct 648 ms 49172 KB Output is correct
67 Correct 636 ms 52364 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1241 ms 101128 KB Output is correct
74 Correct 1295 ms 72276 KB Output is correct
75 Correct 1316 ms 93772 KB Output is correct
76 Correct 1345 ms 69460 KB Output is correct
77 Correct 1633 ms 90832 KB Output is correct
78 Correct 1098 ms 32760 KB Output is correct
79 Correct 1212 ms 32752 KB Output is correct
80 Correct 1855 ms 53316 KB Output is correct
81 Correct 1188 ms 31480 KB Output is correct
82 Correct 1573 ms 42184 KB Output is correct
83 Correct 1958 ms 52872 KB Output is correct
84 Correct 1078 ms 31016 KB Output is correct
85 Correct 1833 ms 52672 KB Output is correct
86 Correct 1805 ms 52324 KB Output is correct
87 Correct 917 ms 55604 KB Output is correct
88 Correct 1595 ms 88164 KB Output is correct
89 Correct 1627 ms 89852 KB Output is correct
90 Correct 1691 ms 90256 KB Output is correct