oj.uz

Submission #146793

# Submission time Handle Problem Language Result Execution time Memory
146793 2019-08-26T07:15:11 Z gs14004 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 345456 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;
	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++;
			}
			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);
		}
	}
	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 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 348 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 380 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 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 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 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 348 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 380 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 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 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 764 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 4 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 632 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 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 348 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 380 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 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 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 764 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 4 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 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 3180 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 21 ms 3056 KB Output is correct
32 Correct 22 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 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 348 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 380 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 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 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 764 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 4 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 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 3180 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 21 ms 3056 KB Output is correct
32 Correct 22 ms 3052 KB Output is correct
33 Correct 109 ms 19036 KB Output is correct
34 Correct 121 ms 19132 KB Output is correct
35 Correct 126 ms 19076 KB Output is correct
36 Correct 158 ms 19032 KB Output is correct
37 Correct 214 ms 30564 KB Output is correct
38 Correct 227 ms 30536 KB Output is correct
39 Correct 235 ms 30788 KB Output is correct
40 Correct 220 ms 29124 KB Output is correct
41 Correct 123 ms 16728 KB Output is correct
42 Correct 165 ms 22608 KB Output is correct
43 Correct 319 ms 28668 KB Output is correct
44 Correct 321 ms 30704 KB Output is correct
45 Correct 134 ms 15456 KB Output is correct
46 Correct 137 ms 15448 KB Output is correct
47 Correct 302 ms 29508 KB Output is correct
48 Correct 287 ms 30404 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 4 ms 632 KB Output is correct
3 Correct 4 ms 504 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 504 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 867 ms 98864 KB Output is correct
3 Correct 2105 ms 203160 KB Output is correct
4 Correct 2105 ms 204560 KB Output is correct
5 Correct 2110 ms 204236 KB Output is correct
6 Correct 153 ms 29176 KB Output is correct
7 Correct 285 ms 54008 KB Output is correct
8 Correct 305 ms 56824 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
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 8 ms 348 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 380 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 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 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 4 ms 764 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 4 ms 760 KB Output is correct
20 Correct 4 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 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 3180 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 21 ms 3056 KB Output is correct
32 Correct 22 ms 3052 KB Output is correct
33 Correct 109 ms 19036 KB Output is correct
34 Correct 121 ms 19132 KB Output is correct
35 Correct 126 ms 19076 KB Output is correct
36 Correct 158 ms 19032 KB Output is correct
37 Correct 214 ms 30564 KB Output is correct
38 Correct 227 ms 30536 KB Output is correct
39 Correct 235 ms 30788 KB Output is correct
40 Correct 220 ms 29124 KB Output is correct
41 Correct 123 ms 16728 KB Output is correct
42 Correct 165 ms 22608 KB Output is correct
43 Correct 319 ms 28668 KB Output is correct
44 Correct 321 ms 30704 KB Output is correct
45 Correct 134 ms 15456 KB Output is correct
46 Correct 137 ms 15448 KB Output is correct
47 Correct 302 ms 29508 KB Output is correct
48 Correct 287 ms 30404 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 504 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 504 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 867 ms 98864 KB Output is correct
62 Correct 2105 ms 203160 KB Output is correct
63 Correct 2105 ms 204560 KB Output is correct
64 Correct 2110 ms 204236 KB Output is correct
65 Correct 153 ms 29176 KB Output is correct
66 Correct 285 ms 54008 KB Output is correct
67 Correct 305 ms 56824 KB Output is correct
68 Correct 2245 ms 201960 KB Output is correct
69 Correct 2843 ms 199188 KB Output is correct
70 Correct 2490 ms 199012 KB Output is correct
71 Correct 2807 ms 199088 KB Output is correct
72 Correct 4110 ms 345456 KB Output is correct
73 Correct 3105 ms 211440 KB Output is correct
74 Correct 3369 ms 216668 KB Output is correct
75 Execution timed out 5027 ms 342016 KB Time limit exceeded
76 Halted 0 ms 0 KB -