oj.uz

답안 #810622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
810622 2023-08-06T12:33:58 Z fatemetmhr Rectangles (IOI19_rect) C++17
100 / 100
 1421 ms 355804 KB 
// na mn tanha nistam :) hich vaghtam bi bahre naboodam ...


#include <bits/stdc++.h>
#include "rect.h"

using namespace std;

#define all(x) x.begin(), x.end()
#define pb     push_back
#define fi     first
#define se     second
#define mp     make_pair

typedef long long ll;

const int lg = 12;
const int maxn5 = 2510;

int n, m;
vector <int> av;
ll ans = 0;
int lef[maxn5][maxn5], rig[maxn5][maxn5];
int dw[maxn5][maxn5], up[maxn5][maxn5];
pair <int, int> have[2][maxn5][maxn5], ex[2][maxn5][maxn5];


namespace rmqmn{
	int mn[lg][maxn5];
	void build(int n){
		for(int i = 1; i < lg; i++) for(int j = 0; j < n; j++)
			mn[i][j] = min(mn[i - 1][j], (j + (1 << (i - 1)) < n ? mn[i - 1][j + (1 << (i - 1))] : maxn5));
	}

	int get(int l, int r){
		if(r < l)
			return 0;
		int k = 31 - __builtin_clz(r - l + 1);
		return min(mn[k][l], mn[k][r - (1 << k) + 1]);
	}
}

namespace rmqmx{
	int mx[lg][maxn5];
	void build(int n){
		for(int i = 1; i < lg; i++) for(int j = 0; j < n; j++)
			mx[i][j] = max(mx[i - 1][j], (j + (1 << (i - 1)) < n ? mx[i - 1][j + (1 << (i - 1))] : maxn5));
	}

	int get(int l, int r){
		if(r < l)
			return 0;
		int k = 31 - __builtin_clz(r - l + 1);
		return max(mx[k][l], mx[k][r - (1 << k) + 1]);
	}
}

namespace fen{
	int fen[maxn5];
	ll all = 0;

	void add(int id, int val){
		all += val;
		for(id += 5; id < maxn5; id += id & -id)
			fen[id] += val;
	}

	int get(int id){
		int ret = 0;
		for(id += 4; id; id -= id & -id)
			ret += fen[id];
		////////cout << id << ' ' << all << ' ' << ret << endl;
		return all - ret;
	}
}

namespace anscalcer{

	vector <pair<int, int>> req[2], rem;

	void clear(){
		req[0].clear();
		req[1].clear();
		rem.clear();
	}

	void add(int ty, int l, int r){
		//cout << "here " << ty << ' ' << l << ' ' << r << endl;
		if(ty){
			req[ty].pb({l, r});
			rem.pb({r, l});
		}
		else{
			req[ty].pb({r, l});
		}
	}

	void calc(){
		sort(all(req[0]));
		sort(all(req[1]));
		sort(all(rem));

		int ind = 0, ind2 = 0;
		for(auto [r, l] : req[0]){
			while(ind < req[1].size() && req[1][ind].fi + 2 <= r){
				fen::add(req[1][ind].fi, 1);
				//cout << "adding " << req[1][ind].fi << endl;
				ind++;
			}
			while(ind2 < rem.size() && rem[ind2].fi < r){
				fen::add(rem[ind2].se, -1);
				ind2++;
			}
			ans += fen::get(l);
			//cout << l << ' ' << r << ' ' << fen::get(l) << ' ' << ans << endl;
		}
		while(ind < req[1].size()){
			fen::add(req[1][ind].fi, 1);
			ind++;
		}
		while(ind2 < rem.size()){
			fen::add(rem[ind2].se, -1);
			ind2++;
		}
	}
}

bool exi(int id, int l, int r){
	return id >= 0 && id < n && (lef[id][r] == l || rig[id][l] == r);
}

pair <int, int> get_val(int id, int l, int r, int last){
	//////cout << id << ' ' << l << ' ' << r << endl;
	if(lef[id][r] == l)
		return have[0][id][r];
	if(rig[id][l] == r) 
		return have[1][id][l];
	//////cout << "no " << endl;
	if(id < last){
		if(id + 1 < n && rig[id + 1][l] == r)
			return ex[1][id + 1][l];
		//////cout << "now " << endl;
		if(id + 1 < n && lef[id + 1][r] == l)
			return ex[0][id + 1][r];
		////cout << "ridi " << endl;

	}
	//////cout << "and " << endl;
		if(id && rig[id - 1][l] == r)
			return ex[1][id - 1][l];
		//////cout << "ha " << endl;
		if(id && lef[id - 1][r] == l)
			return ex[0][id - 1][r];
}


void solve(int id, int l, int r){
	//////cout << "ha? " << id << ' ' << l << ' ' << r << endl;
	if(id > 1 && exi(id - 1, l, r))
		return;
	int rq = id + 1;
	while(rq < n - 1 && exi(rq, l, r))
		rq++;
	anscalcer::clear();
	//cout << "solve of " << id << ' ' << rq << ' ' << l << ' ' << r << endl;
	for(int i = max(0, id - 1); i <= rq; i++){
		pair <int, int> ret = get_val(i, l, r, id);
		//cout << "** " << i << ' ' << ret.fi << ' ' << ret.se << endl;
		if(ret.fi + 1 < i && i >= id)
			anscalcer::add(0, ret.fi, i);
		if(i + 1 < ret.se && i < rq)
			anscalcer::add(1, i, ret.se);
	}
	anscalcer::calc();
	//cout << "finally " << ans << endl;
	return;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	n = a.size();
	m = a[0].size();
	memset(up, -1, sizeof up);
	if(min(n, m) < 3)
		return 0;
	for(int j = 0; j < m; j++){
		av.clear();
		for(int i = 0; i < n; i++){
			while(av.size() && a[av.back()][j] < a[i][j]){
				dw[av.back()][j] = i;
				av.pop_back();
			}
			dw[i][j] = n;
			if(av.size()){
				if(a[av.back()][j] == a[i][j]){
					up[i][j] = av.back();
					dw[av.back()][j] = i;
					av.pop_back();
				}
				else
					up[i][j] = av.back();
			}
			av.pb(i);
		}
	}
	memset(lef, -1, sizeof lef);
	for(int i = 0; i < n; i++){
		av.clear();
		for(int j = 0; j < m; j++){
			rig[i][j] = m;
			while(av.size() && a[i][av.back()] < a[i][j]){
				rig[i][av.back()] = j;
				av.pop_back();
			}
			if(av.size()){
				////////////////cout << i << ' ' << j << ' ' << av.back() << ' ' << a[i][av.back()] << endl;
				if(a[i][av.back()] == a[i][j]){
					lef[i][j] = av.back();
					rig[i][av.back()] = j;
					av.pop_back();
				}
				else
					lef[i][j] = av.back();
			}
			av.pb(j);
		}
	}

	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			rmqmx::mx[0][j] = up[i][j];
			rmqmn::mn[0][j] = dw[i][j];
		}
		rmqmx::build(m);
		rmqmn::build(m);
		for(int j = 0; j < m; j++){
			//////////////cout << i << ' ' << j << endl;
			if(lef[i][j] != -1){
				have[0][i][j].fi = rmqmx::get(lef[i][j] + 1, j - 1);
				have[0][i][j].se = rmqmn::get(lef[i][j] + 1, j - 1);
			}
			//else{
				if(i && lef[i - 1][j] != -1)
					ex[0][i - 1][j].fi = rmqmx::get(lef[i - 1][j] + 1, j - 1);
				if(i + 1 < n && lef[i + 1][j] != -1)
					ex[0][i + 1][j].se = rmqmn::get(lef[i + 1][j] + 1, j - 1);
			//}
			if(rig[i][j] != -1){
				have[1][i][j].fi = rmqmx::get(j + 1, rig[i][j] - 1);
				have[1][i][j].se = rmqmn::get(j + 1, rig[i][j] - 1);
			}
			//else{
				if(i && rig[i - 1][j] != -1)
					ex[1][i - 1][j].fi = rmqmx::get(j + 1, rig[i - 1][j] - 1);
				if(i + 1 < n && rig[i + 1][j] != -1)
					ex[1][i + 1][j].se = rmqmn::get(j + 1, rig[i + 1][j] - 1);

			//}
		}
	}

	for(int i = 1; i < n - 1; i++) for(int j = 0; j < m; j++){
		//////////////cout << "*** " << i << ' ' << j << ' ' << lef[i][j] << ' ' << rig[i][j] << ' ' << up[i][j] << ' ' << dw[i][j] << endl;
		if(lef[i][j] != -1 && (j != rig[i][lef[i][j]]) && lef[i][j] + 1 < j){
			//////////////////cout << "hmm " << rig[i][lef[i][j]] << endl;
			solve(i, lef[i][j], j);
		}
		if(rig[i][j] < m && j + 1 < rig[i][j])
			solve(i, j, rig[i][j]);
	}
	return ans;

}

