oj.uz

Submission #154560

# Submission time Handle Problem Language Result Execution time Memory
154560 2019-09-22T17:44:29 Z liwi Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 931264 KB 

#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];
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();
//	}
	std::vector<std::pair<pii,int>> dep[MAXN];
	for(int l=2; l<=num_cols-1; l++){
		for(int r=l; r<=num_cols-1; r++){
			if(cnt[l][r] == 0) continue;
			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;
			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: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:161:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<a.size(); i++)
               ~^~~~~~~~~
rect.cpp:162:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k=0; k<a[i].size(); k++)
                ~^~~~~~~~~~~~
rect.cpp:171:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int v=0; v<row_dp[i][k].size(); v++){
                 ~^~~~~~~~~~~~~~~~~~~~
rect.cpp:173: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 292 ms 318660 KB Output is correct
2 Correct 289 ms 318768 KB Output is correct
3 Correct 292 ms 318840 KB Output is correct
4 Correct 290 ms 318840 KB Output is correct
5 Correct 290 ms 318936 KB Output is correct
6 Correct 294 ms 318896 KB Output is correct
7 Correct 291 ms 318904 KB Output is correct
8 Correct 291 ms 318696 KB Output is correct
9 Correct 290 ms 318840 KB Output is correct
10 Correct 292 ms 318844 KB Output is correct
11 Correct 288 ms 318840 KB Output is correct
12 Correct 291 ms 318840 KB Output is correct
13 Correct 297 ms 318664 KB Output is correct
14 Correct 290 ms 318640 KB Output is correct
15 Correct 289 ms 318712 KB Output is correct
16 Correct 307 ms 318684 KB Output is correct
17 Correct 289 ms 318692 KB Output is correct
18 Correct 289 ms 318716 KB Output is correct
19 Correct 291 ms 318900 KB Output is correct
20 Correct 290 ms 318944 KB Output is correct
21 Correct 290 ms 318712 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 318660 KB Output is correct
2 Correct 289 ms 318768 KB Output is correct
3 Correct 292 ms 318840 KB Output is correct
4 Correct 290 ms 318840 KB Output is correct
5 Correct 290 ms 318936 KB Output is correct
6 Correct 294 ms 318896 KB Output is correct
7 Correct 291 ms 318904 KB Output is correct
8 Correct 291 ms 318696 KB Output is correct
9 Correct 290 ms 318840 KB Output is correct
10 Correct 292 ms 318844 KB Output is correct
11 Correct 288 ms 318840 KB Output is correct
12 Correct 291 ms 318840 KB Output is correct
13 Correct 297 ms 318664 KB Output is correct
14 Correct 290 ms 318640 KB Output is correct
15 Correct 289 ms 318712 KB Output is correct
16 Correct 307 ms 318684 KB Output is correct
17 Correct 292 ms 319664 KB Output is correct
18 Correct 297 ms 319608 KB Output is correct
19 Correct 294 ms 319600 KB Output is correct
20 Correct 292 ms 319364 KB Output is correct
21 Correct 296 ms 319352 KB Output is correct
22 Correct 293 ms 319480 KB Output is correct
23 Correct 293 ms 319352 KB Output is correct
24 Correct 293 ms 319224 KB Output is correct
25 Correct 289 ms 318692 KB Output is correct
26 Correct 289 ms 318716 KB Output is correct
27 Correct 291 ms 318900 KB Output is correct
28 Correct 290 ms 318944 KB Output is correct
29 Correct 290 ms 318712 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 318660 KB Output is correct
2 Correct 289 ms 318768 KB Output is correct
3 Correct 292 ms 318840 KB Output is correct
4 Correct 290 ms 318840 KB Output is correct
5 Correct 290 ms 318936 KB Output is correct
6 Correct 294 ms 318896 KB Output is correct
7 Correct 291 ms 318904 KB Output is correct
8 Correct 291 ms 318696 KB Output is correct
9 Correct 290 ms 318840 KB Output is correct
10 Correct 292 ms 318844 KB Output is correct
11 Correct 288 ms 318840 KB Output is correct
12 Correct 291 ms 318840 KB Output is correct
13 Correct 297 ms 318664 KB Output is correct
14 Correct 290 ms 318640 KB Output is correct
15 Correct 289 ms 318712 KB Output is correct
16 Correct 307 ms 318684 KB Output is correct
17 Correct 292 ms 319664 KB Output is correct
18 Correct 297 ms 319608 KB Output is correct
19 Correct 294 ms 319600 KB Output is correct
20 Correct 292 ms 319364 KB Output is correct
21 Correct 296 ms 319352 KB Output is correct
22 Correct 293 ms 319480 KB Output is correct
23 Correct 293 ms 319352 KB Output is correct
24 Correct 293 ms 319224 KB Output is correct
25 Correct 306 ms 323456 KB Output is correct
26 Correct 301 ms 323320 KB Output is correct
27 Correct 305 ms 323580 KB Output is correct
28 Correct 301 ms 321188 KB Output is correct
29 Correct 314 ms 322344 KB Output is correct
30 Correct 314 ms 322652 KB Output is correct
31 Correct 311 ms 322368 KB Output is correct
32 Correct 309 ms 322368 KB Output is correct
33 Correct 289 ms 318692 KB Output is correct
34 Correct 289 ms 318716 KB Output is correct
35 Correct 291 ms 318900 KB Output is correct
36 Correct 290 ms 318944 KB Output is correct
37 Correct 290 ms 318712 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 318660 KB Output is correct
2 Correct 289 ms 318768 KB Output is correct
3 Correct 292 ms 318840 KB Output is correct
4 Correct 290 ms 318840 KB Output is correct
5 Correct 290 ms 318936 KB Output is correct
6 Correct 294 ms 318896 KB Output is correct
7 Correct 291 ms 318904 KB Output is correct
8 Correct 291 ms 318696 KB Output is correct
9 Correct 290 ms 318840 KB Output is correct
10 Correct 292 ms 318844 KB Output is correct
11 Correct 288 ms 318840 KB Output is correct
12 Correct 291 ms 318840 KB Output is correct
13 Correct 297 ms 318664 KB Output is correct
14 Correct 290 ms 318640 KB Output is correct
15 Correct 289 ms 318712 KB Output is correct
16 Correct 307 ms 318684 KB Output is correct
17 Correct 292 ms 319664 KB Output is correct
18 Correct 297 ms 319608 KB Output is correct
19 Correct 294 ms 319600 KB Output is correct
20 Correct 292 ms 319364 KB Output is correct
21 Correct 296 ms 319352 KB Output is correct
22 Correct 293 ms 319480 KB Output is correct
23 Correct 293 ms 319352 KB Output is correct
24 Correct 293 ms 319224 KB Output is correct
25 Correct 306 ms 323456 KB Output is correct
26 Correct 301 ms 323320 KB Output is correct
27 Correct 305 ms 323580 KB Output is correct
28 Correct 301 ms 321188 KB Output is correct
29 Correct 314 ms 322344 KB Output is correct
30 Correct 314 ms 322652 KB Output is correct
31 Correct 311 ms 322368 KB Output is correct
32 Correct 309 ms 322368 KB Output is correct
33 Correct 472 ms 351372 KB Output is correct
34 Correct 447 ms 350372 KB Output is correct
35 Correct 439 ms 350336 KB Output is correct
36 Correct 427 ms 349456 KB Output is correct
37 Correct 509 ms 370112 KB Output is correct
38 Correct 505 ms 370076 KB Output is correct
39 Correct 505 ms 370272 KB Output is correct
40 Correct 488 ms 367196 KB Output is correct
41 Correct 429 ms 338408 KB Output is correct
42 Correct 452 ms 342392 KB Output is correct
43 Correct 621 ms 355972 KB Output is correct
44 Correct 664 ms 356828 KB Output is correct
45 Correct 452 ms 339440 KB Output is correct
46 Correct 451 ms 337792 KB Output is correct
47 Correct 597 ms 353912 KB Output is correct
48 Correct 609 ms 354980 KB Output is correct
49 Correct 289 ms 318692 KB Output is correct
50 Correct 289 ms 318716 KB Output is correct
51 Correct 291 ms 318900 KB Output is correct
52 Correct 290 ms 318944 KB Output is correct
53 Correct 290 ms 318712 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 319064 KB Output is correct
2 Correct 299 ms 319100 KB Output is correct
3 Correct 303 ms 318840 KB Output is correct
4 Correct 290 ms 318760 KB Output is correct
5 Correct 310 ms 318988 KB Output is correct
6 Correct 305 ms 318968 KB Output is correct
7 Correct 303 ms 318972 KB Output is correct
8 Correct 305 ms 318960 KB Output is correct
9 Correct 303 ms 318968 KB Output is correct
10 Correct 305 ms 318672 KB Output is correct
11 Correct 302 ms 318852 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 318736 KB Output is correct
2 Correct 1164 ms 418672 KB Output is correct
3 Correct 2371 ms 530448 KB Output is correct
4 Correct 2371 ms 530964 KB Output is correct
5 Correct 2317 ms 531260 KB Output is correct
6 Correct 462 ms 356444 KB Output is correct
7 Correct 623 ms 390780 KB Output is correct
8 Correct 657 ms 393832 KB Output is correct
9 Correct 289 ms 318692 KB Output is correct
10 Correct 289 ms 318716 KB Output is correct
11 Correct 291 ms 318900 KB Output is correct
12 Correct 290 ms 318944 KB Output is correct
13 Correct 290 ms 318712 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 318660 KB Output is correct
2 Correct 289 ms 318768 KB Output is correct
3 Correct 292 ms 318840 KB Output is correct
4 Correct 290 ms 318840 KB Output is correct
5 Correct 290 ms 318936 KB Output is correct
6 Correct 294 ms 318896 KB Output is correct
7 Correct 291 ms 318904 KB Output is correct
8 Correct 291 ms 318696 KB Output is correct
9 Correct 290 ms 318840 KB Output is correct
10 Correct 292 ms 318844 KB Output is correct
11 Correct 288 ms 318840 KB Output is correct
12 Correct 291 ms 318840 KB Output is correct
13 Correct 297 ms 318664 KB Output is correct
14 Correct 290 ms 318640 KB Output is correct
15 Correct 289 ms 318712 KB Output is correct
16 Correct 307 ms 318684 KB Output is correct
17 Correct 292 ms 319664 KB Output is correct
18 Correct 297 ms 319608 KB Output is correct
19 Correct 294 ms 319600 KB Output is correct
20 Correct 292 ms 319364 KB Output is correct
21 Correct 296 ms 319352 KB Output is correct
22 Correct 293 ms 319480 KB Output is correct
23 Correct 293 ms 319352 KB Output is correct
24 Correct 293 ms 319224 KB Output is correct
25 Correct 306 ms 323456 KB Output is correct
26 Correct 301 ms 323320 KB Output is correct
27 Correct 305 ms 323580 KB Output is correct
28 Correct 301 ms 321188 KB Output is correct
29 Correct 314 ms 322344 KB Output is correct
30 Correct 314 ms 322652 KB Output is correct
31 Correct 311 ms 322368 KB Output is correct
32 Correct 309 ms 322368 KB Output is correct
33 Correct 472 ms 351372 KB Output is correct
34 Correct 447 ms 350372 KB Output is correct
35 Correct 439 ms 350336 KB Output is correct
36 Correct 427 ms 349456 KB Output is correct
37 Correct 509 ms 370112 KB Output is correct
38 Correct 505 ms 370076 KB Output is correct
39 Correct 505 ms 370272 KB Output is correct
40 Correct 488 ms 367196 KB Output is correct
41 Correct 429 ms 338408 KB Output is correct
42 Correct 452 ms 342392 KB Output is correct
43 Correct 621 ms 355972 KB Output is correct
44 Correct 664 ms 356828 KB Output is correct
45 Correct 452 ms 339440 KB Output is correct
46 Correct 451 ms 337792 KB Output is correct
47 Correct 597 ms 353912 KB Output is correct
48 Correct 609 ms 354980 KB Output is correct
49 Correct 301 ms 319064 KB Output is correct
50 Correct 299 ms 319100 KB Output is correct
51 Correct 303 ms 318840 KB Output is correct
52 Correct 290 ms 318760 KB Output is correct
53 Correct 310 ms 318988 KB Output is correct
54 Correct 305 ms 318968 KB Output is correct
55 Correct 303 ms 318972 KB Output is correct
56 Correct 305 ms 318960 KB Output is correct
57 Correct 303 ms 318968 KB Output is correct
58 Correct 305 ms 318672 KB Output is correct
59 Correct 302 ms 318852 KB Output is correct
60 Correct 288 ms 318736 KB Output is correct
61 Correct 1164 ms 418672 KB Output is correct
62 Correct 2371 ms 530448 KB Output is correct
63 Correct 2371 ms 530964 KB Output is correct
64 Correct 2317 ms 531260 KB Output is correct
65 Correct 462 ms 356444 KB Output is correct
66 Correct 623 ms 390780 KB Output is correct
67 Correct 657 ms 393832 KB Output is correct
68 Correct 3332 ms 686248 KB Output is correct
69 Correct 2645 ms 668108 KB Output is correct
70 Correct 2594 ms 668172 KB Output is correct
71 Correct 1611 ms 650088 KB Output is correct
72 Correct 3529 ms 931264 KB Output is correct
73 Correct 3309 ms 582736 KB Output is correct
74 Correct 3700 ms 612456 KB Output is correct
75 Execution timed out 5106 ms 751768 KB Time limit exceeded
76 Halted 0 ms 0 KB -