oj.uz

답안 #293309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293309 2020-09-07T21:01:01 Z rqi Rectangles (IOI19_rect) C++14
100 / 100
 4861 ms 841092 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

template<class K,class V> using ht = gp_hash_table<
    K,
    null_type,
    hash<K>,
    equal_to<K>,
    direct_mask_range_hashing<>,
    linear_probe_fn<>,
    hash_standard_resize_policy<
      hash_exponential_size_policy<>,
      hash_load_check_resize_trigger<>,
      true
    >
>;

 
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
 
const int MOD = 1000000007;
 
#define ins insert
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define all(x) begin(x), end(x)
#define bk back()
 
const int mx = 2505;
int n, m;
 
ht<int, null_type> ints2[mx];
 
vpi queries[mx][mx];
vpi updates[mx][mx];

vpi res;
vi R;
vi cur;
 
vpi getInts(const vi &a){
	// cout << "Q: ";
	// for(auto u: a) cout << u << " ";
	// cout << "\n";

	res.clear();

	R = vi(sz(a), -1);
	cur.clear();
	for(int i = sz(a)-1; i >= 0; i--){
		while(sz(cur)){
			if(a[cur.bk] <= a[i]){
				cur.pop_back();
			}
			else break;
		}
		if(sz(cur)) R[i] = cur.bk;
		cur.pb(i);
	}
	cur.clear();
	for(int i = 0; i < sz(a); i++){
		while(sz(cur)){
			if(a[cur.bk] <= a[i]){
				cur.pop_back();
			}
			else break;
		}
		int L = -1;
		if(sz(cur)) L = cur.bk;
		cur.pb(i);
		if(R[i] != -1 && L != -1){
			res.pb(mp(L+1, R[i]-1));
		}
	}

	// vpi vals;
	// for(int i = 0; i < sz(a); i++){
	// 	vals.pb(mp(a[i], i));
	// }
	// sort(vals.rbegin(), vals.rend());

	// set<int> poses;
	// for(int i = 0; i < sz(vals); i++){
	// 	auto it1 = poses.lb(vals[i].s);
	// 	if(sz(poses) >= 2 && it1 != poses.end() && it1 != poses.begin()){
	// 		int p1 = *(prev(it1));
	// 		int p2 = *it1;
	// 		if(vals[i].f < min(a[p1], a[p2])){
	// 			res.pb(mp(p1+1, p2-1));
	// 		}
	// 	}
	// 	poses.ins(vals[i].s);
	// }

	// for(int i = 0; i < sz(vals); i++){
	// 	pair<pi, pi> b = *(prev(rang.lb(mp(mp(vals[i].s, MOD), mp(0, 0)))));
	// 	//cout << i << "\n";
	// 	assert(b.f.f <= vals[i].s && vals[i].s <= b.f.s);
	// 	rang.erase(b);
	// 	//if vals[i] is the max in range & if not on boundary
	// 	if(vals[i].f < min(b.s.f, b.s.s) && 1 <= b.f.f && b.f.s <= sz(a)-2){
	// 		res.pb(b.f);
	// 	}
	// 	//only divide if range added
	// 	if(b.f.f <= vals[i].s-1){
	// 		rang.ins(mp(mp(b.f.f, vals[i].s-1), mp(b.s.f, vals[i].f)));
	// 	}
	// 	if(vals[i].s+1 <= b.f.s){
	// 		rang.ins(mp(mp(vals[i].s+1, b.f.s), mp(vals[i].f, b.s.s)));
	// 	}
	// }
 
	// cout << "R: ";
	// for(auto u: res) cout << "(" << u.f << " " << u.s << "), ";
	// cout << "\n";
	return res;
}
 
int val[mx];
vi curin;
 
void upd(int a, int v){
	if(v == 1) curin.pb(a);
	for(; a < mx; a+=a&-a) val[a]+=v;
}
 
int sum(int a){
	int res = 0;
	for(; a > 0; a-=a&-a) res+=val[a];
	return res;
}
 
int query(int a, int b){
	return sum(b)-sum(a-1);
}
 
void clearBIT(){
	for(auto u: curin){
		upd(u, -1);
	}
	curin.clear();
}
 
