Submission #1034450

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1034450	2024-07-25T13:53:58 Z	amirhoseinfar1385	Rectangles (IOI19_rect)	C++17	59 / 100	938 ms	1048576 KB

rect

#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=2500+100;
int all[maxn][maxn],vis[maxn][maxn],tp[maxn][maxn],n,m,dpp[maxn][maxn];
vector<int>alll[maxn][maxn],alld[maxn][maxn];
vector<pair<int,int>>allq[maxn][maxn];
vector<pair<int,int>>addy[maxn][maxn];
long long mainres=0;

struct fenwick{
	int fn[maxn];
	vector<int>allind;
	void clear(){
		for(auto x:allind){
			while(x<maxn){
				fn[x]=0;
				x+=((-x)&x);
			}
		}
		allind.clear();
	}
	void add(int i,int w){
		i++;
		allind.push_back(i);
		while(i<maxn){
			fn[i]+=w;
			i+=((-i)&i);
		}
	}
	int pors(int l,int r){
		int ret=0;
		r++;
		while(l>0){
			ret-=fn[l];
			l-=((-l)&l);
		}
		while(r>0){
			ret+=fn[r];
			r-=((-r)&r);
		}
		return ret;
	}
}fen;


void pre(){
	for(int i=1;i<=n;i++){
		vector<pair<int,int>>allv;
		for(int j=1;j<=m;j++){
			while((int)allv.size()>0&&allv.back().first<all[i][j]){
				alll[i][j].push_back(allv.back().second);
				allv.pop_back();
			}
			if((int)allv.size()>0){
				alll[i][j].push_back(allv.back().second);
			}
			if((int)allv.size()>0&&allv.back().first==all[i][j]){
				allv.pop_back();
			}
			allv.push_back(make_pair(all[i][j],j));
		}
	}
	for(int j=1;j<=m;j++){
		vector<pair<int,int>>allv;
		for(int i=n;i>=1;i--){
			while((int)allv.size()>0&&allv.back().first<all[i][j]){
				alld[i][j].push_back(allv.back().second);
				allv.pop_back();
			}
			if((int)allv.size()>0){
				alld[i][j].push_back(allv.back().second);
			}
			if((int)allv.size()>0&&allv.back().first==all[i][j]){
				allv.pop_back();
			}
			allv.push_back(make_pair(all[i][j],i));
		}
	}
}

void solveq(){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			sort(addy[i][j].begin(),addy[i][j].end());
			sort(allq[i][j].begin(),allq[i][j].end());
	//		cout<<i<<" "<<j<<" :"<<endl;
	//		for(auto x:addy[i][j]){
	//			cout<<x.first<<" "<<x.second<<endl;
	//		}
	//		for(auto x:allq[i][j]){
	//			cout<<x.first<<" "<<x.second.first<<" "<<x.second.second<<endl;
	//		}
			while((int)addy[i][j].size()>0&&(int)allq[i][j].size()>0){
				if(addy[i][j].back().first>=allq[i][j].back().first){
					fen.add(addy[i][j].back().second,1);
					addy[i][j].pop_back();
				}else{
					mainres+=fen.pors(allq[i][j].back().second,j-2);
					allq[i][j].pop_back();
				}
			}
			while((int)allq[i][j].size()>0){
				mainres+=fen.pors(allq[i][j].back().second,j-2);
				allq[i][j].pop_back();
			}
			fen.clear();
		}
	}
}

void calq(){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			for(auto x:alld[i][j]){
				if(x<=i+1){
					continue;
				}
				dpp[x][j]=dpp[x][j-1]+1;
				allq[i+1][j+1].push_back(make_pair((x-i-1),j-dpp[x][j]));
			}
		}
		for(int j=1;j<=m;j++){
			for(auto x:alld[i][j]){
				if(x<=i+1){
					continue;
				}
				dpp[x][j]=0;
			}
		}
	}
	for(int j=1;j<=m;j++){
		for(int i=n;i>=1;i--){
			for(auto x:alll[i][j]){
				if(x+1>=j){
					continue;
				}
				dpp[i][x]=dpp[i+1][x]+1;
				addy[i][j].push_back(make_pair(dpp[i][x],x));
			}
		}
		for(int i=n;i>=1;i--){
			for(auto x:alll[i][j]){
				if(x+1>=j){
					continue;
				}
				dpp[i][x]=0;
			}
		}
	}
}

