oj.uz

Submission #860082

# Submission time Handle Problem Language Result Execution time Memory
860082 2023-10-11T15:03:56 Z sunwukong123 Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 1048576 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
const int MAXN = 2505;
const int inf=1000000500ll;
const long long oo =1000000000000000500ll;
const int MOD = (int)1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int> pi; 

int n,m;
long long ans;
struct fenw {
	int fw[MAXN];
	void update(int x, int nval){
		for(;x<MAXN;x+=x&-x)fw[x]+=nval;
	}
	int point(int x){
		int res=0;
		for(;x;x-=x&-x)res+=fw[x];
		return res;
	}
	int query(int x, int y){
		return point(y)-point(x-1);
	}
}fw;
vector<int> vxi[MAXN][MAXN];
vector<int> vyi[MAXN][MAXN];
vector<pi> H[MAXN][MAXN];
vector<pi> V[MAXN][MAXN];
long long count_rectangles(std::vector<std::vector<int> > A) {
	n=A.size();
	m=A[0].size();
	for(int i=1;i<=n;i++){
		vector<pi> E;
		for(int j=1;j<=m;j++){
			E.push_back({A[i-1][j-1],j});
		}
		sort(E.begin(),E.end(),greater<pi>());
		
		set<int> s;
		vector<int> lazy;
		int pre=-1;
		set<pi> st;
		for(auto x:E){
			if(x.first!=pre){
				for(auto y:lazy){
					s.insert(y);
				}
				lazy.clear();
			}
			//debug(x.first,x.second);
			auto it=s.lower_bound(x.second);
			if(it == s.begin() || it==s.end());
			else {
				int L=*prev(it);
				int R=*it;
				st.insert({L+1,R-1});
				
			}
			lazy.push_back(x.second);
			pre=x.first;
		}
		for(auto x:st){
			int L=x.first;
			int R=x.second;
			vyi[L][R].push_back(i);
		}
	}

	for(int i=1;i<=m;i++){
		vector<pi> E;
		for(int j=1;j<=n;j++){
			E.push_back({A[j-1][i-1],j});
		}
		sort(E.begin(),E.end(),greater<pi>());
		set<int> s;
		vector<int> lazy;
		int pre=-1;
		set<pi> st;
		for(auto x:E){
			if(x.first!=pre){
				for(auto y:lazy){
					s.insert(y);
				}
				lazy.clear();
			}
			//debug(x.first,x.second);
			auto it=s.lower_bound(x.second);
			if(it == s.begin() || it==s.end());
			else {
				int L=*prev(it);
				int R=*it;
				//vxi[L][R].push_back(i);
				st.insert({L+1,R-1});
			}
			lazy.push_back(x.second);
			pre=x.first;
		}
		for(auto x:st){
			int L=x.first;
			int R=x.second;
			vxi[L][R].push_back(i);
		}
	}

	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j++){
			int st=0;

			for(int k=0;k<(int)vxi[i][j].size();k++){
				//debug(i,j,k,vxi[i][j][k]);
				int col=vxi[i][j][k];
				V[j][col].push_back({i,vxi[i][j][st]});
				
				if(k==((int)vxi[i][j].size()-1) || vxi[i][j][k]+1!=vxi[i][j][k+1]){

					//vx[i][j].push_back({vxi[i][j][st],vxi[i][j][k]});
					st=k+1;
				} else{
				
				}
			}
		}
	}
	for(int i=1;i<=m;i++){
		for(int j=i;j<=m;j++){
			int st=0;
			for(int k=0;k<(int)vyi[i][j].size();k++){
				int row=vyi[i][j][k];
				H[row][j].push_back({vyi[i][j][st],i});
				if(k==((int)vyi[i][j].size()-1) || vyi[i][j][k]+1!=vyi[i][j][k+1]){
					//vy[i][j].push_back({vyi[i][j][st],vyi[i][j][k]});
					st=k+1;
				} else{
					
				}
			}
		}
	}

	for(int i=2;i<=n-1;i++){
		for(int j=2;j<=m-1;j++){
			// try this guy as the bottom right corner
			sort(H[i][j].begin(),H[i][j].end(),[](pi x, pi y) { return x.second>y.second; });
			sort(V[i][j].begin(),V[i][j].end(),[](pi x, pi y) { return x.second>y.second; });
			
			//debug(i,j);
			//cerr<<"H:";
			//for(auto x:H[i][j]){
			//	cerr<<"{"<<x.first<<","<<x.second<<"}, ";
			//}
			//cerr<<endl;
			//cerr<<"V:";
			//for(auto x:V[i][j]){
			//	cerr<<"{"<<x.first<<","<<x.second<<"}, ";
			//}
			//cerr<<endl;
			int idx=0;
			//if(V[i][j].size() && H[i][j].size())debug(V[i][j][0].second,H[i][j][0].second);
			for(int k=0;k<(int)V[i][j].size();k++){
				while(idx<(int)H[i][j].size() && H[i][j][idx].second >= V[i][j][k].second) {
					fw.update(H[i][j][idx].first,1);
					++idx;
				}
				//debug(i,j,fw.query(1, V[i][j][k].first));
				ans+=fw.query(1, V[i][j][k].first);
			}
			for(int k=0;k<idx;k++){
				fw.update(H[i][j][k].first,-1);
			}
		}
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 589728 KB Output is correct
2 Correct 207 ms 589820 KB Output is correct
3 Correct 196 ms 589908 KB Output is correct
4 Correct 202 ms 589904 KB Output is correct
5 Correct 180 ms 589652 KB Output is correct
6 Correct 171 ms 589872 KB Output is correct
7 Correct 184 ms 589908 KB Output is correct
8 Correct 174 ms 589964 KB Output is correct
9 Correct 168 ms 589904 KB Output is correct
10 Correct 184 ms 589792 KB Output is correct
11 Correct 171 ms 589908 KB Output is correct
12 Correct 168 ms 589904 KB Output is correct
13 Correct 169 ms 589800 KB Output is correct
14 Correct 169 ms 589636 KB Output is correct
15 Correct 167 ms 589768 KB Output is correct
16 Correct 167 ms 589648 KB Output is correct
17 Correct 167 ms 589728 KB Output is correct
18 Correct 168 ms 589856 KB Output is correct
19 Correct 170 ms 589656 KB Output is correct
20 Correct 167 ms 589772 KB Output is correct
21 Correct 171 ms 589936 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 589728 KB Output is correct
2 Correct 207 ms 589820 KB Output is correct
3 Correct 196 ms 589908 KB Output is correct
4 Correct 202 ms 589904 KB Output is correct
5 Correct 180 ms 589652 KB Output is correct
6 Correct 171 ms 589872 KB Output is correct
7 Correct 184 ms 589908 KB Output is correct
8 Correct 174 ms 589964 KB Output is correct
9 Correct 168 ms 589904 KB Output is correct
10 Correct 184 ms 589792 KB Output is correct
11 Correct 171 ms 589908 KB Output is correct
12 Correct 168 ms 589904 KB Output is correct
13 Correct 169 ms 589800 KB Output is correct
14 Correct 169 ms 589636 KB Output is correct
15 Correct 167 ms 589768 KB Output is correct
16 Correct 167 ms 589648 KB Output is correct
17 Correct 167 ms 589728 KB Output is correct
18 Correct 168 ms 589856 KB Output is correct
19 Correct 170 ms 589656 KB Output is correct
20 Correct 167 ms 589772 KB Output is correct
21 Correct 171 ms 589936 KB Output is correct
22 Correct 177 ms 590168 KB Output is correct
23 Correct 169 ms 590160 KB Output is correct
24 Correct 173 ms 590220 KB Output is correct
25 Correct 171 ms 589908 KB Output is correct
26 Correct 187 ms 590120 KB Output is correct
27 Correct 171 ms 590156 KB Output is correct
28 Correct 173 ms 590252 KB Output is correct
29 Correct 168 ms 589904 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 589728 KB Output is correct
2 Correct 207 ms 589820 KB Output is correct
3 Correct 196 ms 589908 KB Output is correct
4 Correct 202 ms 589904 KB Output is correct
5 Correct 180 ms 589652 KB Output is correct
6 Correct 171 ms 589872 KB Output is correct
7 Correct 184 ms 589908 KB Output is correct
8 Correct 174 ms 589964 KB Output is correct
9 Correct 168 ms 589904 KB Output is correct
10 Correct 184 ms 589792 KB Output is correct
11 Correct 171 ms 589908 KB Output is correct
12 Correct 168 ms 589904 KB Output is correct
13 Correct 169 ms 589800 KB Output is correct
14 Correct 169 ms 589636 KB Output is correct
15 Correct 167 ms 589768 KB Output is correct
16 Correct 167 ms 589648 KB Output is correct
17 Correct 177 ms 590168 KB Output is correct
18 Correct 169 ms 590160 KB Output is correct
19 Correct 173 ms 590220 KB Output is correct
20 Correct 171 ms 589908 KB Output is correct
21 Correct 187 ms 590120 KB Output is correct
22 Correct 171 ms 590156 KB Output is correct
23 Correct 173 ms 590252 KB Output is correct
24 Correct 168 ms 589904 KB Output is correct
25 Correct 167 ms 589728 KB Output is correct
26 Correct 168 ms 589856 KB Output is correct
27 Correct 170 ms 589656 KB Output is correct
28 Correct 167 ms 589772 KB Output is correct
29 Correct 171 ms 589936 KB Output is correct
30 Correct 198 ms 591696 KB Output is correct
31 Correct 205 ms 591444 KB Output is correct
32 Correct 188 ms 591700 KB Output is correct
33 Correct 200 ms 591156 KB Output is correct
34 Correct 201 ms 592208 KB Output is correct
35 Correct 219 ms 592516 KB Output is correct
36 Correct 206 ms 592200 KB Output is correct
37 Correct 223 ms 592316 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 589728 KB Output is correct
2 Correct 207 ms 589820 KB Output is correct
3 Correct 196 ms 589908 KB Output is correct
4 Correct 202 ms 589904 KB Output is correct
5 Correct 180 ms 589652 KB Output is correct
6 Correct 171 ms 589872 KB Output is correct
7 Correct 184 ms 589908 KB Output is correct
8 Correct 174 ms 589964 KB Output is correct
9 Correct 168 ms 589904 KB Output is correct
10 Correct 184 ms 589792 KB Output is correct
11 Correct 171 ms 589908 KB Output is correct
12 Correct 168 ms 589904 KB Output is correct
13 Correct 169 ms 589800 KB Output is correct
14 Correct 169 ms 589636 KB Output is correct
15 Correct 167 ms 589768 KB Output is correct
16 Correct 167 ms 589648 KB Output is correct
17 Correct 177 ms 590168 KB Output is correct
18 Correct 169 ms 590160 KB Output is correct
19 Correct 173 ms 590220 KB Output is correct
20 Correct 171 ms 589908 KB Output is correct
21 Correct 187 ms 590120 KB Output is correct
22 Correct 171 ms 590156 KB Output is correct
23 Correct 173 ms 590252 KB Output is correct
24 Correct 168 ms 589904 KB Output is correct
25 Correct 198 ms 591696 KB Output is correct
26 Correct 205 ms 591444 KB Output is correct
27 Correct 188 ms 591700 KB Output is correct
28 Correct 200 ms 591156 KB Output is correct
29 Correct 201 ms 592208 KB Output is correct
30 Correct 219 ms 592516 KB Output is correct
31 Correct 206 ms 592200 KB Output is correct
32 Correct 223 ms 592316 KB Output is correct
33 Correct 167 ms 589728 KB Output is correct
34 Correct 168 ms 589856 KB Output is correct
35 Correct 170 ms 589656 KB Output is correct
36 Correct 167 ms 589772 KB Output is correct
37 Correct 171 ms 589936 KB Output is correct
38 Correct 412 ms 617984 KB Output is correct
39 Correct 423 ms 622504 KB Output is correct
40 Correct 417 ms 622668 KB Output is correct
41 Correct 413 ms 627436 KB Output is correct
42 Correct 422 ms 613972 KB Output is correct
43 Correct 418 ms 613796 KB Output is correct
44 Correct 425 ms 614116 KB Output is correct
45 Correct 418 ms 613480 KB Output is correct
46 Correct 337 ms 603728 KB Output is correct
47 Correct 424 ms 607240 KB Output is correct
48 Correct 722 ms 619992 KB Output is correct
49 Correct 661 ms 622192 KB Output is correct
50 Correct 410 ms 605908 KB Output is correct
51 Correct 404 ms 606116 KB Output is correct
52 Correct 670 ms 618512 KB Output is correct
53 Correct 625 ms 619348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 590280 KB Output is correct
2 Correct 170 ms 590176 KB Output is correct
3 Correct 173 ms 589812 KB Output is correct
4 Correct 166 ms 589908 KB Output is correct
5 Correct 174 ms 590420 KB Output is correct
6 Correct 174 ms 590236 KB Output is correct
7 Correct 178 ms 590312 KB Output is correct
8 Correct 179 ms 590592 KB Output is correct
9 Correct 173 ms 590380 KB Output is correct
10 Correct 176 ms 590152 KB Output is correct
11 Correct 176 ms 590164 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 589728 KB Output is correct
2 Correct 168 ms 589856 KB Output is correct
3 Correct 170 ms 589656 KB Output is correct
4 Correct 167 ms 589772 KB Output is correct
5 Correct 171 ms 589936 KB Output is correct
6 Correct 162 ms 589648 KB Output is correct
7 Correct 1307 ms 672668 KB Output is correct
8 Correct 2843 ms 768588 KB Output is correct
9 Correct 2746 ms 769508 KB Output is correct
10 Correct 2793 ms 769760 KB Output is correct
11 Correct 349 ms 620116 KB Output is correct
12 Correct 506 ms 647648 KB Output is correct
13 Correct 521 ms 651444 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 589728 KB Output is correct
2 Correct 207 ms 589820 KB Output is correct
3 Correct 196 ms 589908 KB Output is correct
4 Correct 202 ms 589904 KB Output is correct
5 Correct 180 ms 589652 KB Output is correct
6 Correct 171 ms 589872 KB Output is correct
7 Correct 184 ms 589908 KB Output is correct
8 Correct 174 ms 589964 KB Output is correct
9 Correct 168 ms 589904 KB Output is correct
10 Correct 184 ms 589792 KB Output is correct
11 Correct 171 ms 589908 KB Output is correct
12 Correct 168 ms 589904 KB Output is correct
13 Correct 169 ms 589800 KB Output is correct
14 Correct 169 ms 589636 KB Output is correct
15 Correct 167 ms 589768 KB Output is correct
16 Correct 167 ms 589648 KB Output is correct
17 Correct 177 ms 590168 KB Output is correct
18 Correct 169 ms 590160 KB Output is correct
19 Correct 173 ms 590220 KB Output is correct
20 Correct 171 ms 589908 KB Output is correct
21 Correct 187 ms 590120 KB Output is correct
22 Correct 171 ms 590156 KB Output is correct
23 Correct 173 ms 590252 KB Output is correct
24 Correct 168 ms 589904 KB Output is correct
25 Correct 198 ms 591696 KB Output is correct
26 Correct 205 ms 591444 KB Output is correct
27 Correct 188 ms 591700 KB Output is correct
28 Correct 200 ms 591156 KB Output is correct
29 Correct 201 ms 592208 KB Output is correct
30 Correct 219 ms 592516 KB Output is correct
31 Correct 206 ms 592200 KB Output is correct
32 Correct 223 ms 592316 KB Output is correct
33 Correct 412 ms 617984 KB Output is correct
34 Correct 423 ms 622504 KB Output is correct
35 Correct 417 ms 622668 KB Output is correct
36 Correct 413 ms 627436 KB Output is correct
37 Correct 422 ms 613972 KB Output is correct
38 Correct 418 ms 613796 KB Output is correct
39 Correct 425 ms 614116 KB Output is correct
40 Correct 418 ms 613480 KB Output is correct
41 Correct 337 ms 603728 KB Output is correct
42 Correct 424 ms 607240 KB Output is correct
43 Correct 722 ms 619992 KB Output is correct
44 Correct 661 ms 622192 KB Output is correct
45 Correct 410 ms 605908 KB Output is correct
46 Correct 404 ms 606116 KB Output is correct
47 Correct 670 ms 618512 KB Output is correct
48 Correct 625 ms 619348 KB Output is correct
49 Correct 173 ms 590280 KB Output is correct
50 Correct 170 ms 590176 KB Output is correct
51 Correct 173 ms 589812 KB Output is correct
52 Correct 166 ms 589908 KB Output is correct
53 Correct 174 ms 590420 KB Output is correct
54 Correct 174 ms 590236 KB Output is correct
55 Correct 178 ms 590312 KB Output is correct
56 Correct 179 ms 590592 KB Output is correct
57 Correct 173 ms 590380 KB Output is correct
58 Correct 176 ms 590152 KB Output is correct
59 Correct 176 ms 590164 KB Output is correct
60 Correct 162 ms 589648 KB Output is correct
61 Correct 1307 ms 672668 KB Output is correct
62 Correct 2843 ms 768588 KB Output is correct
63 Correct 2746 ms 769508 KB Output is correct
64 Correct 2793 ms 769760 KB Output is correct
65 Correct 349 ms 620116 KB Output is correct
66 Correct 506 ms 647648 KB Output is correct
67 Correct 521 ms 651444 KB Output is correct
68 Correct 167 ms 589728 KB Output is correct
69 Correct 168 ms 589856 KB Output is correct
70 Correct 170 ms 589656 KB Output is correct
71 Correct 167 ms 589772 KB Output is correct
72 Correct 171 ms 589936 KB Output is correct
73 Correct 4476 ms 944728 KB Output is correct
74 Correct 4257 ms 1008532 KB Output is correct
75 Correct 3834 ms 1011788 KB Output is correct
76 Correct 3556 ms 1048576 KB Output is correct
77 Correct 3903 ms 900864 KB Output is correct
78 Execution timed out 5107 ms 817512 KB Time limit exceeded
79 Halted 0 ms 0 KB -