ll count_rectangles(vector<vi> a){
	// clock_t c = clock();
	// cout << fixed << setprecision(5);
	// cout << double(clock()-c)/CLOCKS_PER_SEC << "\n";
	n = sz(a);
	m = sz(a[0]);
	// double r1 = 0;
	// double r2 = 0;
	for(int i = 1; i+1 < n; i++){
		vi nums;
		for(int j = 0; j < m; j++){
			nums.pb(a[i][j]);
		}
		
		// clock_t d = clock();
		vpi a = getInts(nums);
		// r1+=double(clock()-d)/CLOCKS_PER_SEC;
		// d = clock();
		for(auto u: a){
			ints2[i].ins(mx*u.f+u.s);
		}
		// r2+=double(clock()-d)/CLOCKS_PER_SEC;
		// d = clock();
	}
	// cout << "r1: " << r1 << "\n";
	// cout << "r2: " << r2 << "\n";
 	// cout << double(clock()-c)/CLOCKS_PER_SEC << "\n";
	ht<int, null_type> vals;
 
	for(int i = 1; i+1 < n; i++){
		vals = ints2[i];
		for(auto x: vals){
			int j = x/mx;
			int u = x % mx;
			for(int K = i; K+1 < n; K++){
				if(ints2[K+1].find(mx*j+u) == ints2[K+1].end()){
					for(int k = i; k <= K; k++){
						queries[k][j].pb(mp(K, u));
						//cout << "Q: " << k << " " << j << " " << K << " " << u << "\n";
						ints2[k].erase(mx*j+u);
					}
					break;
				}
			}
		}
	}
 	// cout << double(clock()-c)/CLOCKS_PER_SEC << "\n";
	for(int i = 0; i < mx; i++){
		ints2[i].clear();
	}
 
	for(int j = 1; j+1 < m; j++){
		//cout << "j: " << j << "\n";
		vi nums;
		for(int i = 0; i < n; i++){
			nums.pb(a[i][j]);
		}
		vpi a = getInts(nums);
		// cout << "a: " << "\n";
		// for(auto u: a){
		// 	cout << u.f << " " << u.s << "\n";
		// }
		for(auto u: a){
			ints2[j].ins(mx*u.f+u.s);
			//ints[u.f][j].ins(u.s);
		}
	}
 
	
	for(int j = 1; j+1 < m; j++){
		vals = ints2[j];
		for(auto x: vals){
			int i = x/mx;
			int u = x % mx;
			for(int K = j; K+1 < m; K++){
				if(ints2[K+1].find(mx*i+u) == ints2[K+1].end()){
					for(int k = j; k <= K; k++){
						updates[i][k].pb(mp(u, K));
						//cout << "U: " << i << " " << k << " " << u << " " << K << "\n";
						//cout << i << " " << j << " " << k << "\n";
						ints2[k].erase(mx*i+u);
					}
					break;
				}
			}
		}
	}
 	
 	// cout << double(clock()-c)/CLOCKS_PER_SEC << "\n";

	ll ans = 0;
 
	for(int i = 1; i+1 < n; i++){
		for(int j = 1; j+1 < m; j++){
			sort(all(queries[i][j]));
			sort(all(updates[i][j]));
			int updind = 0;
			for(auto u: queries[i][j]){
				while(updind < sz(updates[i][j])){
					if(updates[i][j][updind].f <= u.f){
						upd(updates[i][j][updind].s, 1);
						updind++;
					}
					else break;
				}
				//if(query(u.s, 2504) > 0) cout << i << " " << j << "\n";
				ans+=query(u.s, 2504); //number of things >=
			}
			clearBIT();
		}
	}
 	// cout << double(clock()-c)/CLOCKS_PER_SEC << "\n";
	return ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 295548 KB Output is correct
2 Correct 189 ms 295544 KB Output is correct
3 Correct 186 ms 295672 KB Output is correct
4 Correct 190 ms 295544 KB Output is correct
5 Correct 186 ms 295416 KB Output is correct
6 Correct 189 ms 295544 KB Output is correct
7 Correct 190 ms 295544 KB Output is correct
8 Correct 191 ms 295544 KB Output is correct
9 Correct 186 ms 295512 KB Output is correct
10 Correct 188 ms 295544 KB Output is correct
11 Correct 186 ms 295544 KB Output is correct
12 Correct 187 ms 295548 KB Output is correct
13 Correct 188 ms 295416 KB Output is correct
14 Correct 189 ms 295416 KB Output is correct
15 Correct 190 ms 295416 KB Output is correct
16 Correct 186 ms 295424 KB Output is correct
17 Correct 187 ms 295420 KB Output is correct
18 Correct 185 ms 295516 KB Output is correct
19 Correct 185 ms 295548 KB Output is correct
20 Correct 184 ms 295476 KB Output is correct
21 Correct 185 ms 295416 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 295548 KB Output is correct
2 Correct 189 ms 295544 KB Output is correct
3 Correct 186 ms 295672 KB Output is correct
4 Correct 190 ms 295544 KB Output is correct
5 Correct 186 ms 295416 KB Output is correct
6 Correct 189 ms 295544 KB Output is correct
7 Correct 190 ms 295544 KB Output is correct
8 Correct 191 ms 295544 KB Output is correct
9 Correct 186 ms 295512 KB Output is correct
10 Correct 188 ms 295544 KB Output is correct
11 Correct 186 ms 295544 KB Output is correct
12 Correct 187 ms 295548 KB Output is correct
13 Correct 188 ms 295416 KB Output is correct
14 Correct 189 ms 295416 KB Output is correct
15 Correct 190 ms 295416 KB Output is correct
16 Correct 186 ms 295424 KB Output is correct
17 Correct 194 ms 296056 KB Output is correct
18 Correct 191 ms 295928 KB Output is correct
19 Correct 193 ms 295928 KB Output is correct
20 Correct 190 ms 295800 KB Output is correct
21 Correct 192 ms 295800 KB Output is correct
22 Correct 195 ms 295804 KB Output is correct
23 Correct 193 ms 295800 KB Output is correct
24 Correct 189 ms 295684 KB Output is correct
25 Correct 187 ms 295420 KB Output is correct
26 Correct 185 ms 295516 KB Output is correct
27 Correct 185 ms 295548 KB Output is correct
28 Correct 184 ms 295476 KB Output is correct
29 Correct 185 ms 295416 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 295548 KB Output is correct
2 Correct 189 ms 295544 KB Output is correct
3 Correct 186 ms 295672 KB Output is correct
4 Correct 190 ms 295544 KB Output is correct
5 Correct 186 ms 295416 KB Output is correct
6 Correct 189 ms 295544 KB Output is correct
7 Correct 190 ms 295544 KB Output is correct
8 Correct 191 ms 295544 KB Output is correct
9 Correct 186 ms 295512 KB Output is correct
10 Correct 188 ms 295544 KB Output is correct
11 Correct 186 ms 295544 KB Output is correct
12 Correct 187 ms 295548 KB Output is correct
13 Correct 188 ms 295416 KB Output is correct
14 Correct 189 ms 295416 KB Output is correct
15 Correct 190 ms 295416 KB Output is correct
16 Correct 186 ms 295424 KB Output is correct
17 Correct 194 ms 296056 KB Output is correct
18 Correct 191 ms 295928 KB Output is correct
19 Correct 193 ms 295928 KB Output is correct
20 Correct 190 ms 295800 KB Output is correct
21 Correct 192 ms 295800 KB Output is correct
22 Correct 195 ms 295804 KB Output is correct
23 Correct 193 ms 295800 KB Output is correct
24 Correct 189 ms 295684 KB Output is correct
25 Correct 205 ms 298668 KB Output is correct
26 Correct 203 ms 298616 KB Output is correct
27 Correct 205 ms 298616 KB Output is correct
28 Correct 198 ms 296696 KB Output is correct
29 Correct 221 ms 297336 KB Output is correct
30 Correct 212 ms 297340 KB Output is correct
31 Correct 210 ms 297336 KB Output is correct
32 Correct 212 ms 297336 KB Output is correct
33 Correct 187 ms 295420 KB Output is correct
34 Correct 185 ms 295516 KB Output is correct
35 Correct 185 ms 295548 KB Output is correct
36 Correct 184 ms 295476 KB Output is correct
37 Correct 185 ms 295416 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 295548 KB Output is correct
2 Correct 189 ms 295544 KB Output is correct
3 Correct 186 ms 295672 KB Output is correct
4 Correct 190 ms 295544 KB Output is correct
5 Correct 186 ms 295416 KB Output is correct
6 Correct 189 ms 295544 KB Output is correct
7 Correct 190 ms 295544 KB Output is correct
8 Correct 191 ms 295544 KB Output is correct
9 Correct 186 ms 295512 KB Output is correct
10 Correct 188 ms 295544 KB Output is correct
11 Correct 186 ms 295544 KB Output is correct
12 Correct 187 ms 295548 KB Output is correct
13 Correct 188 ms 295416 KB Output is correct
14 Correct 189 ms 295416 KB Output is correct
15 Correct 190 ms 295416 KB Output is correct
16 Correct 186 ms 295424 KB Output is correct
17 Correct 194 ms 296056 KB Output is correct
18 Correct 191 ms 295928 KB Output is correct
19 Correct 193 ms 295928 KB Output is correct
20 Correct 190 ms 295800 KB Output is correct
21 Correct 192 ms 295800 KB Output is correct
22 Correct 195 ms 295804 KB Output is correct
23 Correct 193 ms 295800 KB Output is correct
24 Correct 189 ms 295684 KB Output is correct
25 Correct 205 ms 298668 KB Output is correct
26 Correct 203 ms 298616 KB Output is correct
27 Correct 205 ms 298616 KB Output is correct
28 Correct 198 ms 296696 KB Output is correct
29 Correct 221 ms 297336 KB Output is correct
30 Correct 212 ms 297340 KB Output is correct
31 Correct 210 ms 297336 KB Output is correct
32 Correct 212 ms 297336 KB Output is correct
33 Correct 326 ms 314948 KB Output is correct
34 Correct 328 ms 310060 KB Output is correct
35 Correct 299 ms 312952 KB Output is correct
36 Correct 312 ms 308088 KB Output is correct
37 Correct 418 ms 335604 KB Output is correct
38 Correct 433 ms 335544 KB Output is correct
39 Correct 419 ms 335480 KB Output is correct
40 Correct 400 ms 333256 KB Output is correct
41 Correct 318 ms 307192 KB Output is correct
42 Correct 360 ms 310136 KB Output is correct
43 Correct 517 ms 319728 KB Output is correct
44 Correct 526 ms 319656 KB Output is correct
45 Correct 353 ms 307652 KB Output is correct
46 Correct 349 ms 307532 KB Output is correct
47 Correct 496 ms 318712 KB Output is correct
48 Correct 510 ms 318840 KB Output is correct
49 Correct 187 ms 295420 KB Output is correct
50 Correct 185 ms 295516 KB Output is correct
51 Correct 185 ms 295548 KB Output is correct
52 Correct 184 ms 295476 KB Output is correct
53 Correct 185 ms 295416 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 189 ms 295860 KB Output is correct
2 Correct 188 ms 295872 KB Output is correct
3 Correct 185 ms 295548 KB Output is correct
4 Correct 188 ms 295416 KB Output is correct
5 Correct 190 ms 295800 KB Output is correct
6 Correct 185 ms 295800 KB Output is correct
7 Correct 187 ms 295764 KB Output is correct
8 Correct 186 ms 295800 KB Output is correct
9 Correct 192 ms 295800 KB Output is correct
10 Correct 189 ms 295544 KB Output is correct
11 Correct 186 ms 295548 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 189 ms 295528 KB Output is correct
2 Correct 988 ms 362952 KB Output is correct
3 Correct 1961 ms 441976 KB Output is correct
4 Correct 1970 ms 454992 KB Output is correct
5 Correct 1958 ms 454868 KB Output is correct
6 Correct 335 ms 325948 KB Output is correct
7 Correct 498 ms 353144 KB Output is correct
8 Correct 507 ms 356984 KB Output is correct
9 Correct 187 ms 295420 KB Output is correct
10 Correct 185 ms 295516 KB Output is correct
11 Correct 185 ms 295548 KB Output is correct
12 Correct 184 ms 295476 KB Output is correct
13 Correct 185 ms 295416 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 295548 KB Output is correct
2 Correct 189 ms 295544 KB Output is correct
3 Correct 186 ms 295672 KB Output is correct
4 Correct 190 ms 295544 KB Output is correct
5 Correct 186 ms 295416 KB Output is correct
6 Correct 189 ms 295544 KB Output is correct
7 Correct 190 ms 295544 KB Output is correct
8 Correct 191 ms 295544 KB Output is correct
9 Correct 186 ms 295512 KB Output is correct
10 Correct 188 ms 295544 KB Output is correct
11 Correct 186 ms 295544 KB Output is correct
12 Correct 187 ms 295548 KB Output is correct
13 Correct 188 ms 295416 KB Output is correct
14 Correct 189 ms 295416 KB Output is correct
15 Correct 190 ms 295416 KB Output is correct
16 Correct 186 ms 295424 KB Output is correct
17 Correct 194 ms 296056 KB Output is correct
18 Correct 191 ms 295928 KB Output is correct
19 Correct 193 ms 295928 KB Output is correct
20 Correct 190 ms 295800 KB Output is correct
21 Correct 192 ms 295800 KB Output is correct
22 Correct 195 ms 295804 KB Output is correct
23 Correct 193 ms 295800 KB Output is correct
24 Correct 189 ms 295684 KB Output is correct
25 Correct 205 ms 298668 KB Output is correct
26 Correct 203 ms 298616 KB Output is correct
27 Correct 205 ms 298616 KB Output is correct
28 Correct 198 ms 296696 KB Output is correct
29 Correct 221 ms 297336 KB Output is correct
30 Correct 212 ms 297340 KB Output is correct
31 Correct 210 ms 297336 KB Output is correct
32 Correct 212 ms 297336 KB Output is correct
33 Correct 326 ms 314948 KB Output is correct
34 Correct 328 ms 310060 KB Output is correct
35 Correct 299 ms 312952 KB Output is correct
36 Correct 312 ms 308088 KB Output is correct
37 Correct 418 ms 335604 KB Output is correct
38 Correct 433 ms 335544 KB Output is correct
39 Correct 419 ms 335480 KB Output is correct
40 Correct 400 ms 333256 KB Output is correct
41 Correct 318 ms 307192 KB Output is correct
42 Correct 360 ms 310136 KB Output is correct
43 Correct 517 ms 319728 KB Output is correct
44 Correct 526 ms 319656 KB Output is correct
45 Correct 353 ms 307652 KB Output is correct
46 Correct 349 ms 307532 KB Output is correct
47 Correct 496 ms 318712 KB Output is correct
48 Correct 510 ms 318840 KB Output is correct
49 Correct 189 ms 295860 KB Output is correct
50 Correct 188 ms 295872 KB Output is correct
51 Correct 185 ms 295548 KB Output is correct
52 Correct 188 ms 295416 KB Output is correct
53 Correct 190 ms 295800 KB Output is correct
54 Correct 185 ms 295800 KB Output is correct
55 Correct 187 ms 295764 KB Output is correct
56 Correct 186 ms 295800 KB Output is correct
57 Correct 192 ms 295800 KB Output is correct
58 Correct 189 ms 295544 KB Output is correct
59 Correct 186 ms 295548 KB Output is correct
60 Correct 189 ms 295528 KB Output is correct
61 Correct 988 ms 362952 KB Output is correct
62 Correct 1961 ms 441976 KB Output is correct
63 Correct 1970 ms 454992 KB Output is correct
64 Correct 1958 ms 454868 KB Output is correct
65 Correct 335 ms 325948 KB Output is correct
66 Correct 498 ms 353144 KB Output is correct
67 Correct 507 ms 356984 KB Output is correct
68 Correct 2231 ms 560808 KB Output is correct
69 Correct 2617 ms 501992 KB Output is correct
70 Correct 1799 ms 538616 KB Output is correct
71 Correct 1647 ms 477744 KB Output is correct
72 Correct 4286 ms 827640 KB Output is correct
73 Correct 2864 ms 488252 KB Output is correct
74 Correct 3123 ms 506624 KB Output is correct
75 Correct 4751 ms 643236 KB Output is correct
76 Correct 3153 ms 484816 KB Output is correct
77 Correct 3827 ms 576916 KB Output is correct
78 Correct 4861 ms 633772 KB Output is correct
79 Correct 2734 ms 472652 KB Output is correct
80 Correct 4633 ms 636664 KB Output is correct
81 Correct 4540 ms 623660 KB Output is correct
82 Correct 2478 ms 617140 KB Output is correct
83 Correct 4178 ms 827536 KB Output is correct
84 Correct 4267 ms 828148 KB Output is correct
85 Correct 4238 ms 841092 KB Output is correct
86 Correct 187 ms 295420 KB Output is correct
87 Correct 185 ms 295516 KB Output is correct
88 Correct 185 ms 295548 KB Output is correct
89 Correct 184 ms 295476 KB Output is correct
90 Correct 185 ms 295416 KB Output is correct