void solve(){
	pre();
	calq();
	solveq();
}
long long count_rectangles(std::vector<std::vector<int> > a) {
	n=a.size();
	m=a[0].size();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			all[i][j]=a[i-1][j-1];
		}
	}
	solve();
	return mainres;
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	264 ms	635476 KB	Output is correct
2	Correct	243 ms	635672 KB	Output is correct
3	Correct	284 ms	635568 KB	Output is correct
4	Correct	263 ms	635736 KB	Output is correct
5	Correct	272 ms	635476 KB	Output is correct
6	Correct	231 ms	635732 KB	Output is correct
7	Correct	228 ms	635476 KB	Output is correct
8	Correct	221 ms	635384 KB	Output is correct
9	Correct	252 ms	635728 KB	Output is correct
10	Correct	226 ms	635728 KB	Output is correct
11	Correct	238 ms	635744 KB	Output is correct
12	Correct	220 ms	635732 KB	Output is correct
13	Correct	219 ms	635216 KB	Output is correct
14	Correct	290 ms	635424 KB	Output is correct
15	Correct	234 ms	635472 KB	Output is correct
16	Correct	234 ms	635220 KB	Output is correct
17	Correct	225 ms	635220 KB	Output is correct
18	Correct	231 ms	635216 KB	Output is correct
19	Correct	224 ms	635772 KB	Output is correct
20	Correct	222 ms	635372 KB	Output is correct
21	Correct	235 ms	635220 KB	Output is correct

Subtask #2

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	264 ms	635476 KB	Output is correct
2	Correct	243 ms	635672 KB	Output is correct
3	Correct	284 ms	635568 KB	Output is correct
4	Correct	263 ms	635736 KB	Output is correct
5	Correct	272 ms	635476 KB	Output is correct
6	Correct	231 ms	635732 KB	Output is correct
7	Correct	228 ms	635476 KB	Output is correct
8	Correct	221 ms	635384 KB	Output is correct
9	Correct	252 ms	635728 KB	Output is correct
10	Correct	226 ms	635728 KB	Output is correct
11	Correct	238 ms	635744 KB	Output is correct
12	Correct	220 ms	635732 KB	Output is correct
13	Correct	219 ms	635216 KB	Output is correct
14	Correct	290 ms	635424 KB	Output is correct
15	Correct	234 ms	635472 KB	Output is correct
16	Correct	234 ms	635220 KB	Output is correct
17	Correct	225 ms	635220 KB	Output is correct
18	Correct	231 ms	635216 KB	Output is correct
19	Correct	224 ms	635772 KB	Output is correct
20	Correct	222 ms	635372 KB	Output is correct
21	Correct	235 ms	635220 KB	Output is correct
22	Correct	228 ms	637012 KB	Output is correct
23	Correct	226 ms	636716 KB	Output is correct
24	Correct	240 ms	636752 KB	Output is correct
25	Correct	242 ms	636500 KB	Output is correct
26	Correct	234 ms	636596 KB	Output is correct
27	Correct	235 ms	636752 KB	Output is correct
28	Correct	238 ms	636752 KB	Output is correct
29	Correct	226 ms	636244 KB	Output is correct

Subtask #3

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	264 ms	635476 KB	Output is correct
2	Correct	243 ms	635672 KB	Output is correct
3	Correct	284 ms	635568 KB	Output is correct
4	Correct	263 ms	635736 KB	Output is correct
5	Correct	272 ms	635476 KB	Output is correct
6	Correct	231 ms	635732 KB	Output is correct
7	Correct	228 ms	635476 KB	Output is correct
8	Correct	221 ms	635384 KB	Output is correct
9	Correct	252 ms	635728 KB	Output is correct
10	Correct	226 ms	635728 KB	Output is correct
11	Correct	238 ms	635744 KB	Output is correct
12	Correct	220 ms	635732 KB	Output is correct
13	Correct	219 ms	635216 KB	Output is correct
14	Correct	290 ms	635424 KB	Output is correct
15	Correct	234 ms	635472 KB	Output is correct
16	Correct	234 ms	635220 KB	Output is correct
17	Correct	228 ms	637012 KB	Output is correct
18	Correct	226 ms	636716 KB	Output is correct
19	Correct	240 ms	636752 KB	Output is correct
20	Correct	242 ms	636500 KB	Output is correct
21	Correct	234 ms	636596 KB	Output is correct
22	Correct	235 ms	636752 KB	Output is correct
23	Correct	238 ms	636752 KB	Output is correct
24	Correct	226 ms	636244 KB	Output is correct
25	Correct	225 ms	635220 KB	Output is correct
26	Correct	231 ms	635216 KB	Output is correct
27	Correct	224 ms	635772 KB	Output is correct
28	Correct	222 ms	635372 KB	Output is correct
29	Correct	235 ms	635220 KB	Output is correct
30	Correct	231 ms	642004 KB	Output is correct
31	Correct	240 ms	641872 KB	Output is correct
32	Correct	248 ms	641876 KB	Output is correct
33	Correct	241 ms	640996 KB	Output is correct
34	Correct	235 ms	641616 KB	Output is correct
35	Correct	237 ms	641464 KB	Output is correct
36	Correct	239 ms	641340 KB	Output is correct
37	Correct	239 ms	641608 KB	Output is correct

