oj.uz

Submission #154566

# Submission time Handle Problem Language Result Execution time Memory
154566 2019-09-22T17:55:46 Z liwi Rectangles (IOI19_rect) C++14
49 / 100
 1151 ms 696032 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 2401

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

# Verdict Execution time Memory Grader output
1 Correct 284 ms 293752 KB Output is correct
2 Correct 296 ms 293872 KB Output is correct
3 Correct 288 ms 293976 KB Output is correct
4 Correct 287 ms 293880 KB Output is correct
5 Correct 286 ms 293772 KB Output is correct
6 Correct 285 ms 293868 KB Output is correct
7 Correct 286 ms 293880 KB Output is correct
8 Correct 293 ms 293724 KB Output is correct
9 Correct 288 ms 293852 KB Output is correct
10 Correct 311 ms 293860 KB Output is correct
11 Correct 291 ms 294008 KB Output is correct
12 Correct 287 ms 293880 KB Output is correct
13 Correct 288 ms 293752 KB Output is correct
14 Correct 287 ms 293688 KB Output is correct
15 Correct 299 ms 293840 KB Output is correct
16 Correct 304 ms 293660 KB Output is correct
17 Correct 288 ms 293692 KB Output is correct
18 Correct 292 ms 293752 KB Output is correct
19 Correct 288 ms 293912 KB Output is correct
20 Correct 286 ms 293752 KB Output is correct
21 Correct 287 ms 293852 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 293752 KB Output is correct
2 Correct 296 ms 293872 KB Output is correct
3 Correct 288 ms 293976 KB Output is correct
4 Correct 287 ms 293880 KB Output is correct
5 Correct 286 ms 293772 KB Output is correct
6 Correct 285 ms 293868 KB Output is correct
7 Correct 286 ms 293880 KB Output is correct
8 Correct 293 ms 293724 KB Output is correct
9 Correct 288 ms 293852 KB Output is correct
10 Correct 311 ms 293860 KB Output is correct
11 Correct 291 ms 294008 KB Output is correct
12 Correct 287 ms 293880 KB Output is correct
13 Correct 288 ms 293752 KB Output is correct
14 Correct 287 ms 293688 KB Output is correct
15 Correct 299 ms 293840 KB Output is correct
16 Correct 304 ms 293660 KB Output is correct
17 Correct 296 ms 294796 KB Output is correct
18 Correct 289 ms 294748 KB Output is correct
19 Correct 291 ms 295032 KB Output is correct
20 Correct 287 ms 294392 KB Output is correct
21 Correct 291 ms 294644 KB Output is correct
22 Correct 291 ms 294520 KB Output is correct
23 Correct 290 ms 294552 KB Output is correct
24 Correct 286 ms 294264 KB Output is correct
25 Correct 288 ms 293692 KB Output is correct
26 Correct 292 ms 293752 KB Output is correct
27 Correct 288 ms 293912 KB Output is correct
28 Correct 286 ms 293752 KB Output is correct
29 Correct 287 ms 293852 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 293752 KB Output is correct
2 Correct 296 ms 293872 KB Output is correct
3 Correct 288 ms 293976 KB Output is correct
4 Correct 287 ms 293880 KB Output is correct
5 Correct 286 ms 293772 KB Output is correct
6 Correct 285 ms 293868 KB Output is correct
7 Correct 286 ms 293880 KB Output is correct
8 Correct 293 ms 293724 KB Output is correct
9 Correct 288 ms 293852 KB Output is correct
10 Correct 311 ms 293860 KB Output is correct
11 Correct 291 ms 294008 KB Output is correct
12 Correct 287 ms 293880 KB Output is correct
13 Correct 288 ms 293752 KB Output is correct
14 Correct 287 ms 293688 KB Output is correct
15 Correct 299 ms 293840 KB Output is correct
16 Correct 304 ms 293660 KB Output is correct
17 Correct 296 ms 294796 KB Output is correct
18 Correct 289 ms 294748 KB Output is correct
19 Correct 291 ms 295032 KB Output is correct
20 Correct 287 ms 294392 KB Output is correct
21 Correct 291 ms 294644 KB Output is correct
22 Correct 291 ms 294520 KB Output is correct
23 Correct 290 ms 294552 KB Output is correct
24 Correct 286 ms 294264 KB Output is correct
25 Correct 305 ms 299048 KB Output is correct
26 Correct 303 ms 299284 KB Output is correct
27 Correct 304 ms 299100 KB Output is correct
28 Correct 297 ms 296448 KB Output is correct
29 Correct 308 ms 297956 KB Output is correct
30 Correct 312 ms 298224 KB Output is correct
31 Correct 310 ms 297908 KB Output is correct
32 Correct 308 ms 298036 KB Output is correct
33 Correct 288 ms 293692 KB Output is correct
34 Correct 292 ms 293752 KB Output is correct
35 Correct 288 ms 293912 KB Output is correct
36 Correct 286 ms 293752 KB Output is correct
37 Correct 287 ms 293852 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 293752 KB Output is correct
2 Correct 296 ms 293872 KB Output is correct
3 Correct 288 ms 293976 KB Output is correct
4 Correct 287 ms 293880 KB Output is correct
5 Correct 286 ms 293772 KB Output is correct
6 Correct 285 ms 293868 KB Output is correct
7 Correct 286 ms 293880 KB Output is correct
8 Correct 293 ms 293724 KB Output is correct
9 Correct 288 ms 293852 KB Output is correct
10 Correct 311 ms 293860 KB Output is correct
11 Correct 291 ms 294008 KB Output is correct
12 Correct 287 ms 293880 KB Output is correct
13 Correct 288 ms 293752 KB Output is correct
14 Correct 287 ms 293688 KB Output is correct
15 Correct 299 ms 293840 KB Output is correct
16 Correct 304 ms 293660 KB Output is correct
17 Correct 296 ms 294796 KB Output is correct
18 Correct 289 ms 294748 KB Output is correct
19 Correct 291 ms 295032 KB Output is correct
20 Correct 287 ms 294392 KB Output is correct
21 Correct 291 ms 294644 KB Output is correct
22 Correct 291 ms 294520 KB Output is correct
23 Correct 290 ms 294552 KB Output is correct
24 Correct 286 ms 294264 KB Output is correct
25 Correct 305 ms 299048 KB Output is correct
26 Correct 303 ms 299284 KB Output is correct
27 Correct 304 ms 299100 KB Output is correct
28 Correct 297 ms 296448 KB Output is correct
29 Correct 308 ms 297956 KB Output is correct
30 Correct 312 ms 298224 KB Output is correct
31 Correct 310 ms 297908 KB Output is correct
32 Correct 308 ms 298036 KB Output is correct
33 Correct 469 ms 330020 KB Output is correct
34 Correct 442 ms 329344 KB Output is correct
35 Correct 432 ms 329188 KB Output is correct
36 Correct 392 ms 328136 KB Output is correct
37 Correct 490 ms 354424 KB Output is correct
38 Correct 495 ms 354396 KB Output is correct
39 Correct 506 ms 354296 KB Output is correct
40 Correct 479 ms 350712 KB Output is correct
41 Correct 410 ms 315256 KB Output is correct
42 Correct 454 ms 320068 KB Output is correct
43 Correct 664 ms 337392 KB Output is correct
44 Correct 637 ms 338476 KB Output is correct
45 Correct 444 ms 318040 KB Output is correct
46 Correct 461 ms 316600 KB Output is correct
47 Correct 589 ms 335640 KB Output is correct
48 Correct 595 ms 336408 KB Output is correct
49 Correct 288 ms 293692 KB Output is correct
50 Correct 292 ms 293752 KB Output is correct
51 Correct 288 ms 293912 KB Output is correct
52 Correct 286 ms 293752 KB Output is correct
53 Correct 287 ms 293852 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 622 ms 568504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 293668 KB Output is correct
2 Correct 1151 ms 402840 KB Output is correct
3 Runtime error 795 ms 696032 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 293752 KB Output is correct
2 Correct 296 ms 293872 KB Output is correct
3 Correct 288 ms 293976 KB Output is correct
4 Correct 287 ms 293880 KB Output is correct
5 Correct 286 ms 293772 KB Output is correct
6 Correct 285 ms 293868 KB Output is correct
7 Correct 286 ms 293880 KB Output is correct
8 Correct 293 ms 293724 KB Output is correct
9 Correct 288 ms 293852 KB Output is correct
10 Correct 311 ms 293860 KB Output is correct
11 Correct 291 ms 294008 KB Output is correct
12 Correct 287 ms 293880 KB Output is correct
13 Correct 288 ms 293752 KB Output is correct
14 Correct 287 ms 293688 KB Output is correct
15 Correct 299 ms 293840 KB Output is correct
16 Correct 304 ms 293660 KB Output is correct
17 Correct 296 ms 294796 KB Output is correct
18 Correct 289 ms 294748 KB Output is correct
19 Correct 291 ms 295032 KB Output is correct
20 Correct 287 ms 294392 KB Output is correct
21 Correct 291 ms 294644 KB Output is correct
22 Correct 291 ms 294520 KB Output is correct
23 Correct 290 ms 294552 KB Output is correct
24 Correct 286 ms 294264 KB Output is correct
25 Correct 305 ms 299048 KB Output is correct
26 Correct 303 ms 299284 KB Output is correct
27 Correct 304 ms 299100 KB Output is correct
28 Correct 297 ms 296448 KB Output is correct
29 Correct 308 ms 297956 KB Output is correct
30 Correct 312 ms 298224 KB Output is correct
31 Correct 310 ms 297908 KB Output is correct
32 Correct 308 ms 298036 KB Output is correct
33 Correct 469 ms 330020 KB Output is correct
34 Correct 442 ms 329344 KB Output is correct
35 Correct 432 ms 329188 KB Output is correct
36 Correct 392 ms 328136 KB Output is correct
37 Correct 490 ms 354424 KB Output is correct
38 Correct 495 ms 354396 KB Output is correct
39 Correct 506 ms 354296 KB Output is correct
40 Correct 479 ms 350712 KB Output is correct
41 Correct 410 ms 315256 KB Output is correct
42 Correct 454 ms 320068 KB Output is correct
43 Correct 664 ms 337392 KB Output is correct
44 Correct 637 ms 338476 KB Output is correct
45 Correct 444 ms 318040 KB Output is correct
46 Correct 461 ms 316600 KB Output is correct
47 Correct 589 ms 335640 KB Output is correct
48 Correct 595 ms 336408 KB Output is correct
49 Runtime error 622 ms 568504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -