oj.uz

답안 #154562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154562 2019-09-22T17:48:57 Z liwi Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 1024168 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4,popcnt,abm,mmx,tune=native")

#include <bits/stdc++.h>

//using namespace std;

#define INT_INF 0x3f3f3f3f
#define mp std::make_pair

#define MAXN 2501

typedef long long ll;
typedef std::pair<int,int> pii;

int num_rows,num_cols,arr[MAXN][MAXN],bit[MAXN],cnt[MAXN][MAXN],ans,l,r,lst[MAXN],pp;
std::vector<pii> row_dp[MAXN][MAXN],col_dp[MAXN][MAXN];
std::vector<std::pair<pii,int>> dep[MAXN];
pii dq[MAXN];

inline void update(int i, int val, int curr){
	for(; i<=num_cols; i+=i&-i){
		if(lst[i] != curr) bit[i] = val, lst[i] = curr;
		else bit[i]+=val;
	}
}

inline int query(int i, int curr){
	int res = 0;
	for(; i>0; i-=i&-i)
		if(lst[i] == curr)
			res+=bit[i];
	return res;
}

inline void init_rows(){
//	memset(cnt,0,sizeof cnt);
	for(int i=2; i<num_rows; i++){
		l = 1, r = 0;
		for(int k=1; k<=num_cols; k++){
			while(r-l+1 > 0 && dq[r].first < arr[i][k]) r--;
			int lft = (r-l+1>0?dq[r].second:INT_INF);
			if(lft < k-1 && (row_dp[lft+1][k-1].empty() || row_dp[lft+1][k-1].back().first != i))
				row_dp[lft+1][k-1].emplace_back(i,i), cnt[lft+1][k-1]++; //rows[i].pb(mp(lft+1,k-1));
			while(r-l+1 > 0 && dq[r].first == arr[i][k]) r--;
			dq[++r] = mp(arr[i][k],k);
		}
		l = 1, r = 0;
		for(int k=num_cols; k>=1; k--){
			while(r-l+1 > 0 && dq[r].first < arr[i][k]) r--;
			int rgt = (r-l+1>0?dq[r].second:-INT_INF);
			if(rgt > k+1 && (row_dp[k+1][rgt-1].empty() || row_dp[k+1][rgt-1].back().first != i))
				row_dp[k+1][rgt-1].emplace_back(i,i), cnt[k+1][rgt-1]++; //rows[i].pb(mp(k+1,rgt-1));
			while(r-l+1 > 0 && dq[r].first == arr[i][k]) r--;
			dq[++r] = mp(arr[i][k],k);
		}
	}
}

inline void init_cols(){
	memset(cnt,0,sizeof cnt);
	for(int i=2; i<num_cols; i++){
		l = 1, r = 0;
		for(int k=1; k<=num_rows; k++){
			while(r-l+1 > 0 && dq[r].first < arr[k][i]) r--;
			int lft = (r-l+1>0?dq[r].second:INT_INF);
			if(lft < k-1 && (col_dp[lft+1][k-1].empty() || col_dp[lft+1][k-1].back().first != i))
				col_dp[lft+1][k-1].emplace_back(i,i), cnt[lft+1][k-1]++; //cols[i].pb(mp(lft+1,k-1));
			while(r-l+1 > 0 && dq[r].first == arr[k][i]) r--;
			dq[++r] = mp(arr[k][i],k);
		}
		l = 1, r = 0;
		for(int k=num_rows; k>=1; k--){
			while(r-l+1 > 0 && dq[r].first < arr[k][i]) r--;
			int rgt = (r-l+1>0?dq[r].second:-INT_INF);
			if(rgt > k+1 && (col_dp[k+1][rgt-1].empty() || col_dp[k+1][rgt-1].back().first != i))
				col_dp[k+1][rgt-1].emplace_back(i,i), cnt[k+1][rgt-1]++; //cols[i].pb(mp(k+1,rgt-1));
			while(r-l+1 > 0 && dq[r].first == arr[k][i]) r--;
			dq[++r] = mp(arr[k][i],k);
		}
	}
}