Subtask #4

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	264 ms	635476 KB	Output is correct
2	Correct	243 ms	635672 KB	Output is correct
3	Correct	284 ms	635568 KB	Output is correct
4	Correct	263 ms	635736 KB	Output is correct
5	Correct	272 ms	635476 KB	Output is correct
6	Correct	231 ms	635732 KB	Output is correct
7	Correct	228 ms	635476 KB	Output is correct
8	Correct	221 ms	635384 KB	Output is correct
9	Correct	252 ms	635728 KB	Output is correct
10	Correct	226 ms	635728 KB	Output is correct
11	Correct	238 ms	635744 KB	Output is correct
12	Correct	220 ms	635732 KB	Output is correct
13	Correct	219 ms	635216 KB	Output is correct
14	Correct	290 ms	635424 KB	Output is correct
15	Correct	234 ms	635472 KB	Output is correct
16	Correct	234 ms	635220 KB	Output is correct
17	Correct	228 ms	637012 KB	Output is correct
18	Correct	226 ms	636716 KB	Output is correct
19	Correct	240 ms	636752 KB	Output is correct
20	Correct	242 ms	636500 KB	Output is correct
21	Correct	234 ms	636596 KB	Output is correct
22	Correct	235 ms	636752 KB	Output is correct
23	Correct	238 ms	636752 KB	Output is correct
24	Correct	226 ms	636244 KB	Output is correct
25	Correct	231 ms	642004 KB	Output is correct
26	Correct	240 ms	641872 KB	Output is correct
27	Correct	248 ms	641876 KB	Output is correct
28	Correct	241 ms	640996 KB	Output is correct
29	Correct	235 ms	641616 KB	Output is correct
30	Correct	237 ms	641464 KB	Output is correct
31	Correct	239 ms	641340 KB	Output is correct
32	Correct	239 ms	641608 KB	Output is correct
33	Correct	225 ms	635220 KB	Output is correct
34	Correct	231 ms	635216 KB	Output is correct
35	Correct	224 ms	635772 KB	Output is correct
36	Correct	222 ms	635372 KB	Output is correct
37	Correct	235 ms	635220 KB	Output is correct
38	Correct	307 ms	690340 KB	Output is correct
39	Correct	324 ms	692820 KB	Output is correct
40	Correct	299 ms	687976 KB	Output is correct
41	Correct	339 ms	690260 KB	Output is correct
42	Correct	319 ms	702936 KB	Output is correct
43	Correct	335 ms	702884 KB	Output is correct
44	Correct	323 ms	703056 KB	Output is correct
45	Correct	333 ms	698448 KB	Output is correct
46	Correct	330 ms	686916 KB	Output is correct
47	Correct	338 ms	689492 KB	Output is correct
48	Correct	394 ms	698196 KB	Output is correct
49	Correct	405 ms	698524 KB	Output is correct
50	Correct	319 ms	669524 KB	Output is correct
51	Correct	329 ms	666884 KB	Output is correct
52	Correct	403 ms	696780 KB	Output is correct
53	Correct	414 ms	696788 KB	Output is correct

Subtask #5

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	238 ms	635988 KB	Output is correct
2	Correct	227 ms	635916 KB	Output is correct
3	Correct	219 ms	635732 KB	Output is correct
4	Correct	216 ms	635216 KB	Output is correct
5	Correct	229 ms	636060 KB	Output is correct
6	Correct	217 ms	635988 KB	Output is correct
7	Correct	244 ms	635984 KB	Output is correct
8	Correct	228 ms	635996 KB	Output is correct
9	Correct	230 ms	636016 KB	Output is correct
10	Correct	260 ms	635584 KB	Output is correct
11	Correct	222 ms	635728 KB	Output is correct