Compilation message

rect.cpp: In function 'void anscalcer::calc()':
rect.cpp:105:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |    while(ind < req[1].size() && req[1][ind].fi + 2 <= r){
      |          ~~~~^~~~~~~~~~~~~~~
rect.cpp:110: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]
  110 |    while(ind2 < rem.size() && rem[ind2].fi < r){
      |          ~~~~~^~~~~~~~~~~~
rect.cpp:117:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |   while(ind < req[1].size()){
      |         ~~~~^~~~~~~~~~~~~~~
rect.cpp:121:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |   while(ind2 < rem.size()){
      |         ~~~~~^~~~~~~~~~~~
rect.cpp: In function 'std::pair<int, int> get_val(int, int, int, int)':
rect.cpp:154:1: warning: control reaches end of non-void function [-Wreturn-type]
  154 | }
      | ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 49876 KB Output is correct
2 Correct 17 ms 50488 KB Output is correct
3 Correct 18 ms 50488 KB Output is correct
4 Correct 18 ms 50524 KB Output is correct
5 Correct 18 ms 50484 KB Output is correct
6 Correct 17 ms 50488 KB Output is correct
7 Correct 18 ms 50392 KB Output is correct
8 Correct 19 ms 50068 KB Output is correct
9 Correct 19 ms 50500 KB Output is correct
10 Correct 18 ms 50448 KB Output is correct
11 Correct 22 ms 50512 KB Output is correct
12 Correct 17 ms 50408 KB Output is correct
13 Correct 10 ms 24896 KB Output is correct
14 Correct 12 ms 24900 KB Output is correct
15 Correct 17 ms 49876 KB Output is correct
16 Correct 17 ms 49728 KB Output is correct
17 Correct 9 ms 24916 KB Output is correct
18 Correct 9 ms 24916 KB Output is correct
19 Correct 17 ms 50420 KB Output is correct
20 Correct 20 ms 50516 KB Output is correct
21 Correct 10 ms 24916 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 49876 KB Output is correct
2 Correct 17 ms 50488 KB Output is correct
3 Correct 18 ms 50488 KB Output is correct
4 Correct 18 ms 50524 KB Output is correct
5 Correct 18 ms 50484 KB Output is correct
6 Correct 17 ms 50488 KB Output is correct
7 Correct 18 ms 50392 KB Output is correct
8 Correct 19 ms 50068 KB Output is correct
9 Correct 19 ms 50500 KB Output is correct
10 Correct 18 ms 50448 KB Output is correct
11 Correct 22 ms 50512 KB Output is correct
12 Correct 17 ms 50408 KB Output is correct
13 Correct 10 ms 24896 KB Output is correct
14 Correct 12 ms 24900 KB Output is correct
15 Correct 17 ms 49876 KB Output is correct
16 Correct 17 ms 49728 KB Output is correct
17 Correct 9 ms 24916 KB Output is correct
18 Correct 9 ms 24916 KB Output is correct
19 Correct 17 ms 50420 KB Output is correct
20 Correct 20 ms 50516 KB Output is correct
21 Correct 10 ms 24916 KB Output is correct
22 Correct 19 ms 51916 KB Output is correct
23 Correct 18 ms 51912 KB Output is correct
24 Correct 18 ms 51944 KB Output is correct
25 Correct 19 ms 51948 KB Output is correct
26 Correct 20 ms 51836 KB Output is correct
27 Correct 20 ms 51904 KB Output is correct
28 Correct 19 ms 51856 KB Output is correct
29 Correct 19 ms 51800 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 49876 KB Output is correct
2 Correct 17 ms 50488 KB Output is correct
3 Correct 18 ms 50488 KB Output is correct
4 Correct 18 ms 50524 KB Output is correct
5 Correct 18 ms 50484 KB Output is correct
6 Correct 17 ms 50488 KB Output is correct
7 Correct 18 ms 50392 KB Output is correct
8 Correct 19 ms 50068 KB Output is correct
9 Correct 19 ms 50500 KB Output is correct
10 Correct 18 ms 50448 KB Output is correct
11 Correct 22 ms 50512 KB Output is correct
12 Correct 17 ms 50408 KB Output is correct
13 Correct 10 ms 24896 KB Output is correct
14 Correct 12 ms 24900 KB Output is correct
15 Correct 17 ms 49876 KB Output is correct
16 Correct 17 ms 49728 KB Output is correct
17 Correct 19 ms 51916 KB Output is correct
18 Correct 18 ms 51912 KB Output is correct
19 Correct 18 ms 51944 KB Output is correct
20 Correct 19 ms 51948 KB Output is correct
21 Correct 20 ms 51836 KB Output is correct
22 Correct 20 ms 51904 KB Output is correct
23 Correct 19 ms 51856 KB Output is correct
24 Correct 19 ms 51800 KB Output is correct
25 Correct 9 ms 24916 KB Output is correct
26 Correct 9 ms 24916 KB Output is correct
27 Correct 17 ms 50420 KB Output is correct
28 Correct 20 ms 50516 KB Output is correct
29 Correct 10 ms 24916 KB Output is correct
30 Correct 25 ms 56580 KB Output is correct
31 Correct 25 ms 56624 KB Output is correct
32 Correct 25 ms 56744 KB Output is correct
33 Correct 25 ms 56504 KB Output is correct
34 Correct 26 ms 56512 KB Output is correct
35 Correct 27 ms 56716 KB Output is correct
36 Correct 26 ms 56636 KB Output is correct
37 Correct 26 ms 56588 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 49876 KB Output is correct
2 Correct 17 ms 50488 KB Output is correct
3 Correct 18 ms 50488 KB Output is correct
4 Correct 18 ms 50524 KB Output is correct
5 Correct 18 ms 50484 KB Output is correct
6 Correct 17 ms 50488 KB Output is correct
7 Correct 18 ms 50392 KB Output is correct
8 Correct 19 ms 50068 KB Output is correct
9 Correct 19 ms 50500 KB Output is correct
10 Correct 18 ms 50448 KB Output is correct
11 Correct 22 ms 50512 KB Output is correct
12 Correct 17 ms 50408 KB Output is correct
13 Correct 10 ms 24896 KB Output is correct
14 Correct 12 ms 24900 KB Output is correct
15 Correct 17 ms 49876 KB Output is correct
16 Correct 17 ms 49728 KB Output is correct
17 Correct 19 ms 51916 KB Output is correct
18 Correct 18 ms 51912 KB Output is correct
19 Correct 18 ms 51944 KB Output is correct
20 Correct 19 ms 51948 KB Output is correct
21 Correct 20 ms 51836 KB Output is correct
22 Correct 20 ms 51904 KB Output is correct
23 Correct 19 ms 51856 KB Output is correct
24 Correct 19 ms 51800 KB Output is correct
25 Correct 25 ms 56580 KB Output is correct
26 Correct 25 ms 56624 KB Output is correct
27 Correct 25 ms 56744 KB Output is correct
28 Correct 25 ms 56504 KB Output is correct
29 Correct 26 ms 56512 KB Output is correct
30 Correct 27 ms 56716 KB Output is correct
31 Correct 26 ms 56636 KB Output is correct
32 Correct 26 ms 56588 KB Output is correct
33 Correct 9 ms 24916 KB Output is correct
34 Correct 9 ms 24916 KB Output is correct
35 Correct 17 ms 50420 KB Output is correct
36 Correct 20 ms 50516 KB Output is correct
37 Correct 10 ms 24916 KB Output is correct
38 Correct 71 ms 88848 KB Output is correct
39 Correct 76 ms 92708 KB Output is correct
40 Correct 77 ms 88952 KB Output is correct
41 Correct 79 ms 92748 KB Output is correct
42 Correct 99 ms 92936 KB Output is correct
43 Correct 100 ms 92852 KB Output is correct
44 Correct 104 ms 93012 KB Output is correct
45 Correct 97 ms 90320 KB Output is correct
46 Correct 76 ms 90620 KB Output is correct
47 Correct 86 ms 90556 KB Output is correct
48 Correct 106 ms 91444 KB Output is correct
49 Correct 115 ms 92900 KB Output is correct
50 Correct 68 ms 79904 KB Output is correct
51 Correct 64 ms 71500 KB Output is correct
52 Correct 106 ms 92412 KB Output is correct
53 Correct 110 ms 92984 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 50324 KB Output is correct
2 Correct 20 ms 50320 KB Output is correct
3 Correct 16 ms 50204 KB Output is correct
4 Correct 9 ms 24916 KB Output is correct
5 Correct 17 ms 50244 KB Output is correct
6 Correct 19 ms 50260 KB Output is correct
7 Correct 18 ms 50316 KB Output is correct
8 Correct 22 ms 50260 KB Output is correct
9 Correct 18 ms 50236 KB Output is correct
10 Correct 9 ms 24916 KB Output is correct
11 Correct 9 ms 25044 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 24916 KB Output is correct
2 Correct 9 ms 24916 KB Output is correct
3 Correct 17 ms 50420 KB Output is correct
4 Correct 20 ms 50516 KB Output is correct
5 Correct 10 ms 24916 KB Output is correct
6 Correct 16 ms 49996 KB Output is correct
7 Correct 398 ms 194532 KB Output is correct
8 Correct 901 ms 344036 KB Output is correct
9 Correct 865 ms 345452 KB Output is correct
10 Correct 858 ms 345732 KB Output is correct
11 Correct 306 ms 196176 KB Output is correct
12 Correct 568 ms 342564 KB Output is correct
13 Correct 615 ms 345716 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 49876 KB Output is correct
2 Correct 17 ms 50488 KB Output is correct
3 Correct 18 ms 50488 KB Output is correct
4 Correct 18 ms 50524 KB Output is correct
5 Correct 18 ms 50484 KB Output is correct
6 Correct 17 ms 50488 KB Output is correct
7 Correct 18 ms 50392 KB Output is correct
8 Correct 19 ms 50068 KB Output is correct
9 Correct 19 ms 50500 KB Output is correct
10 Correct 18 ms 50448 KB Output is correct
11 Correct 22 ms 50512 KB Output is correct
12 Correct 17 ms 50408 KB Output is correct
13 Correct 10 ms 24896 KB Output is correct
14 Correct 12 ms 24900 KB Output is correct
15 Correct 17 ms 49876 KB Output is correct
16 Correct 17 ms 49728 KB Output is correct
17 Correct 19 ms 51916 KB Output is correct
18 Correct 18 ms 51912 KB Output is correct
19 Correct 18 ms 51944 KB Output is correct
20 Correct 19 ms 51948 KB Output is correct
21 Correct 20 ms 51836 KB Output is correct
22 Correct 20 ms 51904 KB Output is correct
23 Correct 19 ms 51856 KB Output is correct
24 Correct 19 ms 51800 KB Output is correct
25 Correct 25 ms 56580 KB Output is correct
26 Correct 25 ms 56624 KB Output is correct
27 Correct 25 ms 56744 KB Output is correct
28 Correct 25 ms 56504 KB Output is correct
29 Correct 26 ms 56512 KB Output is correct
30 Correct 27 ms 56716 KB Output is correct
31 Correct 26 ms 56636 KB Output is correct
32 Correct 26 ms 56588 KB Output is correct
33 Correct 71 ms 88848 KB Output is correct
34 Correct 76 ms 92708 KB Output is correct
35 Correct 77 ms 88952 KB Output is correct
36 Correct 79 ms 92748 KB Output is correct
37 Correct 99 ms 92936 KB Output is correct
38 Correct 100 ms 92852 KB Output is correct
39 Correct 104 ms 93012 KB Output is correct
40 Correct 97 ms 90320 KB Output is correct
41 Correct 76 ms 90620 KB Output is correct
42 Correct 86 ms 90556 KB Output is correct
43 Correct 106 ms 91444 KB Output is correct
44 Correct 115 ms 92900 KB Output is correct
45 Correct 68 ms 79904 KB Output is correct
46 Correct 64 ms 71500 KB Output is correct
47 Correct 106 ms 92412 KB Output is correct
48 Correct 110 ms 92984 KB Output is correct
49 Correct 17 ms 50324 KB Output is correct
50 Correct 20 ms 50320 KB Output is correct
51 Correct 16 ms 50204 KB Output is correct
52 Correct 9 ms 24916 KB Output is correct
53 Correct 17 ms 50244 KB Output is correct
54 Correct 19 ms 50260 KB Output is correct
55 Correct 18 ms 50316 KB Output is correct
56 Correct 22 ms 50260 KB Output is correct
57 Correct 18 ms 50236 KB Output is correct
58 Correct 9 ms 24916 KB Output is correct
59 Correct 9 ms 25044 KB Output is correct
60 Correct 16 ms 49996 KB Output is correct
61 Correct 398 ms 194532 KB Output is correct
62 Correct 901 ms 344036 KB Output is correct
63 Correct 865 ms 345452 KB Output is correct
64 Correct 858 ms 345732 KB Output is correct
65 Correct 306 ms 196176 KB Output is correct
66 Correct 568 ms 342564 KB Output is correct
67 Correct 615 ms 345716 KB Output is correct
68 Correct 9 ms 24916 KB Output is correct
69 Correct 9 ms 24916 KB Output is correct
70 Correct 17 ms 50420 KB Output is correct
71 Correct 20 ms 50516 KB Output is correct
72 Correct 10 ms 24916 KB Output is correct
73 Correct 856 ms 315204 KB Output is correct
74 Correct 893 ms 346792 KB Output is correct
75 Correct 888 ms 315504 KB Output is correct
76 Correct 911 ms 346840 KB Output is correct
77 Correct 1421 ms 346844 KB Output is correct
78 Correct 719 ms 234400 KB Output is correct
79 Correct 815 ms 294440 KB Output is correct
80 Correct 1200 ms 355804 KB Output is correct
81 Correct 765 ms 229280 KB Output is correct
82 Correct 1012 ms 335364 KB Output is correct
83 Correct 1241 ms 345468 KB Output is correct
84 Correct 718 ms 226900 KB Output is correct
85 Correct 1195 ms 345468 KB Output is correct
86 Correct 1174 ms 337480 KB Output is correct
87 Correct 833 ms 288572 KB Output is correct
88 Correct 1336 ms 345432 KB Output is correct
89 Correct 1306 ms 345512 KB Output is correct
90 Correct 1313 ms 345524 KB Output is correct