inline void calc_hor_dp(){
//	for(int i=2; i<num_rows; i++){
//		sort(all(rows[i])); complete_unique(rows[i]);
//		for(pii check:rows[i]){
//			h_segs[check.first][check.second].pb(i);
////			r_range[i][check.first].pb(check.second);
//		}
//		rows[i].clear();
//	}
	for(int l=2; l<=num_cols-1; l++){
		for(int r=l; r<=num_cols-1; r++){
			if(cnt[l][r] == 0) continue;
			#define nums row_dp[l][r]
//			std::vector<pii> &nums = row_dp[l][r];
//			sort(all(nums)); complete_unique(nums);
//			std::vector<pii> t;
			int lst = 0;
			for(int i=1; i<cnt[l][r]; i++){
				if(nums[i].first == nums[i-1].first+1) continue;
				for(int k=nums[lst].first; k<=nums[i-1].first; k++)
					dep[nums[i-1].first-k+1].emplace_back(mp(k,l),r);
//					row_dp[k][l].pb(mp(nums[i-1].first-k+1,r));
				lst = i;
			}
			for(int k=nums[lst].first; k<=nums[cnt[l][r]-1].first; k++)
				dep[nums[cnt[l][r]-1].first-k+1].emplace_back(mp(k,l),r);
//				row_dp[k][l].pb(mp(nums[cnt[l][r]-1].first-k+1,r));
			nums.clear();
		}
	}
	for(int i=1; i<=num_rows; i++){
		for(auto &check:dep[i])
			row_dp[check.first.first][check.first.second].emplace_back(i,check.second);
	}
//	for(int l=2; l<=num_cols-1; l++){
//		for(int r=l; r<=num_cols-1; r++){
//			reverse(all(row_dp[l][r]));
//			while(cnt[l][r]--) row_dp[l][r].pop_back();
//			reverse(all(row_dp[l][r]));
//		}
//	}
}

inline void calc_col_dp(){
//	for(int i=2; i<num_cols; i++){
//		sort(all(cols[i])); complete_unique(cols[i]);
//		for(pii check:cols[i]){
//			v_segs[check.first][check.second].pb(i);
////			v_range[check.first][i].pb(check.second);
//		}
//		cols[i].clear();
//	}
	for(int l=2; l<=num_rows-1; l++){
		for(int r=l; r<=num_rows-1; r++){
			if(cnt[l][r] == 0) continue;
			#define nums col_dp[l][r]
//			std::vector<pii> &nums = col_dp[l][r];
//			sort(all(nums)); complete_unique(nums);
			int lst = 0;
			for(int i=1; i<cnt[l][r]; i++){
				if(nums[i].first == nums[i-1].first+1) continue;
				for(int k=nums[lst].first; k<=nums[i-1].first; k++)
					col_dp[l][k].emplace_back(r,nums[i-1].first);
				lst = i;
			}
			for(int k=nums[lst].first; k<=nums[cnt[l][r]-1].first; k++)
				col_dp[l][k].emplace_back(r,nums[cnt[l][r]-1].first);
		}
	}
//	for(int l=2; l<=num_cols-1; l++){
//		for(int r=l; r<=num_cols-1; r++){
//			reverse(all(col_dp[l][r]));
//			while(cnt[l][r]--) col_dp[l][r].pop_back();
//			reverse(all(col_dp[l][r]));
//		}
//	}
}

ll count_rectangles(std::vector<std::vector<int>> a){
	ans = 0, num_rows = (int)a.size(), num_cols = (int)a[0].size();
	for(int i=0; i<a.size(); i++)
		for(int k=0; k<a[i].size(); k++)
			arr[i+1][k+1] = a[i][k];
	init_rows(); calc_hor_dp();
	init_cols(); calc_col_dp();
	for(int i=num_rows-1; i>=2; i--){
		for(int k=num_cols-1; k>=2; k--){
//			sort(all(row_dp[i][k]));
//			sort(all(col_dp[i][k]));
			int ptr = cnt[i][k], res = 0, cc = 0; ++pp;
			for(int v=0; v<row_dp[i][k].size(); v++){
//				pii curr = row_dp[i][k][v];
				while(ptr < col_dp[i][k].size() && col_dp[i][k][ptr].first-i+1 <= row_dp[i][k][v].first){
//					assert(col_dp[i][k][ptr].second>=k);
					update(col_dp[i][k][ptr].second-k+1,1,pp);
					ptr++, cc++;
				}
				res+=cc-query(row_dp[i][k][v].second-k,pp);
			}
//			while(--ptr >= cnt[i][k]) update(col_dp[i][k][ptr].second-k+1,-1);
			ans+=res;
		}
	}
	return ans;
}

Compilation message

rect.cpp:140:0: warning: "nums" redefined
    #define nums col_dp[l][r]
 