Subtask #6

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	225 ms	635220 KB	Output is correct
2	Correct	231 ms	635216 KB	Output is correct
3	Correct	224 ms	635772 KB	Output is correct
4	Correct	222 ms	635372 KB	Output is correct
5	Correct	235 ms	635220 KB	Output is correct
6	Correct	228 ms	635468 KB	Output is correct
7	Correct	938 ms	907256 KB	Output is correct
8	Runtime error	657 ms	1048576 KB	Execution killed with signal 9
9	Halted	0 ms	0 KB	-

Subtask #7

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	264 ms	635476 KB	Output is correct
2	Correct	243 ms	635672 KB	Output is correct
3	Correct	284 ms	635568 KB	Output is correct
4	Correct	263 ms	635736 KB	Output is correct
5	Correct	272 ms	635476 KB	Output is correct
6	Correct	231 ms	635732 KB	Output is correct
7	Correct	228 ms	635476 KB	Output is correct
8	Correct	221 ms	635384 KB	Output is correct
9	Correct	252 ms	635728 KB	Output is correct
10	Correct	226 ms	635728 KB	Output is correct
11	Correct	238 ms	635744 KB	Output is correct
12	Correct	220 ms	635732 KB	Output is correct
13	Correct	219 ms	635216 KB	Output is correct
14	Correct	290 ms	635424 KB	Output is correct
15	Correct	234 ms	635472 KB	Output is correct
16	Correct	234 ms	635220 KB	Output is correct
17	Correct	228 ms	637012 KB	Output is correct
18	Correct	226 ms	636716 KB	Output is correct
19	Correct	240 ms	636752 KB	Output is correct
20	Correct	242 ms	636500 KB	Output is correct
21	Correct	234 ms	636596 KB	Output is correct
22	Correct	235 ms	636752 KB	Output is correct
23	Correct	238 ms	636752 KB	Output is correct
24	Correct	226 ms	636244 KB	Output is correct
25	Correct	231 ms	642004 KB	Output is correct
26	Correct	240 ms	641872 KB	Output is correct
27	Correct	248 ms	641876 KB	Output is correct
28	Correct	241 ms	640996 KB	Output is correct
29	Correct	235 ms	641616 KB	Output is correct
30	Correct	237 ms	641464 KB	Output is correct
31	Correct	239 ms	641340 KB	Output is correct
32	Correct	239 ms	641608 KB	Output is correct
33	Correct	307 ms	690340 KB	Output is correct
34	Correct	324 ms	692820 KB	Output is correct
35	Correct	299 ms	687976 KB	Output is correct
36	Correct	339 ms	690260 KB	Output is correct
37	Correct	319 ms	702936 KB	Output is correct
38	Correct	335 ms	702884 KB	Output is correct
39	Correct	323 ms	703056 KB	Output is correct
40	Correct	333 ms	698448 KB	Output is correct
41	Correct	330 ms	686916 KB	Output is correct
42	Correct	338 ms	689492 KB	Output is correct
43	Correct	394 ms	698196 KB	Output is correct
44	Correct	405 ms	698524 KB	Output is correct
45	Correct	319 ms	669524 KB	Output is correct
46	Correct	329 ms	666884 KB	Output is correct
47	Correct	403 ms	696780 KB	Output is correct
48	Correct	414 ms	696788 KB	Output is correct
49	Correct	238 ms	635988 KB	Output is correct
50	Correct	227 ms	635916 KB	Output is correct
51	Correct	219 ms	635732 KB	Output is correct
52	Correct	216 ms	635216 KB	Output is correct
53	Correct	229 ms	636060 KB	Output is correct
54	Correct	217 ms	635988 KB	Output is correct
55	Correct	244 ms	635984 KB	Output is correct
56	Correct	228 ms	635996 KB	Output is correct
57	Correct	230 ms	636016 KB	Output is correct
58	Correct	260 ms	635584 KB	Output is correct
59	Correct	222 ms	635728 KB	Output is correct
60	Correct	228 ms	635468 KB	Output is correct
61	Correct	938 ms	907256 KB	Output is correct
62	Runtime error	657 ms	1048576 KB	Execution killed with signal 9
63	Halted	0 ms	0 KB	-