oj.uz

Submission #146789

# Submission time Handle Problem Language Result Execution time Memory
146789 2019-08-26T06:59:10 Z gs14004 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 279300 KB 
#include "rect.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using namespace std;
using pi = pair<int, int>;
using lint = long long;
const int MAXN = 2505;

struct bit{
	int tree[MAXN];
	void add(int x, int v){
		for(int i=x; i<MAXN; i+=i&-i) tree[i] += v;
	}
	int query(int x){
		int ret = 0;
		for(int i=x; i; i-=i&-i) ret += tree[i];
		return ret;
	}
}bit;

struct strip{ int x, s, e, up; };

void proc(vector<strip> &v){
	sort(v.begin(), v.end(), [&](const strip &a, const strip &b){
		return make_tuple(a.s, a.e, a.x) < make_tuple(b.s, b.e, b.x);
	});
	v.resize(unique(v.begin(), v.end(), [&](const strip &a, const strip &b){
		return make_tuple(a.s, a.e, a.x) == make_tuple(b.s, b.e, b.x);
	}) - v.begin());
	for(int i=1; i<v.size(); i++){
		if(pi(v[i-1].s, v[i-1].e) == pi(v[i].s, v[i].e) && v[i-1].x + 1 == v[i].x) v[i].up = v[i-1].up + 1;
	}
}