rect.cpp:97:0: note: this is the location of the previous definition
    #define nums row_dp[l][r]
 
rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:165:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<a.size(); i++)
               ~^~~~~~~~~
rect.cpp:166:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<a[i].size(); k++)
                ~^~~~~~~~~~~~
rect.cpp:175:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int v=0; v<row_dp[i][k].size(); v++){
                 ~^~~~~~~~~~~~~~~~~~~~
rect.cpp:177:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ptr < col_dp[i][k].size() && col_dp[i][k][ptr].first-i+1 <= row_dp[i][k][v].first){
           ~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 318712 KB Output is correct
2 Correct 310 ms 318992 KB Output is correct
3 Correct 314 ms 318800 KB Output is correct
4 Correct 330 ms 318912 KB Output is correct
5 Correct 310 ms 319016 KB Output is correct
6 Correct 312 ms 318968 KB Output is correct
7 Correct 310 ms 318840 KB Output is correct
8 Correct 312 ms 318808 KB Output is correct
9 Correct 312 ms 318856 KB Output is correct
10 Correct 310 ms 318900 KB Output is correct
11 Correct 312 ms 318848 KB Output is correct
12 Correct 360 ms 318784 KB Output is correct
13 Correct 313 ms 318592 KB Output is correct
14 Correct 309 ms 318716 KB Output is correct
15 Correct 328 ms 318768 KB Output is correct
16 Correct 309 ms 318812 KB Output is correct
17 Correct 311 ms 318712 KB Output is correct
18 Correct 309 ms 318620 KB Output is correct
19 Correct 322 ms 318816 KB Output is correct
20 Correct 344 ms 318824 KB Output is correct
21 Correct 313 ms 318688 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 318712 KB Output is correct
2 Correct 310 ms 318992 KB Output is correct
3 Correct 314 ms 318800 KB Output is correct
4 Correct 330 ms 318912 KB Output is correct
5 Correct 310 ms 319016 KB Output is correct
6 Correct 312 ms 318968 KB Output is correct
7 Correct 310 ms 318840 KB Output is correct
8 Correct 312 ms 318808 KB Output is correct
9 Correct 312 ms 318856 KB Output is correct
10 Correct 310 ms 318900 KB Output is correct
11 Correct 312 ms 318848 KB Output is correct
12 Correct 360 ms 318784 KB Output is correct
13 Correct 313 ms 318592 KB Output is correct
14 Correct 309 ms 318716 KB Output is correct
15 Correct 328 ms 318768 KB Output is correct
16 Correct 309 ms 318812 KB Output is correct
17 Correct 315 ms 319708 KB Output is correct
18 Correct 329 ms 319748 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 311 ms 319224 KB Output is correct
21 Correct 318 ms 319584 KB Output is correct
22 Correct 317 ms 319480 KB Output is correct
23 Correct 314 ms 319480 KB Output is correct
24 Correct 313 ms 319224 KB Output is correct
25 Correct 311 ms 318712 KB Output is correct
26 Correct 309 ms 318620 KB Output is correct
27 Correct 322 ms 318816 KB Output is correct
28 Correct 344 ms 318824 KB Output is correct
29 Correct 313 ms 318688 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 318712 KB Output is correct
2 Correct 310 ms 318992 KB Output is correct
3 Correct 314 ms 318800 KB Output is correct
4 Correct 330 ms 318912 KB Output is correct
5 Correct 310 ms 319016 KB Output is correct
6 Correct 312 ms 318968 KB Output is correct
7 Correct 310 ms 318840 KB Output is correct
8 Correct 312 ms 318808 KB Output is correct
9 Correct 312 ms 318856 KB Output is correct
10 Correct 310 ms 318900 KB Output is correct
11 Correct 312 ms 318848 KB Output is correct
12 Correct 360 ms 318784 KB Output is correct
13 Correct 313 ms 318592 KB Output is correct
14 Correct 309 ms 318716 KB Output is correct
15 Correct 328 ms 318768 KB Output is correct
16 Correct 309 ms 318812 KB Output is correct
17 Correct 315 ms 319708 KB Output is correct
18 Correct 329 ms 319748 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 311 ms 319224 KB Output is correct
21 Correct 318 ms 319584 KB Output is correct
22 Correct 317 ms 319480 KB Output is correct
23 Correct 314 ms 319480 KB Output is correct
24 Correct 313 ms 319224 KB Output is correct
25 Correct 331 ms 323960 KB Output is correct
26 Correct 328 ms 323960 KB Output is correct
27 Correct 369 ms 324036 KB Output is correct
28 Correct 326 ms 321488 KB Output is correct
29 Correct 332 ms 322820 KB Output is correct
30 Correct 334 ms 323104 KB Output is correct
31 Correct 333 ms 322868 KB Output is correct
32 Correct 332 ms 322740 KB Output is correct
33 Correct 311 ms 318712 KB Output is correct
34 Correct 309 ms 318620 KB Output is correct
35 Correct 322 ms 318816 KB Output is correct
36 Correct 344 ms 318824 KB Output is correct
37 Correct 313 ms 318688 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 318712 KB Output is correct
2 Correct 310 ms 318992 KB Output is correct
3 Correct 314 ms 318800 KB Output is correct
4 Correct 330 ms 318912 KB Output is correct
5 Correct 310 ms 319016 KB Output is correct
6 Correct 312 ms 318968 KB Output is correct
7 Correct 310 ms 318840 KB Output is correct
8 Correct 312 ms 318808 KB Output is correct
9 Correct 312 ms 318856 KB Output is correct
10 Correct 310 ms 318900 KB Output is correct
11 Correct 312 ms 318848 KB Output is correct
12 Correct 360 ms 318784 KB Output is correct
13 Correct 313 ms 318592 KB Output is correct
14 Correct 309 ms 318716 KB Output is correct
15 Correct 328 ms 318768 KB Output is correct
16 Correct 309 ms 318812 KB Output is correct
17 Correct 315 ms 319708 KB Output is correct
18 Correct 329 ms 319748 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 311 ms 319224 KB Output is correct
21 Correct 318 ms 319584 KB Output is correct
22 Correct 317 ms 319480 KB Output is correct
23 Correct 314 ms 319480 KB Output is correct
24 Correct 313 ms 319224 KB Output is correct
25 Correct 331 ms 323960 KB Output is correct
26 Correct 328 ms 323960 KB Output is correct
27 Correct 369 ms 324036 KB Output is correct
28 Correct 326 ms 321488 KB Output is correct
29 Correct 332 ms 322820 KB Output is correct
30 Correct 334 ms 323104 KB Output is correct
31 Correct 333 ms 322868 KB Output is correct
32 Correct 332 ms 322740 KB Output is correct
33 Correct 492 ms 355072 KB Output is correct
34 Correct 462 ms 354148 KB Output is correct
35 Correct 450 ms 354248 KB Output is correct
36 Correct 406 ms 353304 KB Output is correct
37 Correct 519 ms 379580 KB Output is correct
38 Correct 530 ms 379588 KB Output is correct
39 Correct 518 ms 379264 KB Output is correct
40 Correct 504 ms 375644 KB Output is correct
41 Correct 434 ms 340116 KB Output is correct
42 Correct 486 ms 345048 KB Output is correct
43 Correct 708 ms 362144 KB Output is correct
44 Correct 665 ms 363416 KB Output is correct
45 Correct 508 ms 342812 KB Output is correct
46 Correct 470 ms 341400 KB Output is correct
47 Correct 613 ms 360576 KB Output is correct
48 Correct 620 ms 361244 KB Output is correct
49 Correct 311 ms 318712 KB Output is correct
50 Correct 309 ms 318620 KB Output is correct
51 Correct 322 ms 318816 KB Output is correct
52 Correct 344 ms 318824 KB Output is correct
53 Correct 313 ms 318688 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 321 ms 319076 KB Output is correct
2 Correct 316 ms 319108 KB Output is correct
3 Correct 321 ms 318712 KB Output is correct
4 Correct 311 ms 318652 KB Output is correct
5 Correct 320 ms 318968 KB Output is correct
6 Correct 322 ms 319028 KB Output is correct
7 Correct 321 ms 318968 KB Output is correct
8 Correct 330 ms 318960 KB Output is correct
9 Correct 325 ms 319208 KB Output is correct
10 Correct 322 ms 318652 KB Output is correct
11 Correct 337 ms 318816 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 318760 KB Output is correct
2 Correct 1147 ms 427948 KB Output is correct
3 Correct 2250 ms 550336 KB Output is correct
4 Correct 2293 ms 551072 KB Output is correct
5 Correct 2269 ms 551244 KB Output is correct
6 Correct 465 ms 357840 KB Output is correct
7 Correct 622 ms 392672 KB Output is correct
8 Correct 644 ms 395704 KB Output is correct
9 Correct 311 ms 318712 KB Output is correct
10 Correct 309 ms 318620 KB Output is correct
11 Correct 322 ms 318816 KB Output is correct
12 Correct 344 ms 318824 KB Output is correct
13 Correct 313 ms 318688 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 318712 KB Output is correct
2 Correct 310 ms 318992 KB Output is correct
3 Correct 314 ms 318800 KB Output is correct
4 Correct 330 ms 318912 KB Output is correct
5 Correct 310 ms 319016 KB Output is correct
6 Correct 312 ms 318968 KB Output is correct
7 Correct 310 ms 318840 KB Output is correct
8 Correct 312 ms 318808 KB Output is correct
9 Correct 312 ms 318856 KB Output is correct
10 Correct 310 ms 318900 KB Output is correct
11 Correct 312 ms 318848 KB Output is correct
12 Correct 360 ms 318784 KB Output is correct
13 Correct 313 ms 318592 KB Output is correct
14 Correct 309 ms 318716 KB Output is correct
15 Correct 328 ms 318768 KB Output is correct
16 Correct 309 ms 318812 KB Output is correct
17 Correct 315 ms 319708 KB Output is correct
18 Correct 329 ms 319748 KB Output is correct
19 Correct 311 ms 319736 KB Output is correct
20 Correct 311 ms 319224 KB Output is correct
21 Correct 318 ms 319584 KB Output is correct
22 Correct 317 ms 319480 KB Output is correct
23 Correct 314 ms 319480 KB Output is correct
24 Correct 313 ms 319224 KB Output is correct
25 Correct 331 ms 323960 KB Output is correct
26 Correct 328 ms 323960 KB Output is correct
27 Correct 369 ms 324036 KB Output is correct
28 Correct 326 ms 321488 KB Output is correct
29 Correct 332 ms 322820 KB Output is correct
30 Correct 334 ms 323104 KB Output is correct
31 Correct 333 ms 322868 KB Output is correct
32 Correct 332 ms 322740 KB Output is correct
33 Correct 492 ms 355072 KB Output is correct
34 Correct 462 ms 354148 KB Output is correct
35 Correct 450 ms 354248 KB Output is correct
36 Correct 406 ms 353304 KB Output is correct
37 Correct 519 ms 379580 KB Output is correct
38 Correct 530 ms 379588 KB Output is correct
39 Correct 518 ms 379264 KB Output is correct
40 Correct 504 ms 375644 KB Output is correct
41 Correct 434 ms 340116 KB Output is correct
42 Correct 486 ms 345048 KB Output is correct
43 Correct 708 ms 362144 KB Output is correct
44 Correct 665 ms 363416 KB Output is correct
45 Correct 508 ms 342812 KB Output is correct
46 Correct 470 ms 341400 KB Output is correct
47 Correct 613 ms 360576 KB Output is correct
48 Correct 620 ms 361244 KB Output is correct
49 Correct 321 ms 319076 KB Output is correct
50 Correct 316 ms 319108 KB Output is correct
51 Correct 321 ms 318712 KB Output is correct
52 Correct 311 ms 318652 KB Output is correct
53 Correct 320 ms 318968 KB Output is correct
54 Correct 322 ms 319028 KB Output is correct
55 Correct 321 ms 318968 KB Output is correct
56 Correct 330 ms 318960 KB Output is correct
57 Correct 325 ms 319208 KB Output is correct
58 Correct 322 ms 318652 KB Output is correct
59 Correct 337 ms 318816 KB Output is correct
60 Correct 309 ms 318760 KB Output is correct
61 Correct 1147 ms 427948 KB Output is correct
62 Correct 2250 ms 550336 KB Output is correct
63 Correct 2293 ms 551072 KB Output is correct
64 Correct 2269 ms 551244 KB Output is correct
65 Correct 465 ms 357840 KB Output is correct
66 Correct 622 ms 392672 KB Output is correct
67 Correct 644 ms 395704 KB Output is correct
68 Correct 3286 ms 723072 KB Output is correct
69 Correct 2648 ms 705108 KB Output is correct
70 Correct 2544 ms 705136 KB Output is correct
71 Correct 1567 ms 686860 KB Output is correct
72 Correct 3425 ms 1024168 KB Output is correct
73 Correct 3312 ms 628608 KB Output is correct
74 Correct 3762 ms 658844 KB Output is correct
75 Execution timed out 5122 ms 824920 KB Time limit exceeded
76 Halted 0 ms 0 KB -