oj.uz

Submission #155797

# Submission time Handle Problem Language Result Execution time Memory
155797 2019-09-30T15:40:33 Z vanic Rectangles (IOI19_rect) C++14
59 / 100
 4669 ms 1048580 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];
unordered_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][c2] && r[r1][r2][c1] && c[c1][c2][r2] && c[c1][c2][r1] && 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 776 ms 697008 KB Output is correct
2 Correct 759 ms 697852 KB Output is correct
3 Correct 713 ms 697784 KB Output is correct
4 Correct 691 ms 697848 KB Output is correct
5 Correct 692 ms 697208 KB Output is correct
6 Correct 713 ms 697864 KB Output is correct
7 Correct 693 ms 697720 KB Output is correct
8 Correct 699 ms 697312 KB Output is correct
9 Correct 703 ms 697768 KB Output is correct
10 Correct 698 ms 697912 KB Output is correct
11 Correct 715 ms 697724 KB Output is correct
12 Correct 717 ms 697772 KB Output is correct
13 Correct 713 ms 696876 KB Output is correct
14 Correct 690 ms 697128 KB Output is correct
15 Correct 731 ms 696988 KB Output is correct
16 Correct 805 ms 696952 KB Output is correct
17 Correct 817 ms 697052 KB Output is correct
18 Correct 706 ms 696828 KB Output is correct
19 Correct 694 ms 697936 KB Output is correct
20 Correct 690 ms 697164 KB Output is correct
21 Correct 703 ms 697192 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 697008 KB Output is correct
2 Correct 759 ms 697852 KB Output is correct
3 Correct 713 ms 697784 KB Output is correct
4 Correct 691 ms 697848 KB Output is correct
5 Correct 692 ms 697208 KB Output is correct
6 Correct 713 ms 697864 KB Output is correct
7 Correct 693 ms 697720 KB Output is correct
8 Correct 699 ms 697312 KB Output is correct
9 Correct 703 ms 697768 KB Output is correct
10 Correct 698 ms 697912 KB Output is correct
11 Correct 715 ms 697724 KB Output is correct
12 Correct 717 ms 697772 KB Output is correct
13 Correct 713 ms 696876 KB Output is correct
14 Correct 690 ms 697128 KB Output is correct
15 Correct 731 ms 696988 KB Output is correct
16 Correct 805 ms 696952 KB Output is correct
17 Correct 729 ms 700220 KB Output is correct
18 Correct 699 ms 700152 KB Output is correct
19 Correct 704 ms 700324 KB Output is correct
20 Correct 716 ms 699812 KB Output is correct
21 Correct 708 ms 700280 KB Output is correct
22 Correct 792 ms 700284 KB Output is correct
23 Correct 777 ms 700340 KB Output is correct
24 Correct 876 ms 699132 KB Output is correct
25 Correct 817 ms 697052 KB Output is correct
26 Correct 706 ms 696828 KB Output is correct
27 Correct 694 ms 697936 KB Output is correct
28 Correct 690 ms 697164 KB Output is correct
29 Correct 703 ms 697192 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 697008 KB Output is correct
2 Correct 759 ms 697852 KB Output is correct
3 Correct 713 ms 697784 KB Output is correct
4 Correct 691 ms 697848 KB Output is correct
5 Correct 692 ms 697208 KB Output is correct
6 Correct 713 ms 697864 KB Output is correct
7 Correct 693 ms 697720 KB Output is correct
8 Correct 699 ms 697312 KB Output is correct
9 Correct 703 ms 697768 KB Output is correct
10 Correct 698 ms 697912 KB Output is correct
11 Correct 715 ms 697724 KB Output is correct
12 Correct 717 ms 697772 KB Output is correct
13 Correct 713 ms 696876 KB Output is correct
14 Correct 690 ms 697128 KB Output is correct
15 Correct 731 ms 696988 KB Output is correct
16 Correct 805 ms 696952 KB Output is correct
17 Correct 729 ms 700220 KB Output is correct
18 Correct 699 ms 700152 KB Output is correct
19 Correct 704 ms 700324 KB Output is correct
20 Correct 716 ms 699812 KB Output is correct
21 Correct 708 ms 700280 KB Output is correct
22 Correct 792 ms 700284 KB Output is correct
23 Correct 777 ms 700340 KB Output is correct
24 Correct 876 ms 699132 KB Output is correct
25 Correct 860 ms 708384 KB Output is correct
26 Correct 782 ms 708464 KB Output is correct
27 Correct 795 ms 708240 KB Output is correct
28 Correct 733 ms 705908 KB Output is correct
29 Correct 758 ms 709164 KB Output is correct
30 Correct 769 ms 709140 KB Output is correct
31 Correct 755 ms 708548 KB Output is correct
32 Correct 795 ms 708296 KB Output is correct
33 Correct 817 ms 697052 KB Output is correct
34 Correct 706 ms 696828 KB Output is correct
35 Correct 694 ms 697936 KB Output is correct
36 Correct 690 ms 697164 KB Output is correct
37 Correct 703 ms 697192 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 697008 KB Output is correct
2 Correct 759 ms 697852 KB Output is correct
3 Correct 713 ms 697784 KB Output is correct
4 Correct 691 ms 697848 KB Output is correct
5 Correct 692 ms 697208 KB Output is correct
6 Correct 713 ms 697864 KB Output is correct
7 Correct 693 ms 697720 KB Output is correct
8 Correct 699 ms 697312 KB Output is correct
9 Correct 703 ms 697768 KB Output is correct
10 Correct 698 ms 697912 KB Output is correct
11 Correct 715 ms 697724 KB Output is correct
12 Correct 717 ms 697772 KB Output is correct
13 Correct 713 ms 696876 KB Output is correct
14 Correct 690 ms 697128 KB Output is correct
15 Correct 731 ms 696988 KB Output is correct
16 Correct 805 ms 696952 KB Output is correct
17 Correct 729 ms 700220 KB Output is correct
18 Correct 699 ms 700152 KB Output is correct
19 Correct 704 ms 700324 KB Output is correct
20 Correct 716 ms 699812 KB Output is correct
21 Correct 708 ms 700280 KB Output is correct
22 Correct 792 ms 700284 KB Output is correct
23 Correct 777 ms 700340 KB Output is correct
24 Correct 876 ms 699132 KB Output is correct
25 Correct 860 ms 708384 KB Output is correct
26 Correct 782 ms 708464 KB Output is correct
27 Correct 795 ms 708240 KB Output is correct
28 Correct 733 ms 705908 KB Output is correct
29 Correct 758 ms 709164 KB Output is correct
30 Correct 769 ms 709140 KB Output is correct
31 Correct 755 ms 708548 KB Output is correct
32 Correct 795 ms 708296 KB Output is correct
33 Correct 1416 ms 800540 KB Output is correct
34 Correct 1244 ms 800776 KB Output is correct
35 Correct 1176 ms 800544 KB Output is correct
36 Correct 1153 ms 800740 KB Output is correct
37 Correct 1379 ms 777256 KB Output is correct
38 Correct 1385 ms 776968 KB Output is correct
39 Correct 1508 ms 777044 KB Output is correct
40 Correct 1427 ms 772920 KB Output is correct
41 Correct 1049 ms 748836 KB Output is correct
42 Correct 1320 ms 758012 KB Output is correct
43 Correct 1847 ms 793636 KB Output is correct
44 Correct 1773 ms 795096 KB Output is correct
45 Correct 1156 ms 753384 KB Output is correct
46 Correct 1202 ms 749412 KB Output is correct
47 Correct 1603 ms 784024 KB Output is correct
48 Correct 1664 ms 784320 KB Output is correct
49 Correct 817 ms 697052 KB Output is correct
50 Correct 706 ms 696828 KB Output is correct
51 Correct 694 ms 697936 KB Output is correct
52 Correct 690 ms 697164 KB Output is correct
53 Correct 703 ms 697192 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 816 ms 718040 KB Output is correct
2 Correct 833 ms 714736 KB Output is correct
3 Correct 790 ms 697080 KB Output is correct
4 Correct 757 ms 696884 KB Output is correct
5 Correct 835 ms 716024 KB Output is correct
6 Correct 768 ms 715808 KB Output is correct
7 Correct 716 ms 715980 KB Output is correct
8 Correct 757 ms 714612 KB Output is correct
9 Correct 717 ms 714224 KB Output is correct
10 Correct 705 ms 707576 KB Output is correct
11 Correct 715 ms 712864 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 700 ms 697192 KB Output is correct
2 Correct 3363 ms 917732 KB Output is correct
3 Runtime error 4669 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 776 ms 697008 KB Output is correct
2 Correct 759 ms 697852 KB Output is correct
3 Correct 713 ms 697784 KB Output is correct
4 Correct 691 ms 697848 KB Output is correct
5 Correct 692 ms 697208 KB Output is correct
6 Correct 713 ms 697864 KB Output is correct
7 Correct 693 ms 697720 KB Output is correct
8 Correct 699 ms 697312 KB Output is correct
9 Correct 703 ms 697768 KB Output is correct
10 Correct 698 ms 697912 KB Output is correct
11 Correct 715 ms 697724 KB Output is correct
12 Correct 717 ms 697772 KB Output is correct
13 Correct 713 ms 696876 KB Output is correct
14 Correct 690 ms 697128 KB Output is correct
15 Correct 731 ms 696988 KB Output is correct
16 Correct 805 ms 696952 KB Output is correct
17 Correct 729 ms 700220 KB Output is correct
18 Correct 699 ms 700152 KB Output is correct
19 Correct 704 ms 700324 KB Output is correct
20 Correct 716 ms 699812 KB Output is correct
21 Correct 708 ms 700280 KB Output is correct
22 Correct 792 ms 700284 KB Output is correct
23 Correct 777 ms 700340 KB Output is correct
24 Correct 876 ms 699132 KB Output is correct
25 Correct 860 ms 708384 KB Output is correct
26 Correct 782 ms 708464 KB Output is correct
27 Correct 795 ms 708240 KB Output is correct
28 Correct 733 ms 705908 KB Output is correct
29 Correct 758 ms 709164 KB Output is correct
30 Correct 769 ms 709140 KB Output is correct
31 Correct 755 ms 708548 KB Output is correct
32 Correct 795 ms 708296 KB Output is correct
33 Correct 1416 ms 800540 KB Output is correct
34 Correct 1244 ms 800776 KB Output is correct
35 Correct 1176 ms 800544 KB Output is correct
36 Correct 1153 ms 800740 KB Output is correct
37 Correct 1379 ms 777256 KB Output is correct
38 Correct 1385 ms 776968 KB Output is correct
39 Correct 1508 ms 777044 KB Output is correct
40 Correct 1427 ms 772920 KB Output is correct
41 Correct 1049 ms 748836 KB Output is correct
42 Correct 1320 ms 758012 KB Output is correct
43 Correct 1847 ms 793636 KB Output is correct
44 Correct 1773 ms 795096 KB Output is correct
45 Correct 1156 ms 753384 KB Output is correct
46 Correct 1202 ms 749412 KB Output is correct
47 Correct 1603 ms 784024 KB Output is correct
48 Correct 1664 ms 784320 KB Output is correct
49 Correct 816 ms 718040 KB Output is correct
50 Correct 833 ms 714736 KB Output is correct
51 Correct 790 ms 697080 KB Output is correct
52 Correct 757 ms 696884 KB Output is correct
53 Correct 835 ms 716024 KB Output is correct
54 Correct 768 ms 715808 KB Output is correct
55 Correct 716 ms 715980 KB Output is correct
56 Correct 757 ms 714612 KB Output is correct
57 Correct 717 ms 714224 KB Output is correct
58 Correct 705 ms 707576 KB Output is correct
59 Correct 715 ms 712864 KB Output is correct
60 Correct 700 ms 697192 KB Output is correct
61 Correct 3363 ms 917732 KB Output is correct
62 Runtime error 4669 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
63 Halted 0 ms 0 KB -