oj.uz

Submission #146795

# Submission time Handle Problem Language Result Execution time Memory
146795 2019-08-26T07:18:18 Z gs14004 Rectangles (IOI19_rect) C++17
100 / 100
 4901 ms 390948 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; };

int cnt[MAXN];

void SORU(vector<strip> &v){
	memset(cnt, 0, sizeof(cnt));
	vector<strip> w(sz(v));
	for(auto &i : v) cnt[i.up]++;
	for(int i=1; i<MAXN; i++) cnt[i] += cnt[i-1];
	for(int i=v.size()-1; i>=0; i--){
		w[--cnt[v[i].up]] = v[i];
	}
	v = w;
}

void SORX(vector<strip> &v){
	memset(cnt, 0, sizeof(cnt));
	vector<strip> w(sz(v));
	for(auto &i : v) cnt[i.x]++;
	for(int i=1; i<MAXN; i++) cnt[i] += cnt[i-1];
	for(int i=v.size()-1; i>=0; i--){
		w[--cnt[v[i].x]] = v[i];
	}
	v = w;
}

void SORS(vector<strip> &v){
	memset(cnt, 0, sizeof(cnt));
	vector<strip> w(sz(v));
	for(auto &i : v) cnt[i.s]++;
	for(int i=1; i<MAXN; i++) cnt[i] += cnt[i-1];
	for(int i=v.size()-1; i>=0; i--){
		w[--cnt[v[i].s]] = v[i];
	}
	v = w;
}

void SORE(vector<strip> &v){
	memset(cnt, 0, sizeof(cnt));
	vector<strip> w(sz(v));
	for(auto &i : v) cnt[i.e]++;
	for(int i=1; i<MAXN; i++) cnt[i] += cnt[i-1];
	for(int i=v.size()-1; i>=0; i--){
		w[--cnt[v[i].e]] = v[i];
	}
	v = w;
}

void proc(vector<strip> &v){
	SORX(v); SORE(v); SORS(v);
	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];

void getLR(vector<int> v){
	vector<int> stk;
	int m = sz(v);
	for(int j=0; j<m; j++){
		while(!stk.empty() && v[stk.back()] <= v[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() && v[stk.back()] <= v[j]) stk.pop_back();
		if(stk.size()) R[j] = stk.back();
		stk.push_back(j);
	}
}

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));
		vector<int> v(a[i].begin(), a[i].begin() + m);
		getLR(v);
		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));
		vector<int> v;
		for(int j=0; j<n; j++){
			v.push_back(a[j][i]);
		}
		getLR(v);
		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);
	SORU(ldir); SORX(ldir); SORE(ldir); 
	SORS(rdir); SORE(rdir); SORX(rdir);
	int p1 = 0, p2 = 0;
	lint ret = 0;
	vector<pi> punk1, punk2;
	for(int i=2; i<n; i++){
		for(int j=2; j<m; j++){
			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++;
			}
			reverse(punk1.begin(), punk1.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);
			punk1.clear();
			punk2.clear();
		}
	}
	return ret;
}

Compilation message