int L[MAXN], R[MAXN];
lint count_rectangles(vector<vector<int>> a){
	vector<strip> rdir, ldir;
	int n = sz(a);
	int m = sz(a[0]);
	vector<int> stk;
	for(int i=1; i<n-1; i++){
		memset(L, -1, sizeof(L));
		memset(R, -1, sizeof(R));
		for(int j=0; j<m; j++){
			while(!stk.empty() && a[i][stk.back()] <= a[i][j]) stk.pop_back();
			if(stk.size()) L[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=m-1; j>=0; j--){
			while(!stk.empty() && a[i][stk.back()] <= a[i][j]) stk.pop_back();
			if(stk.size()) R[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=0; j<m; j++){
			if(L[j] != -1 && R[j] != -1){
				rdir.push_back({i, L[j], R[j], 1});
			}
		}
	}
	for(int i=1; i<m-1; i++){
		memset(L, -1, sizeof(L));
		memset(R, -1, sizeof(R));
		for(int j=0; j<n; j++){
			while(!stk.empty() && a[stk.back()][i] <= a[j][i]) stk.pop_back();
			if(stk.size()) L[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=n-1; j>=0; j--){
			while(!stk.empty() && a[stk.back()][i] <= a[j][i]) stk.pop_back();
			if(stk.size()) R[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=0; j<n; j++){
			if(L[j] != -1 && R[j] != -1){
				ldir.push_back({i, L[j], R[j], 1});
			}
		}
	}
	proc(ldir);
	proc(rdir);
	sort(ldir.begin(), ldir.end(), [&](const strip &a, const strip &b){
		return pi(a.e, a.x) < pi(b.e, b.x);
	});
	sort(rdir.begin(), rdir.end(), [&](const strip &a, const strip &b){
		return pi(a.x, a.e) < pi(b.x, b.e);
	});
	int p1 = 0, p2 = 0;
	lint ret = 0;
	for(int i=2; i<n; i++){
		for(int j=2; j<m; j++){
			vector<pi> punk1, punk2;
			while(p1 < sz(rdir) && pi(rdir[p1].x + 1, rdir[p1].e) == pi(i, j)){
				punk1.emplace_back(j - rdir[p1].s - 1, rdir[p1].up);
				p1++;
			}
			while(p2 < sz(ldir) && pi(ldir[p2].e, ldir[p2].x + 1) == pi(i, j)){
				punk2.emplace_back(ldir[p2].up, i - ldir[p2].s - 1);
				p2++;
			}
			sort(punk1.begin(), punk1.end());
			sort(punk2.begin(), punk2.end());
			int p3 = 0;
			for(auto &y : punk2){
				while(p3 < sz(punk1) && punk1[p3].first <= y.first) bit.add(punk1[p3++].second, +1);
				ret += p3 - bit.query(y.second - 1);
			}
			for(int i=0; i<p3; i++) bit.add(punk1[i].second, -1);
		}
	}
	return ret;
}

Compilation message

rect.cpp: In function 'void proc(std::vector<strip>&)':
rect.cpp:30:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<v.size(); i++){
               ~^~~~~~~~~

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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 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 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 632 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 7 ms 764 KB Output is correct
23 Correct 7 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 632 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 7 ms 764 KB Output is correct
23 Correct 7 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 24 ms 3056 KB Output is correct
26 Correct 24 ms 3084 KB Output is correct
27 Correct 32 ms 3396 KB Output is correct
28 Correct 18 ms 1908 KB Output is correct
29 Correct 31 ms 2928 KB Output is correct
30 Correct 32 ms 3156 KB Output is correct
31 Correct 30 ms 3056 KB Output is correct
32 Correct 31 ms 3052 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 632 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 7 ms 764 KB Output is correct
23 Correct 7 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 24 ms 3056 KB Output is correct
26 Correct 24 ms 3084 KB Output is correct
27 Correct 32 ms 3396 KB Output is correct
28 Correct 18 ms 1908 KB Output is correct
29 Correct 31 ms 2928 KB Output is correct
30 Correct 32 ms 3156 KB Output is correct
31 Correct 30 ms 3056 KB Output is correct
32 Correct 31 ms 3052 KB Output is correct
33 Correct 156 ms 17360 KB Output is correct
34 Correct 146 ms 17344 KB Output is correct
35 Correct 156 ms 16732 KB Output is correct
36 Correct 122 ms 16604 KB Output is correct
37 Correct 308 ms 26576 KB Output is correct
38 Correct 312 ms 26576 KB Output is correct
39 Correct 309 ms 26576 KB Output is correct
40 Correct 287 ms 25944 KB Output is correct
41 Correct 159 ms 15200 KB Output is correct
42 Correct 218 ms 22608 KB Output is correct
43 Correct 408 ms 25808 KB Output is correct
44 Correct 411 ms 26512 KB Output is correct
45 Correct 195 ms 14048 KB Output is correct
46 Correct 196 ms 14052 KB Output is correct
47 Correct 373 ms 26452 KB Output is correct
48 Correct 381 ms 26356 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 3 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 1000 ms 98988 KB Output is correct
3 Correct 2214 ms 165772 KB Output is correct
4 Correct 2217 ms 166260 KB Output is correct
5 Correct 2221 ms 166556 KB Output is correct
6 Correct 129 ms 28792 KB Output is correct
7 Correct 292 ms 48760 KB Output is correct
8 Correct 311 ms 51832 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 6 ms 760 KB Output is correct
20 Correct 5 ms 632 KB Output is correct
21 Correct 9 ms 760 KB Output is correct
22 Correct 7 ms 764 KB Output is correct
23 Correct 7 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 24 ms 3056 KB Output is correct
26 Correct 24 ms 3084 KB Output is correct
27 Correct 32 ms 3396 KB Output is correct
28 Correct 18 ms 1908 KB Output is correct
29 Correct 31 ms 2928 KB Output is correct
30 Correct 32 ms 3156 KB Output is correct
31 Correct 30 ms 3056 KB Output is correct
32 Correct 31 ms 3052 KB Output is correct
33 Correct 156 ms 17360 KB Output is correct
34 Correct 146 ms 17344 KB Output is correct
35 Correct 156 ms 16732 KB Output is correct
36 Correct 122 ms 16604 KB Output is correct
37 Correct 308 ms 26576 KB Output is correct
38 Correct 312 ms 26576 KB Output is correct
39 Correct 309 ms 26576 KB Output is correct
40 Correct 287 ms 25944 KB Output is correct
41 Correct 159 ms 15200 KB Output is correct
42 Correct 218 ms 22608 KB Output is correct
43 Correct 408 ms 25808 KB Output is correct
44 Correct 411 ms 26512 KB Output is correct
45 Correct 195 ms 14048 KB Output is correct
46 Correct 196 ms 14052 KB Output is correct
47 Correct 373 ms 26452 KB Output is correct
48 Correct 381 ms 26356 KB Output is correct
49 Correct 4 ms 632 KB Output is correct
50 Correct 4 ms 632 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 2 ms 380 KB Output is correct
53 Correct 4 ms 632 KB Output is correct
54 Correct 0 ms 504 KB Output is correct
55 Correct 4 ms 636 KB Output is correct
56 Correct 4 ms 504 KB Output is correct
57 Correct 4 ms 504 KB Output is correct
58 Correct 3 ms 376 KB Output is correct
59 Correct 3 ms 376 KB Output is correct
60 Correct 2 ms 380 KB Output is correct
61 Correct 1000 ms 98988 KB Output is correct
62 Correct 2214 ms 165772 KB Output is correct
63 Correct 2217 ms 166260 KB Output is correct
64 Correct 2221 ms 166556 KB Output is correct
65 Correct 129 ms 28792 KB Output is correct
66 Correct 292 ms 48760 KB Output is correct
67 Correct 311 ms 51832 KB Output is correct
68 Correct 2310 ms 166648 KB Output is correct
69 Correct 2176 ms 164924 KB Output is correct
70 Correct 2310 ms 164936 KB Output is correct
71 Correct 1770 ms 164904 KB Output is correct
72 Correct 4562 ms 279300 KB Output is correct
73 Correct 3441 ms 154648 KB Output is correct
74 Correct 3648 ms 158712 KB Output is correct
75 Execution timed out 5122 ms 278516 KB Time limit exceeded
76 Halted 0 ms 0 KB -