oj.uz

Submission #155799

# Submission time Handle Problem Language Result Execution time Memory
155799 2019-09-30T15:44:56 Z vanic Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 950924 KB 
#include "rect.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <map>
#include <stack>
#include <set>
#include <array>
 
using namespace std;
 
typedef long long ll;
const int maxn=2521;
 
int n, m;
int l[maxn][maxn];
//vector < int > r[maxn][maxn], c[maxn][maxn];
map < int, int > r[maxn][maxn], c[maxn][maxn];
int rind[maxn][maxn], cind[maxn][maxn];
pair < int, int > red[maxn][maxn], stup[maxn][maxn];
int bio2[maxn][maxn], bio3[maxn][maxn];
vector < array < int, 4 > > bio;

 
void upd1(int x){
	stack < pair < int, int > > q;
	q.push(make_pair(1e8, -1));
	for(int i=0; i<m; i++){
		while(q.top().first<=l[x][i]){
			q.pop();
		}
		red[x][i].first=q.top().second+1;
		q.push(make_pair(l[x][i], i));
	}
	while(!q.empty()){
		q.pop();
	}
	q.push(make_pair(1e8, m));
	for(int i=m-1; i>-1; i--){
		while(q.top().first<=l[x][i]){
			q.pop();
		}
		red[x][i].second=q.top().second-1;
		if(bio2[red[x][i].first][red[x][i].second]!=x+1){
			bio2[red[x][i].first][red[x][i].second]=x+1;
			r[red[x][i].first][red[x][i].second][x]=r[red[x][i].first][red[x][i].second][rind[red[x][i].first][red[x][i].second]]+1;
			rind[red[x][i].first][red[x][i].second]=x;
		}
		q.push(make_pair(l[x][i], i));
	}
}
 
void upd2(int x){
	stack < pair < int, int > > q;
	q.push(make_pair(1e8, -1));
	for(int i=0; i<n; i++){
		while(q.top().first<=l[i][x]){
			q.pop();
		}
		stup[i][x].first=q.top().second+1;
		q.push(make_pair(l[i][x], i));
	}
	while(!q.empty()){
		q.pop();
	}
	q.push(make_pair(1e8, n));
	for(int i=n-1; i>-1; i--){
		while(q.top().first<=l[i][x]){
			q.pop();
		}
		stup[i][x].second=q.top().second-1;
		if(bio3[stup[i][x].first][stup[i][x].second]!=x+1){
			bio3[stup[i][x].first][stup[i][x].second]=x+1;
			c[stup[i][x].first][stup[i][x].second][x]=c[stup[i][x].first][stup[i][x].second][cind[stup[i][x].first][stup[i][x].second]]+1;
			cind[stup[i][x].first][stup[i][x].second]=x;
		}
		q.push(make_pair(l[i][x], i));
	}
}
 
 
int binary(int x, vector < int > &l){
	int lo=0, hi=l.size(), mid;
	while(lo<hi){
		mid=(lo+hi)/2;
		if(l[mid]<x){
			lo=mid+1;
		}
		else{
			hi=mid;
		}
	}
	return lo;
}
 
void provjeri(int x, int y){
	int r1, r2, c1, c2;
	r1=red[x][y].first;
	r2=red[x][y].second;
	c1=stup[x][y].first;
	c2=stup[x][y].second;
	if(r1==0 || c1==0 || r2==m-1 || c2==n-1){
		return;
	}
//	int pos1=binary(c1, r[r1][r2]);
//	int pos2=binary(r1, c[c1][c2]);
	if(r[r1][r2].find(c2)!=r[r1][r2].end() && r[r1][r2].find(c1)!=r[r1][r2].end()
	&& c[c1][c2].find(r2)!=c[c1][c2].end() && c[c1][c2].find(r1)!=c[c1][c2].end()
	&& r[r1][r2][c2]-r[r1][r2][c1]==c2-c1 && c[c1][c2][r2]-c[c1][c2][r1]==r2-r1){
		bio.push_back({r1, r2, c1, c2});
	}
}
 
