oj.uz

Submission #146792

# Submission time Handle Problem Language Result Execution time Memory
146792 2019-08-26T07:12:14 Z gs14004 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 389336 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 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);
	SORX(ldir); SORE(ldir);
	SORE(rdir); SORX(rdir);
	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:63: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 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 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 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 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 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 4 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 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 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 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 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 832 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 4 ms 760 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 4 ms 632 KB Output is correct
25 Correct 3 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 4 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 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 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 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 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 832 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 4 ms 760 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 4 ms 632 KB Output is correct
25 Correct 17 ms 3052 KB Output is correct
26 Correct 17 ms 3056 KB Output is correct
27 Correct 17 ms 3056 KB Output is correct
28 Correct 14 ms 2164 KB Output is correct
29 Correct 22 ms 2928 KB Output is correct
30 Correct 22 ms 3052 KB Output is correct
31 Correct 22 ms 3056 KB Output is correct
32 Correct 22 ms 3184 KB Output is correct
33 Correct 3 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 4 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 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 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 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 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 832 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 4 ms 760 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 4 ms 632 KB Output is correct
25 Correct 17 ms 3052 KB Output is correct
26 Correct 17 ms 3056 KB Output is correct
27 Correct 17 ms 3056 KB Output is correct
28 Correct 14 ms 2164 KB Output is correct
29 Correct 22 ms 2928 KB Output is correct
30 Correct 22 ms 3052 KB Output is correct
31 Correct 22 ms 3056 KB Output is correct
32 Correct 22 ms 3184 KB Output is correct
33 Correct 109 ms 17632 KB Output is correct
34 Correct 132 ms 17624 KB Output is correct
35 Correct 120 ms 17680 KB Output is correct
36 Correct 127 ms 17612 KB Output is correct
37 Correct 229 ms 29124 KB Output is correct
38 Correct 239 ms 29100 KB Output is correct
39 Correct 232 ms 29124 KB Output is correct
40 Correct 211 ms 27468 KB Output is correct
41 Correct 120 ms 16860 KB Output is correct
42 Correct 158 ms 22736 KB Output is correct
43 Correct 313 ms 28612 KB Output is correct
44 Correct 352 ms 29268 KB Output is correct
45 Correct 131 ms 15452 KB Output is correct
46 Correct 132 ms 15376 KB Output is correct
47 Correct 291 ms 28488 KB Output is correct
48 Correct 300 ms 29528 KB Output is correct
49 Correct 3 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 4 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 4 ms 632 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 5 ms 632 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 632 KB Output is correct
9 Correct 5 ms 624 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 854 ms 97900 KB Output is correct
3 Correct 2050 ms 200180 KB Output is correct
4 Correct 2075 ms 201144 KB Output is correct
5 Correct 2073 ms 201176 KB Output is correct
6 Correct 142 ms 28408 KB Output is correct
7 Correct 288 ms 51676 KB Output is correct
8 Correct 307 ms 54436 KB Output is correct
9 Correct 3 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 4 ms 376 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 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 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 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 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 832 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 8 ms 888 KB Output is correct
20 Correct 4 ms 760 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 4 ms 632 KB Output is correct
25 Correct 17 ms 3052 KB Output is correct
26 Correct 17 ms 3056 KB Output is correct
27 Correct 17 ms 3056 KB Output is correct
28 Correct 14 ms 2164 KB Output is correct
29 Correct 22 ms 2928 KB Output is correct
30 Correct 22 ms 3052 KB Output is correct
31 Correct 22 ms 3056 KB Output is correct
32 Correct 22 ms 3184 KB Output is correct
33 Correct 109 ms 17632 KB Output is correct
34 Correct 132 ms 17624 KB Output is correct
35 Correct 120 ms 17680 KB Output is correct
36 Correct 127 ms 17612 KB Output is correct
37 Correct 229 ms 29124 KB Output is correct
38 Correct 239 ms 29100 KB Output is correct
39 Correct 232 ms 29124 KB Output is correct
40 Correct 211 ms 27468 KB Output is correct
41 Correct 120 ms 16860 KB Output is correct
42 Correct 158 ms 22736 KB Output is correct
43 Correct 313 ms 28612 KB Output is correct
44 Correct 352 ms 29268 KB Output is correct
45 Correct 131 ms 15452 KB Output is correct
46 Correct 132 ms 15376 KB Output is correct
47 Correct 291 ms 28488 KB Output is correct
48 Correct 300 ms 29528 KB Output is correct
49 Correct 5 ms 632 KB Output is correct
50 Correct 4 ms 632 KB Output is correct
51 Correct 4 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 5 ms 632 KB Output is correct
54 Correct 5 ms 632 KB Output is correct
55 Correct 5 ms 504 KB Output is correct
56 Correct 5 ms 632 KB Output is correct
57 Correct 5 ms 624 KB Output is correct
58 Correct 4 ms 376 KB Output is correct
59 Correct 4 ms 376 KB Output is correct
60 Correct 3 ms 376 KB Output is correct
61 Correct 854 ms 97900 KB Output is correct
62 Correct 2050 ms 200180 KB Output is correct
63 Correct 2075 ms 201144 KB Output is correct
64 Correct 2073 ms 201176 KB Output is correct
65 Correct 142 ms 28408 KB Output is correct
66 Correct 288 ms 51676 KB Output is correct
67 Correct 307 ms 54436 KB Output is correct
68 Correct 2164 ms 200244 KB Output is correct
69 Correct 2443 ms 198560 KB Output is correct
70 Correct 2367 ms 198504 KB Output is correct
71 Correct 2692 ms 198456 KB Output is correct
72 Correct 3980 ms 345016 KB Output is correct
73 Correct 3217 ms 207444 KB Output is correct
74 Correct 3185 ms 216648 KB Output is correct
75 Correct 4989 ms 341936 KB Output is correct
76 Correct 3056 ms 233612 KB Output is correct
77 Correct 4190 ms 311480 KB Output is correct
78 Execution timed out 5096 ms 389336 KB Time limit exceeded
79 Halted 0 ms 0 KB -