oj.uz

답안 #155814

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155814 2019-09-30T16:18:00 Z vanic Rectangles (IOI19_rect) C++14
49 / 100
 1117 ms 209920 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=2003;
 
int n, m;
int l[maxn][maxn];
//vector < int > r[maxn][maxn], c[maxn][maxn];
unordered_map < ll, int > r, c;
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;

inline ll hashiraj(ll a, ll b, ll c){
	return a*maxn*maxn+b*maxn+c;
}
 
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;
			rind[red[x][i].first][red[x][i].second]++;
			r[hashiraj(red[x][i].first, red[x][i].second, x)]=rind[red[x][i].first][red[x][i].second];
		}
		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;
			cind[stup[i][x].first][stup[i][x].second]++;
			c[hashiraj(stup[i][x].first, stup[i][x].second, x)]=cind[stup[i][x].first][stup[i][x].second];
		}
		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[hashiraj(r1, r2, c2)]!=0 && r[hashiraj(r1, r2, c1)]!=0
	&& c[hashiraj(c1, c2, r2)]!=0 && c[hashiraj(c1, c2, r1)]!=0
	&& r[hashiraj(r1, r2, c2)]-r[hashiraj(r1, r2, c1)]==c2-c1 && c[hashiraj(c1, c2, r2)]-c[hashiraj(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", (int)bio.size());
	return 0;
}*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1268 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 1144 KB Output is correct
20 Correct 2 ms 760 KB Output is correct
21 Correct 2 ms 504 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1268 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 3448 KB Output is correct
18 Correct 8 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3064 KB Output is correct
21 Correct 9 ms 3580 KB Output is correct
22 Correct 9 ms 3448 KB Output is correct
23 Correct 9 ms 3576 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 1144 KB Output is correct
28 Correct 2 ms 760 KB Output is correct
29 Correct 2 ms 504 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1268 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 3448 KB Output is correct
18 Correct 8 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3064 KB Output is correct
21 Correct 9 ms 3580 KB Output is correct
22 Correct 9 ms 3448 KB Output is correct
23 Correct 9 ms 3576 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 39 ms 11684 KB Output is correct
26 Correct 38 ms 11684 KB Output is correct
27 Correct 40 ms 11684 KB Output is correct
28 Correct 27 ms 9336 KB Output is correct
29 Correct 47 ms 12200 KB Output is correct
30 Correct 48 ms 12196 KB Output is correct
31 Correct 44 ms 11304 KB Output is correct
32 Correct 42 ms 11048 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 1144 KB Output is correct
36 Correct 2 ms 760 KB Output is correct
37 Correct 2 ms 504 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1268 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 3448 KB Output is correct
18 Correct 8 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3064 KB Output is correct
21 Correct 9 ms 3580 KB Output is correct
22 Correct 9 ms 3448 KB Output is correct
23 Correct 9 ms 3576 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 39 ms 11684 KB Output is correct
26 Correct 38 ms 11684 KB Output is correct
27 Correct 40 ms 11684 KB Output is correct
28 Correct 27 ms 9336 KB Output is correct
29 Correct 47 ms 12200 KB Output is correct
30 Correct 48 ms 12196 KB Output is correct
31 Correct 44 ms 11304 KB Output is correct
32 Correct 42 ms 11048 KB Output is correct
33 Correct 557 ms 84432 KB Output is correct
34 Correct 527 ms 84348 KB Output is correct
35 Correct 569 ms 84340 KB Output is correct
36 Correct 675 ms 84328 KB Output is correct
37 Correct 548 ms 90672 KB Output is correct
38 Correct 584 ms 90668 KB Output is correct
39 Correct 652 ms 90756 KB Output is correct
40 Correct 531 ms 87760 KB Output is correct
41 Correct 292 ms 52152 KB Output is correct
42 Correct 406 ms 60112 KB Output is correct
43 Correct 872 ms 92904 KB Output is correct
44 Correct 874 ms 93576 KB Output is correct
45 Correct 383 ms 54020 KB Output is correct
46 Correct 400 ms 49760 KB Output is correct
47 Correct 1117 ms 86504 KB Output is correct
48 Correct 949 ms 86672 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 1144 KB Output is correct
52 Correct 2 ms 760 KB Output is correct
53 Correct 2 ms 504 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 29000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Runtime error 688 ms 209920 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 6 ms 1272 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 2 ms 888 KB Output is correct
9 Correct 3 ms 1268 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 3 ms 1272 KB Output is correct
12 Correct 3 ms 1272 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 8 ms 3448 KB Output is correct
18 Correct 8 ms 3448 KB Output is correct
19 Correct 8 ms 3448 KB Output is correct
20 Correct 7 ms 3064 KB Output is correct
21 Correct 9 ms 3580 KB Output is correct
22 Correct 9 ms 3448 KB Output is correct
23 Correct 9 ms 3576 KB Output is correct
24 Correct 6 ms 2680 KB Output is correct
25 Correct 39 ms 11684 KB Output is correct
26 Correct 38 ms 11684 KB Output is correct
27 Correct 40 ms 11684 KB Output is correct
28 Correct 27 ms 9336 KB Output is correct
29 Correct 47 ms 12200 KB Output is correct
30 Correct 48 ms 12196 KB Output is correct
31 Correct 44 ms 11304 KB Output is correct
32 Correct 42 ms 11048 KB Output is correct
33 Correct 557 ms 84432 KB Output is correct
34 Correct 527 ms 84348 KB Output is correct
35 Correct 569 ms 84340 KB Output is correct
36 Correct 675 ms 84328 KB Output is correct
37 Correct 548 ms 90672 KB Output is correct
38 Correct 584 ms 90668 KB Output is correct
39 Correct 652 ms 90756 KB Output is correct
40 Correct 531 ms 87760 KB Output is correct
41 Correct 292 ms 52152 KB Output is correct
42 Correct 406 ms 60112 KB Output is correct
43 Correct 872 ms 92904 KB Output is correct
44 Correct 874 ms 93576 KB Output is correct
45 Correct 383 ms 54020 KB Output is correct
46 Correct 400 ms 49760 KB Output is correct
47 Correct 1117 ms 86504 KB Output is correct
48 Correct 949 ms 86672 KB Output is correct
49 Incorrect 33 ms 29000 KB Output isn't correct
50 Halted 0 ms 0 KB -