long long count_rectangles(vector < vector < int > > a){
	n=a.size();
	m=a[0].size();
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			l[i][j]=a[i][j];
		}
	}
	for(int i=0; i<n; i++){
		upd1(i);
	}
	for(int i=0; i<m; i++){
		upd2(i);
	}
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			provjeri(i, j);
		}
	}
	sort(bio.begin(), bio.end());
	bio.erase(unique(bio.begin(), bio.end()), bio.end());
	return bio.size();
}
 
/*
int main(){
	scanf("%d%d", &n, &m);
	for(int i=0; i<n; i++){
		for(int j=0; j<m; j++){
			scanf("%d", &l[i][j]);
		}
	}
	for(int i=0; i<n; i++){
		upd1(i);
	}
	for(int i=0; i<m; i++){
		upd2(i);
	}
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			provjeri(i, j);
		}
	}
	sort(bio.begin(), bio.end());
	bio.erase(unique(bio.begin(), bio.end()), bio.end());
	printf("%d\n", bio.size());
	return 0;
}*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 570 ms 597596 KB Output is correct
2 Correct 615 ms 598324 KB Output is correct
3 Correct 541 ms 598356 KB Output is correct
4 Correct 542 ms 598232 KB Output is correct
5 Correct 537 ms 597692 KB Output is correct
6 Correct 547 ms 598288 KB Output is correct
7 Correct 538 ms 598136 KB Output is correct
8 Correct 540 ms 598084 KB Output is correct
9 Correct 541 ms 598456 KB Output is correct
10 Correct 538 ms 598308 KB Output is correct
11 Correct 551 ms 598276 KB Output is correct
12 Correct 541 ms 598308 KB Output is correct
13 Correct 544 ms 597468 KB Output is correct
14 Correct 539 ms 597512 KB Output is correct
15 Correct 536 ms 597444 KB Output is correct
16 Correct 543 ms 597432 KB Output is correct
17 Correct 540 ms 597304 KB Output is correct
18 Correct 541 ms 597408 KB Output is correct
19 Correct 543 ms 598204 KB Output is correct
20 Correct 540 ms 597724 KB Output is correct
21 Correct 582 ms 597556 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 570 ms 597596 KB Output is correct
2 Correct 615 ms 598324 KB Output is correct
3 Correct 541 ms 598356 KB Output is correct
4 Correct 542 ms 598232 KB Output is correct
5 Correct 537 ms 597692 KB Output is correct
6 Correct 547 ms 598288 KB Output is correct
7 Correct 538 ms 598136 KB Output is correct
8 Correct 540 ms 598084 KB Output is correct
9 Correct 541 ms 598456 KB Output is correct
10 Correct 538 ms 598308 KB Output is correct
11 Correct 551 ms 598276 KB Output is correct
12 Correct 541 ms 598308 KB Output is correct
13 Correct 544 ms 597468 KB Output is correct
14 Correct 539 ms 597512 KB Output is correct
15 Correct 536 ms 597444 KB Output is correct
16 Correct 543 ms 597432 KB Output is correct
17 Correct 560 ms 600688 KB Output is correct
18 Correct 644 ms 600668 KB Output is correct
19 Correct 572 ms 600644 KB Output is correct
20 Correct 588 ms 600248 KB Output is correct
21 Correct 641 ms 600696 KB Output is correct
22 Correct 567 ms 600708 KB Output is correct
23 Correct 555 ms 600652 KB Output is correct
24 Correct 610 ms 599880 KB Output is correct
25 Correct 540 ms 597304 KB Output is correct
26 Correct 541 ms 597408 KB Output is correct
27 Correct 543 ms 598204 KB Output is correct
28 Correct 540 ms 597724 KB Output is correct
29 Correct 582 ms 597556 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 570 ms 597596 KB Output is correct
2 Correct 615 ms 598324 KB Output is correct
3 Correct 541 ms 598356 KB Output is correct
4 Correct 542 ms 598232 KB Output is correct
5 Correct 537 ms 597692 KB Output is correct
6 Correct 547 ms 598288 KB Output is correct
7 Correct 538 ms 598136 KB Output is correct
8 Correct 540 ms 598084 KB Output is correct
9 Correct 541 ms 598456 KB Output is correct
10 Correct 538 ms 598308 KB Output is correct
11 Correct 551 ms 598276 KB Output is correct
12 Correct 541 ms 598308 KB Output is correct
13 Correct 544 ms 597468 KB Output is correct
14 Correct 539 ms 597512 KB Output is correct
15 Correct 536 ms 597444 KB Output is correct
16 Correct 543 ms 597432 KB Output is correct
17 Correct 560 ms 600688 KB Output is correct
18 Correct 644 ms 600668 KB Output is correct
19 Correct 572 ms 600644 KB Output is correct
20 Correct 588 ms 600248 KB Output is correct
21 Correct 641 ms 600696 KB Output is correct
22 Correct 567 ms 600708 KB Output is correct
23 Correct 555 ms 600652 KB Output is correct
24 Correct 610 ms 599880 KB Output is correct
25 Correct 594 ms 609132 KB Output is correct
26 Correct 643 ms 609152 KB Output is correct
27 Correct 631 ms 609248 KB Output is correct
28 Correct 569 ms 606072 KB Output is correct
29 Correct 588 ms 609144 KB Output is correct
30 Correct 591 ms 609244 KB Output is correct
31 Correct 587 ms 608756 KB Output is correct
32 Correct 589 ms 608544 KB Output is correct
33 Correct 540 ms 597304 KB Output is correct
34 Correct 541 ms 597408 KB Output is correct
35 Correct 543 ms 598204 KB Output is correct
36 Correct 540 ms 597724 KB Output is correct
37 Correct 582 ms 597556 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 570 ms 597596 KB Output is correct
2 Correct 615 ms 598324 KB Output is correct
3 Correct 541 ms 598356 KB Output is correct
4 Correct 542 ms 598232 KB Output is correct
5 Correct 537 ms 597692 KB Output is correct
6 Correct 547 ms 598288 KB Output is correct
7 Correct 538 ms 598136 KB Output is correct
8 Correct 540 ms 598084 KB Output is correct
9 Correct 541 ms 598456 KB Output is correct
10 Correct 538 ms 598308 KB Output is correct
11 Correct 551 ms 598276 KB Output is correct
12 Correct 541 ms 598308 KB Output is correct
13 Correct 544 ms 597468 KB Output is correct
14 Correct 539 ms 597512 KB Output is correct
15 Correct 536 ms 597444 KB Output is correct
16 Correct 543 ms 597432 KB Output is correct
17 Correct 560 ms 600688 KB Output is correct
18 Correct 644 ms 600668 KB Output is correct
19 Correct 572 ms 600644 KB Output is correct
20 Correct 588 ms 600248 KB Output is correct
21 Correct 641 ms 600696 KB Output is correct
22 Correct 567 ms 600708 KB Output is correct
23 Correct 555 ms 600652 KB Output is correct
24 Correct 610 ms 599880 KB Output is correct
25 Correct 594 ms 609132 KB Output is correct
26 Correct 643 ms 609152 KB Output is correct
27 Correct 631 ms 609248 KB Output is correct
28 Correct 569 ms 606072 KB Output is correct
29 Correct 588 ms 609144 KB Output is correct
30 Correct 591 ms 609244 KB Output is correct
31 Correct 587 ms 608756 KB Output is correct
32 Correct 589 ms 608544 KB Output is correct
33 Correct 1018 ms 703600 KB Output is correct
34 Correct 1029 ms 703624 KB Output is correct
35 Correct 1078 ms 703668 KB Output is correct
36 Correct 1085 ms 703608 KB Output is correct
37 Correct 1443 ms 685192 KB Output is correct
38 Correct 1444 ms 685124 KB Output is correct
39 Correct 1490 ms 685056 KB Output is correct
40 Correct 1391 ms 680416 KB Output is correct
41 Correct 826 ms 643420 KB Output is correct
42 Correct 968 ms 650824 KB Output is correct
43 Correct 1779 ms 687044 KB Output is correct
44 Correct 1539 ms 688288 KB Output is correct
45 Correct 980 ms 650612 KB Output is correct
46 Correct 978 ms 646252 KB Output is correct
47 Correct 1461 ms 679636 KB Output is correct
48 Correct 1453 ms 679856 KB Output is correct
49 Correct 540 ms 597304 KB Output is correct
50 Correct 541 ms 597408 KB Output is correct
51 Correct 543 ms 598204 KB Output is correct
52 Correct 540 ms 597724 KB Output is correct
53 Correct 582 ms 597556 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 618544 KB Output is correct
2 Correct 563 ms 615304 KB Output is correct
3 Correct 545 ms 597752 KB Output is correct
4 Correct 538 ms 597424 KB Output is correct
5 Correct 575 ms 616684 KB Output is correct
6 Correct 564 ms 616440 KB Output is correct
7 Correct 563 ms 616336 KB Output is correct
8 Correct 562 ms 615288 KB Output is correct
9 Correct 574 ms 614724 KB Output is correct
10 Correct 552 ms 607960 KB Output is correct
11 Correct 561 ms 613532 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 597652 KB Output is correct
2 Correct 2889 ms 782860 KB Output is correct
3 Execution timed out 5100 ms 950924 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 570 ms 597596 KB Output is correct
2 Correct 615 ms 598324 KB Output is correct
3 Correct 541 ms 598356 KB Output is correct
4 Correct 542 ms 598232 KB Output is correct
5 Correct 537 ms 597692 KB Output is correct
6 Correct 547 ms 598288 KB Output is correct
7 Correct 538 ms 598136 KB Output is correct
8 Correct 540 ms 598084 KB Output is correct
9 Correct 541 ms 598456 KB Output is correct
10 Correct 538 ms 598308 KB Output is correct
11 Correct 551 ms 598276 KB Output is correct
12 Correct 541 ms 598308 KB Output is correct
13 Correct 544 ms 597468 KB Output is correct
14 Correct 539 ms 597512 KB Output is correct
15 Correct 536 ms 597444 KB Output is correct
16 Correct 543 ms 597432 KB Output is correct
17 Correct 560 ms 600688 KB Output is correct
18 Correct 644 ms 600668 KB Output is correct
19 Correct 572 ms 600644 KB Output is correct
20 Correct 588 ms 600248 KB Output is correct
21 Correct 641 ms 600696 KB Output is correct
22 Correct 567 ms 600708 KB Output is correct
23 Correct 555 ms 600652 KB Output is correct
24 Correct 610 ms 599880 KB Output is correct
25 Correct 594 ms 609132 KB Output is correct
26 Correct 643 ms 609152 KB Output is correct
27 Correct 631 ms 609248 KB Output is correct
28 Correct 569 ms 606072 KB Output is correct
29 Correct 588 ms 609144 KB Output is correct
30 Correct 591 ms 609244 KB Output is correct
31 Correct 587 ms 608756 KB Output is correct
32 Correct 589 ms 608544 KB Output is correct
33 Correct 1018 ms 703600 KB Output is correct
34 Correct 1029 ms 703624 KB Output is correct
35 Correct 1078 ms 703668 KB Output is correct
36 Correct 1085 ms 703608 KB Output is correct
37 Correct 1443 ms 685192 KB Output is correct
38 Correct 1444 ms 685124 KB Output is correct
39 Correct 1490 ms 685056 KB Output is correct
40 Correct 1391 ms 680416 KB Output is correct
41 Correct 826 ms 643420 KB Output is correct
42 Correct 968 ms 650824 KB Output is correct
43 Correct 1779 ms 687044 KB Output is correct
44 Correct 1539 ms 688288 KB Output is correct
45 Correct 980 ms 650612 KB Output is correct
46 Correct 978 ms 646252 KB Output is correct
47 Correct 1461 ms 679636 KB Output is correct
48 Correct 1453 ms 679856 KB Output is correct
49 Correct 574 ms 618544 KB Output is correct
50 Correct 563 ms 615304 KB Output is correct
51 Correct 545 ms 597752 KB Output is correct
52 Correct 538 ms 597424 KB Output is correct
53 Correct 575 ms 616684 KB Output is correct
54 Correct 564 ms 616440 KB Output is correct
55 Correct 563 ms 616336 KB Output is correct
56 Correct 562 ms 615288 KB Output is correct
57 Correct 574 ms 614724 KB Output is correct
58 Correct 552 ms 607960 KB Output is correct
59 Correct 561 ms 613532 KB Output is correct
60 Correct 545 ms 597652 KB Output is correct
61 Correct 2889 ms 782860 KB Output is correct
62 Execution timed out 5100 ms 950924 KB Time limit exceeded
63 Halted 0 ms 0 KB -