oj.uz

Submission #1034444

# Submission time Handle Problem Language Result Execution time Memory
1034444 2024-07-25T13:51:58 Z amirhoseinfar1385 Rectangles (IOI19_rect) C++17
59 / 100
 974 ms 1048576 KB 
#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],dpd[maxn][maxn];
vector<int>alll[maxn][maxn],alld[maxn][maxn];
vector<pair<int,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.first,allq[i][j].back().second.second);
					allq[i][j].pop_back();
				}
			}
			while((int)allq[i][j].size()>0){
				mainres+=fen.pors(allq[i][j].back().second.first,allq[i][j].back().second.second);
				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),make_pair(j-dpp[x][j],j-1)));
			}
		}
		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 265 ms 635476 KB Output is correct
2 Correct 235 ms 635736 KB Output is correct
3 Correct 237 ms 635732 KB Output is correct
4 Correct 237 ms 635728 KB Output is correct
5 Correct 256 ms 635472 KB Output is correct
6 Correct 241 ms 635632 KB Output is correct
7 Correct 266 ms 635472 KB Output is correct
8 Correct 242 ms 635324 KB Output is correct
9 Correct 244 ms 635756 KB Output is correct
10 Correct 245 ms 635620 KB Output is correct
11 Correct 237 ms 635548 KB Output is correct
12 Correct 250 ms 635596 KB Output is correct
13 Correct 242 ms 635212 KB Output is correct
14 Correct 234 ms 635472 KB Output is correct
15 Correct 230 ms 635472 KB Output is correct
16 Correct 240 ms 635216 KB Output is correct
17 Correct 246 ms 635232 KB Output is correct
18 Correct 267 ms 635408 KB Output is correct
19 Correct 240 ms 635728 KB Output is correct
20 Correct 226 ms 635472 KB Output is correct
21 Correct 233 ms 635320 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 635476 KB Output is correct
2 Correct 235 ms 635736 KB Output is correct
3 Correct 237 ms 635732 KB Output is correct
4 Correct 237 ms 635728 KB Output is correct
5 Correct 256 ms 635472 KB Output is correct
6 Correct 241 ms 635632 KB Output is correct
7 Correct 266 ms 635472 KB Output is correct
8 Correct 242 ms 635324 KB Output is correct
9 Correct 244 ms 635756 KB Output is correct
10 Correct 245 ms 635620 KB Output is correct
11 Correct 237 ms 635548 KB Output is correct
12 Correct 250 ms 635596 KB Output is correct
13 Correct 242 ms 635212 KB Output is correct
14 Correct 234 ms 635472 KB Output is correct
15 Correct 230 ms 635472 KB Output is correct
16 Correct 240 ms 635216 KB Output is correct
17 Correct 246 ms 635232 KB Output is correct
18 Correct 267 ms 635408 KB Output is correct
19 Correct 240 ms 635728 KB Output is correct
20 Correct 226 ms 635472 KB Output is correct
21 Correct 233 ms 635320 KB Output is correct
22 Correct 243 ms 636800 KB Output is correct
23 Correct 244 ms 636664 KB Output is correct
24 Correct 228 ms 636880 KB Output is correct
25 Correct 236 ms 636500 KB Output is correct
26 Correct 236 ms 636756 KB Output is correct
27 Correct 236 ms 636776 KB Output is correct
28 Correct 235 ms 636720 KB Output is correct
29 Correct 237 ms 636388 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 635476 KB Output is correct
2 Correct 235 ms 635736 KB Output is correct
3 Correct 237 ms 635732 KB Output is correct
4 Correct 237 ms 635728 KB Output is correct
5 Correct 256 ms 635472 KB Output is correct
6 Correct 241 ms 635632 KB Output is correct
7 Correct 266 ms 635472 KB Output is correct
8 Correct 242 ms 635324 KB Output is correct
9 Correct 244 ms 635756 KB Output is correct
10 Correct 245 ms 635620 KB Output is correct
11 Correct 237 ms 635548 KB Output is correct
12 Correct 250 ms 635596 KB Output is correct
13 Correct 242 ms 635212 KB Output is correct
14 Correct 234 ms 635472 KB Output is correct
15 Correct 230 ms 635472 KB Output is correct
16 Correct 240 ms 635216 KB Output is correct
17 Correct 243 ms 636800 KB Output is correct
18 Correct 244 ms 636664 KB Output is correct
19 Correct 228 ms 636880 KB Output is correct
20 Correct 236 ms 636500 KB Output is correct
21 Correct 236 ms 636756 KB Output is correct
22 Correct 236 ms 636776 KB Output is correct
23 Correct 235 ms 636720 KB Output is correct
24 Correct 237 ms 636388 KB Output is correct
25 Correct 246 ms 635232 KB Output is correct
26 Correct 267 ms 635408 KB Output is correct
27 Correct 240 ms 635728 KB Output is correct
28 Correct 226 ms 635472 KB Output is correct
29 Correct 233 ms 635320 KB Output is correct
30 Correct 244 ms 642004 KB Output is correct
31 Correct 233 ms 641844 KB Output is correct
32 Correct 242 ms 642088 KB Output is correct
33 Correct 253 ms 640756 KB Output is correct
34 Correct 252 ms 641620 KB Output is correct
35 Correct 253 ms 641620 KB Output is correct
36 Correct 256 ms 641620 KB Output is correct
37 Correct 249 ms 641364 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 635476 KB Output is correct
2 Correct 235 ms 635736 KB Output is correct
3 Correct 237 ms 635732 KB Output is correct
4 Correct 237 ms 635728 KB Output is correct
5 Correct 256 ms 635472 KB Output is correct
6 Correct 241 ms 635632 KB Output is correct
7 Correct 266 ms 635472 KB Output is correct
8 Correct 242 ms 635324 KB Output is correct
9 Correct 244 ms 635756 KB Output is correct
10 Correct 245 ms 635620 KB Output is correct
11 Correct 237 ms 635548 KB Output is correct
12 Correct 250 ms 635596 KB Output is correct
13 Correct 242 ms 635212 KB Output is correct
14 Correct 234 ms 635472 KB Output is correct
15 Correct 230 ms 635472 KB Output is correct
16 Correct 240 ms 635216 KB Output is correct
17 Correct 243 ms 636800 KB Output is correct
18 Correct 244 ms 636664 KB Output is correct
19 Correct 228 ms 636880 KB Output is correct
20 Correct 236 ms 636500 KB Output is correct
21 Correct 236 ms 636756 KB Output is correct
22 Correct 236 ms 636776 KB Output is correct
23 Correct 235 ms 636720 KB Output is correct
24 Correct 237 ms 636388 KB Output is correct
25 Correct 244 ms 642004 KB Output is correct
26 Correct 233 ms 641844 KB Output is correct
27 Correct 242 ms 642088 KB Output is correct
28 Correct 253 ms 640756 KB Output is correct
29 Correct 252 ms 641620 KB Output is correct
30 Correct 253 ms 641620 KB Output is correct
31 Correct 256 ms 641620 KB Output is correct
32 Correct 249 ms 641364 KB Output is correct
33 Correct 246 ms 635232 KB Output is correct
34 Correct 267 ms 635408 KB Output is correct
35 Correct 240 ms 635728 KB Output is correct
36 Correct 226 ms 635472 KB Output is correct
37 Correct 233 ms 635320 KB Output is correct
38 Correct 328 ms 690256 KB Output is correct
39 Correct 425 ms 692568 KB Output is correct
40 Correct 317 ms 689492 KB Output is correct
41 Correct 344 ms 691536 KB Output is correct
42 Correct 344 ms 703056 KB Output is correct
43 Correct 360 ms 702992 KB Output is correct
44 Correct 354 ms 703056 KB Output is correct
45 Correct 351 ms 698620 KB Output is correct
46 Correct 341 ms 686928 KB Output is correct
47 Correct 334 ms 689504 KB Output is correct
48 Correct 411 ms 699304 KB Output is correct
49 Correct 443 ms 699476 KB Output is correct
50 Correct 338 ms 670216 KB Output is correct
51 Correct 315 ms 667476 KB Output is correct
52 Correct 424 ms 697936 KB Output is correct
53 Correct 440 ms 697868 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 636240 KB Output is correct
2 Correct 249 ms 636008 KB Output is correct
3 Correct 217 ms 635728 KB Output is correct
4 Correct 231 ms 635220 KB Output is correct
5 Correct 231 ms 635888 KB Output is correct
6 Correct 375 ms 635992 KB Output is correct
7 Correct 241 ms 635988 KB Output is correct
8 Correct 237 ms 636104 KB Output is correct
9 Correct 241 ms 636016 KB Output is correct
10 Correct 227 ms 635504 KB Output is correct
11 Correct 234 ms 635732 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 635232 KB Output is correct
2 Correct 267 ms 635408 KB Output is correct
3 Correct 240 ms 635728 KB Output is correct
4 Correct 226 ms 635472 KB Output is correct
5 Correct 233 ms 635320 KB Output is correct
6 Correct 238 ms 635524 KB Output is correct
7 Correct 974 ms 906836 KB Output is correct
8 Runtime error 810 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 265 ms 635476 KB Output is correct
2 Correct 235 ms 635736 KB Output is correct
3 Correct 237 ms 635732 KB Output is correct
4 Correct 237 ms 635728 KB Output is correct
5 Correct 256 ms 635472 KB Output is correct
6 Correct 241 ms 635632 KB Output is correct
7 Correct 266 ms 635472 KB Output is correct
8 Correct 242 ms 635324 KB Output is correct
9 Correct 244 ms 635756 KB Output is correct
10 Correct 245 ms 635620 KB Output is correct
11 Correct 237 ms 635548 KB Output is correct
12 Correct 250 ms 635596 KB Output is correct
13 Correct 242 ms 635212 KB Output is correct
14 Correct 234 ms 635472 KB Output is correct
15 Correct 230 ms 635472 KB Output is correct
16 Correct 240 ms 635216 KB Output is correct
17 Correct 243 ms 636800 KB Output is correct
18 Correct 244 ms 636664 KB Output is correct
19 Correct 228 ms 636880 KB Output is correct
20 Correct 236 ms 636500 KB Output is correct
21 Correct 236 ms 636756 KB Output is correct
22 Correct 236 ms 636776 KB Output is correct
23 Correct 235 ms 636720 KB Output is correct
24 Correct 237 ms 636388 KB Output is correct
25 Correct 244 ms 642004 KB Output is correct
26 Correct 233 ms 641844 KB Output is correct
27 Correct 242 ms 642088 KB Output is correct
28 Correct 253 ms 640756 KB Output is correct
29 Correct 252 ms 641620 KB Output is correct
30 Correct 253 ms 641620 KB Output is correct
31 Correct 256 ms 641620 KB Output is correct
32 Correct 249 ms 641364 KB Output is correct
33 Correct 328 ms 690256 KB Output is correct
34 Correct 425 ms 692568 KB Output is correct
35 Correct 317 ms 689492 KB Output is correct
36 Correct 344 ms 691536 KB Output is correct
37 Correct 344 ms 703056 KB Output is correct
38 Correct 360 ms 702992 KB Output is correct
39 Correct 354 ms 703056 KB Output is correct
40 Correct 351 ms 698620 KB Output is correct
41 Correct 341 ms 686928 KB Output is correct
42 Correct 334 ms 689504 KB Output is correct
43 Correct 411 ms 699304 KB Output is correct
44 Correct 443 ms 699476 KB Output is correct
45 Correct 338 ms 670216 KB Output is correct
46 Correct 315 ms 667476 KB Output is correct
47 Correct 424 ms 697936 KB Output is correct
48 Correct 440 ms 697868 KB Output is correct
49 Correct 244 ms 636240 KB Output is correct
50 Correct 249 ms 636008 KB Output is correct
51 Correct 217 ms 635728 KB Output is correct
52 Correct 231 ms 635220 KB Output is correct
53 Correct 231 ms 635888 KB Output is correct
54 Correct 375 ms 635992 KB Output is correct
55 Correct 241 ms 635988 KB Output is correct
56 Correct 237 ms 636104 KB Output is correct
57 Correct 241 ms 636016 KB Output is correct
58 Correct 227 ms 635504 KB Output is correct
59 Correct 234 ms 635732 KB Output is correct
60 Correct 238 ms 635524 KB Output is correct
61 Correct 974 ms 906836 KB Output is correct
62 Runtime error 810 ms 1048576 KB Execution killed with signal 9
63 Halted 0 ms 0 KB -