oj.uz

Submission #154441

# Submission time Handle Problem Language Result Execution time Memory
154441 2019-09-21T20:12:24 Z Dormi Rectangles (IOI19_rect) C++14
100 / 100
 4905 ms 781868 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int,int> pii;
typedef pair<lli,lli> pll;
void sc(){}
template<typename T,typename... Args>
void sc(T& a, Args&... args) {cin>>a,sc(args...);}
template<typename T>
void pr(T a){cout<<a;}
template<typename T,typename... Args>
void pr(T a, Args... args) {cout<<a<<" ",pr(args...);}
template<typename T>
void prl(T a){cout<<a<<"\n";}
template<typename T,typename... Args>
void prl(T a, Args... args) {cout<<a<<" ",prl(args...);}
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
int bit[2505];
int n,m;
void update(int loc, int val){
	for(;loc<=n;loc+=loc&-loc)bit[loc]+=val;
}
int sum(int loc){
	int ans=0;
	for(;loc>0;loc-=loc&-loc)ans+=bit[loc];
	return ans;
}
long long count_rectangles(std::vector<std::vector<int>> a){
	n=a.size();
	m=a[0].size();
	vector<pii> rowranges[n][m];
	vector<pii> colranges[n][m];
	rep(i,0,n){
		int preloc[m];
		int sufloc[m];
		pii deq[m];
		int l=0,r=-1;
		rep(j,0,m){
			while(r>=l&&deq[r].second<=a[i][j])r--;
			if(r>=l)preloc[j]=deq[r].first;
			else preloc[j]=-1;
			deq[++r]={j,a[i][j]};
		}
		l=0,r=-1;
		rep(j,m,0){
			while(r>=l&&deq[r].second<=a[i][j])r--;
			if(r>=l)sufloc[j]=deq[r].first;
			else sufloc[j]=-1;
			deq[++r]={j,a[i][j]};
		}
		rep(j,0,m){
			if(preloc[j]!=-1&&sufloc[j]!=-1){
				while(rowranges[i][preloc[j]+1].size()&&rowranges[i][preloc[j]+1].back().first==sufloc[j]-1)rowranges[i][preloc[j]+1].pop_back();
				rowranges[i][preloc[j]+1].push_back({sufloc[j]-1,1});
			}
		}
	}
	rep(i,0,m){
		int preloc[n];
		int sufloc[n];
		pii deq[n];
		int l=0,r=-1;
		rep(j,0,n){
			while(r>=l&&deq[r].second<=a[j][i])r--;
			if(r>=l)preloc[j]=deq[r].first;
			else preloc[j]=-1;
			deq[++r]={j,a[j][i]};
		}
		l=0,r=-1;
		rep(j,n,0){
			while(r>=l&&deq[r].second<=a[j][i])r--;
			if(r>=l)sufloc[j]=deq[r].first;
			else sufloc[j]=-1;
			deq[++r]={j,a[j][i]};
		}
		rep(j,0,n){
			if(preloc[j]!=-1&&sufloc[j]!=-1){
				while(colranges[preloc[j]+1][i].size()&&colranges[preloc[j]+1][i].back().first==sufloc[j]-1)colranges[preloc[j]+1][i].pop_back();
				colranges[preloc[j]+1][i].push_back({sufloc[j]-1,1});
			}
		}
	}
	rep(i,0,m){
		rep(j,n-1,0){
			 int l=0,r=0;
			 while(l<rowranges[j][i].size()&&r<rowranges[j+1][i].size()){
			 	if(rowranges[j][i][l].first==rowranges[j+1][i][r].first){
				    rowranges[j][i][l].second+=rowranges[j+1][i][r].second;
				    l++;
			 	}
			 	else if(rowranges[j][i][l].first>rowranges[j+1][i][r].first){
			 		r++;
			 	}
			 	else l++;
			 }
		}
	}
	rep(i,0,n){
		rep(j,m-1,0){
			int l=0,r=0;
			while(l<colranges[i][j].size()&&r<colranges[i][j+1].size()){
				if(colranges[i][j][l].first==colranges[i][j+1][r].first){
					colranges[i][j][l].second+=colranges[i][j+1][r].second;
					l++;
				}
				else if(colranges[i][j][l].first>colranges[i][j+1][r].first){
					r++;
				}
				else l++;
			}
		}
	}
	int cnt=0;
	rep(i,0,n)rep(j,0,m){
		sort(colranges[i][j].begin(),colranges[i][j].end(),[&] (const pii &a, const pii &b) {
			return a.second < b.second;
		});
		int r=colranges[i][j].size();
		rep(k,rowranges[i][j].size(),0){
			while(r>0&&colranges[i][j][r-1].second+j-1>=rowranges[i][j][k].first){
				r-=1;
				update(colranges[i][j][r].first+1,1);
			}
			cnt+=sum(rowranges[i][j][k].second+i);
		}
		rep(k,r,colranges[i][j].size())update(colranges[i][j][k].first+1,-1);
	}
	return cnt;
}
//int main(){
//    cin.tie(NULL);
//    ios_base::sync_with_stdio(false);
//	prl(count_rectangles({{4, 8, 7, 5, 6},
//	                     {7, 4, 10, 3, 5},
//	                     {9, 7, 20, 14, 2},
//		                     {9, 14, 7, 3, 6},
//			                     {5, 7, 5, 2, 7},
//				                     {4, 5, 13, 5, 6}}));
//    return 0;
//}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:86:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(l<rowranges[j][i].size()&&r<rowranges[j+1][i].size()){
           ~^~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:86:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(l<rowranges[j][i].size()&&r<rowranges[j+1][i].size()){
                                     ~^~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:101:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(l<colranges[i][j].size()&&r<colranges[i][j+1].size()){
          ~^~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:101:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(l<colranges[i][j].size()&&r<colranges[i][j+1].size()){
                                    ~^~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:17:70: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
                                                              ~~~~~~~~^~~~~~~
rect.cpp:126:3: note: in expansion of macro 'rep'
   rep(k,r,colranges[i][j].size())update(colranges[i][j][k].first+1,-1);
   ^~~
rect.cpp:17:102: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
                                                                                              ~~~~~~~~^~~~~~~
rect.cpp:126:3: note: in expansion of macro 'rep'
   rep(k,r,colranges[i][j].size())update(colranges[i][j][k].first+1,-1);
   ^~~
rect.cpp:17:134: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
                                                                                                                              ~~~~~~~~^~~~~~~
rect.cpp:126:3: note: in expansion of macro 'rep'
   rep(k,r,colranges[i][j].size())update(colranges[i][j][k].first+1,-1);
   ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 380 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 380 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 1144 KB Output is correct
18 Correct 4 ms 1144 KB Output is correct
19 Correct 4 ms 1144 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 4 ms 888 KB Output is correct
23 Correct 4 ms 888 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 380 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 1144 KB Output is correct
18 Correct 4 ms 1144 KB Output is correct
19 Correct 4 ms 1144 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 4 ms 888 KB Output is correct
23 Correct 4 ms 888 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 16 ms 5240 KB Output is correct
26 Correct 16 ms 5244 KB Output is correct
27 Correct 17 ms 5240 KB Output is correct
28 Correct 14 ms 3448 KB Output is correct
29 Correct 20 ms 4124 KB Output is correct
30 Correct 20 ms 4216 KB Output is correct
31 Correct 18 ms 4088 KB Output is correct
32 Correct 18 ms 4088 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 380 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 1144 KB Output is correct
18 Correct 4 ms 1144 KB Output is correct
19 Correct 4 ms 1144 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 4 ms 888 KB Output is correct
23 Correct 4 ms 888 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 16 ms 5240 KB Output is correct
26 Correct 16 ms 5244 KB Output is correct
27 Correct 17 ms 5240 KB Output is correct
28 Correct 14 ms 3448 KB Output is correct
29 Correct 20 ms 4124 KB Output is correct
30 Correct 20 ms 4216 KB Output is correct
31 Correct 18 ms 4088 KB Output is correct
32 Correct 18 ms 4088 KB Output is correct
33 Correct 136 ms 45780 KB Output is correct
34 Correct 117 ms 40972 KB Output is correct
35 Correct 114 ms 41080 KB Output is correct
36 Correct 102 ms 36132 KB Output is correct
37 Correct 277 ms 61296 KB Output is correct
38 Correct 253 ms 61056 KB Output is correct
39 Correct 260 ms 61332 KB Output is correct
40 Correct 217 ms 57496 KB Output is correct
41 Correct 131 ms 35832 KB Output is correct
42 Correct 158 ms 38520 KB Output is correct
43 Correct 242 ms 46940 KB Output is correct
44 Correct 256 ms 49016 KB Output is correct
45 Correct 122 ms 24696 KB Output is correct
46 Correct 122 ms 24608 KB Output is correct
47 Correct 236 ms 46588 KB Output is correct
48 Correct 242 ms 47708 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 3 ms 376 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1144 KB Output is correct
2 Correct 4 ms 1016 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 1016 KB Output is correct
6 Correct 4 ms 1016 KB Output is correct
7 Correct 4 ms 1020 KB Output is correct
8 Correct 4 ms 1016 KB Output is correct
9 Correct 4 ms 888 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 3 ms 760 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 854 ms 207780 KB Output is correct
3 Correct 1988 ms 450768 KB Output is correct
4 Correct 1999 ms 452832 KB Output is correct
5 Correct 2041 ms 452972 KB Output is correct
6 Correct 321 ms 175736 KB Output is correct
7 Correct 701 ms 333260 KB Output is correct
8 Correct 764 ms 355208 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 360 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 380 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 4 ms 1144 KB Output is correct
18 Correct 4 ms 1144 KB Output is correct
19 Correct 4 ms 1144 KB Output is correct
20 Correct 4 ms 760 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 4 ms 888 KB Output is correct
23 Correct 4 ms 888 KB Output is correct
24 Correct 3 ms 632 KB Output is correct
25 Correct 16 ms 5240 KB Output is correct
26 Correct 16 ms 5244 KB Output is correct
27 Correct 17 ms 5240 KB Output is correct
28 Correct 14 ms 3448 KB Output is correct
29 Correct 20 ms 4124 KB Output is correct
30 Correct 20 ms 4216 KB Output is correct
31 Correct 18 ms 4088 KB Output is correct
32 Correct 18 ms 4088 KB Output is correct
33 Correct 136 ms 45780 KB Output is correct
34 Correct 117 ms 40972 KB Output is correct
35 Correct 114 ms 41080 KB Output is correct
36 Correct 102 ms 36132 KB Output is correct
37 Correct 277 ms 61296 KB Output is correct
38 Correct 253 ms 61056 KB Output is correct
39 Correct 260 ms 61332 KB Output is correct
40 Correct 217 ms 57496 KB Output is correct
41 Correct 131 ms 35832 KB Output is correct
42 Correct 158 ms 38520 KB Output is correct
43 Correct 242 ms 46940 KB Output is correct
44 Correct 256 ms 49016 KB Output is correct
45 Correct 122 ms 24696 KB Output is correct
46 Correct 122 ms 24608 KB Output is correct
47 Correct 236 ms 46588 KB Output is correct
48 Correct 242 ms 47708 KB Output is correct
49 Correct 4 ms 1144 KB Output is correct
50 Correct 4 ms 1016 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 4 ms 1016 KB Output is correct
54 Correct 4 ms 1016 KB Output is correct
55 Correct 4 ms 1020 KB Output is correct
56 Correct 4 ms 1016 KB Output is correct
57 Correct 4 ms 888 KB Output is correct
58 Correct 2 ms 504 KB Output is correct
59 Correct 3 ms 760 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 854 ms 207780 KB Output is correct
62 Correct 1988 ms 450768 KB Output is correct
63 Correct 1999 ms 452832 KB Output is correct
64 Correct 2041 ms 452972 KB Output is correct
65 Correct 321 ms 175736 KB Output is correct
66 Correct 701 ms 333260 KB Output is correct
67 Correct 764 ms 355208 KB Output is correct
68 Correct 2335 ms 585288 KB Output is correct
69 Correct 1952 ms 518168 KB Output is correct
70 Correct 1496 ms 518172 KB Output is correct
71 Correct 1191 ms 451064 KB Output is correct
72 Correct 4905 ms 781868 KB Output is correct
73 Correct 2166 ms 358076 KB Output is correct
74 Correct 2368 ms 385700 KB Output is correct
75 Correct 3771 ms 596700 KB Output is correct
76 Correct 2315 ms 374344 KB Output is correct
77 Correct 3092 ms 499140 KB Output is correct
78 Correct 4101 ms 623908 KB Output is correct
79 Correct 2156 ms 356468 KB Output is correct
80 Correct 3786 ms 605600 KB Output is correct
81 Correct 3526 ms 590136 KB Output is correct
82 Correct 2347 ms 469208 KB Output is correct
83 Correct 4293 ms 781212 KB Output is correct
84 Correct 4754 ms 781820 KB Output is correct
85 Correct 4498 ms 779860 KB Output is correct
86 Correct 2 ms 256 KB Output is correct
87 Correct 3 ms 376 KB Output is correct
88 Correct 3 ms 376 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 256 KB Output is correct