rect.cpp: In function 'void proc(std::vector<strip>&)':
rect.cpp:74: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 2 ms 376 KB Output is correct
3 Correct 3 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 3 ms 376 KB Output is correct
7 Correct 3 ms 392 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 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 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 1 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 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 2 ms 376 KB Output is correct
3 Correct 3 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 3 ms 376 KB Output is correct
7 Correct 3 ms 392 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 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 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 4 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 5 ms 760 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 3 ms 504 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 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 2 ms 376 KB Output is correct
3 Correct 3 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 3 ms 376 KB Output is correct
7 Correct 3 ms 392 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 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 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 4 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 5 ms 760 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 18 ms 3052 KB Output is correct
26 Correct 16 ms 3052 KB Output is correct
27 Correct 17 ms 3180 KB Output is correct
28 Correct 14 ms 2164 KB Output is correct
29 Correct 20 ms 2924 KB Output is correct
30 Correct 20 ms 3052 KB Output is correct
31 Correct 19 ms 3052 KB Output is correct
32 Correct 21 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 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 2 ms 376 KB Output is correct
3 Correct 3 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 3 ms 376 KB Output is correct
7 Correct 3 ms 392 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 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 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 4 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 5 ms 760 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 18 ms 3052 KB Output is correct
26 Correct 16 ms 3052 KB Output is correct
27 Correct 17 ms 3180 KB Output is correct
28 Correct 14 ms 2164 KB Output is correct
29 Correct 20 ms 2924 KB Output is correct
30 Correct 20 ms 3052 KB Output is correct
31 Correct 19 ms 3052 KB Output is correct
32 Correct 21 ms 3052 KB Output is correct
33 Correct 118 ms 18724 KB Output is correct
34 Correct 109 ms 18780 KB Output is correct
35 Correct 112 ms 18652 KB Output is correct
36 Correct 112 ms 18520 KB Output is correct
37 Correct 221 ms 30000 KB Output is correct
38 Correct 230 ms 30152 KB Output is correct
39 Correct 242 ms 30260 KB Output is correct
40 Correct 208 ms 28484 KB Output is correct
41 Correct 119 ms 16788 KB Output is correct
42 Correct 164 ms 22608 KB Output is correct
43 Correct 269 ms 28672 KB Output is correct
44 Correct 279 ms 29772 KB Output is correct
45 Correct 115 ms 15516 KB Output is correct
46 Correct 115 ms 15416 KB Output is correct
47 Correct 245 ms 29384 KB Output is correct
48 Correct 247 ms 29380 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 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 636 KB Output is correct
3 Correct 4 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 5 ms 760 KB Output is correct
6 Correct 5 ms 760 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 4 ms 380 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 806 ms 97180 KB Output is correct
3 Correct 1971 ms 199344 KB Output is correct
4 Correct 2009 ms 200376 KB Output is correct
5 Correct 1998 ms 200860 KB Output is correct
6 Correct 138 ms 28124 KB Output is correct
7 Correct 286 ms 51112 KB Output is correct
8 Correct 303 ms 54532 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 2 ms 376 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 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 3 ms 376 KB Output is correct
7 Correct 3 ms 392 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 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 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 1 ms 376 KB Output is correct
17 Correct 4 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 5 ms 760 KB Output is correct
22 Correct 5 ms 760 KB Output is correct
23 Correct 5 ms 760 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 18 ms 3052 KB Output is correct
26 Correct 16 ms 3052 KB Output is correct
27 Correct 17 ms 3180 KB Output is correct
28 Correct 14 ms 2164 KB Output is correct
29 Correct 20 ms 2924 KB Output is correct
30 Correct 20 ms 3052 KB Output is correct
31 Correct 19 ms 3052 KB Output is correct
32 Correct 21 ms 3052 KB Output is correct
33 Correct 118 ms 18724 KB Output is correct
34 Correct 109 ms 18780 KB Output is correct
35 Correct 112 ms 18652 KB Output is correct
36 Correct 112 ms 18520 KB Output is correct
37 Correct 221 ms 30000 KB Output is correct
38 Correct 230 ms 30152 KB Output is correct
39 Correct 242 ms 30260 KB Output is correct
40 Correct 208 ms 28484 KB Output is correct
41 Correct 119 ms 16788 KB Output is correct
42 Correct 164 ms 22608 KB Output is correct
43 Correct 269 ms 28672 KB Output is correct
44 Correct 279 ms 29772 KB Output is correct
45 Correct 115 ms 15516 KB Output is correct
46 Correct 115 ms 15416 KB Output is correct
47 Correct 245 ms 29384 KB Output is correct
48 Correct 247 ms 29380 KB Output is correct
49 Correct 5 ms 632 KB Output is correct
50 Correct 5 ms 636 KB Output is correct
51 Correct 4 ms 380 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 5 ms 760 KB Output is correct
54 Correct 5 ms 760 KB Output is correct
55 Correct 5 ms 632 KB Output is correct
56 Correct 5 ms 504 KB Output is correct
57 Correct 5 ms 504 KB Output is correct
58 Correct 3 ms 376 KB Output is correct
59 Correct 4 ms 380 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 806 ms 97180 KB Output is correct
62 Correct 1971 ms 199344 KB Output is correct
63 Correct 2009 ms 200376 KB Output is correct
64 Correct 1998 ms 200860 KB Output is correct
65 Correct 138 ms 28124 KB Output is correct
66 Correct 286 ms 51112 KB Output is correct
67 Correct 303 ms 54532 KB Output is correct
68 Correct 2227 ms 201044 KB Output is correct
69 Correct 2481 ms 199360 KB Output is correct
70 Correct 2332 ms 199264 KB Output is correct
71 Correct 2561 ms 199532 KB Output is correct
72 Correct 4059 ms 345852 KB Output is correct
73 Correct 2842 ms 210736 KB Output is correct
74 Correct 3076 ms 216732 KB Output is correct
75 Correct 4765 ms 342284 KB Output is correct
76 Correct 2902 ms 205224 KB Output is correct
77 Correct 3970 ms 273668 KB Output is correct
78 Correct 4901 ms 342060 KB Output is correct
79 Correct 2682 ms 225652 KB Output is correct
80 Correct 4597 ms 388384 KB Output is correct
81 Correct 4420 ms 377724 KB Output is correct
82 Correct 2411 ms 234992 KB Output is correct
83 Correct 4100 ms 390504 KB Output is correct
84 Correct 4228 ms 390816 KB Output is correct
85 Correct 4088 ms 390948 KB Output is correct
86 Correct 2 ms 376 KB Output is correct
87 Correct 2 ms 376 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 376 KB Output is correct