oj.uz

Submission #155602

# Submission time Handle Problem Language Result Execution time Memory
155602 2019-09-29T08:14:33 Z vanic Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 600652 KB 
#include "rect.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <map>
#include <stack>
 
using namespace std;
 
typedef long long ll;
const int maxn=2505;
 
int n, m;
int l[maxn][maxn];
vector < int > r[maxn][maxn], c[maxn][maxn];
pair < int, int > red[maxn][maxn], stup[maxn][maxn];
map < ll, bool > bio, bio2, bio3;
 
inline ll hashiraj(ll a, ll b, ll c, ll d){
	return a*maxn*maxn*maxn+b*maxn*maxn+c*maxn+d;
}
 
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[hashiraj(0, red[x][i].first, red[x][i].second, x)]){
			bio2[hashiraj(0, red[x][i].first, red[x][i].second, x)]=1;
			r[red[x][i].first][red[x][i].second].push_back(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[hashiraj(0, stup[i][x].first, stup[i][x].second, x)]){
			bio3[hashiraj(0, stup[i][x].first, stup[i][x].second, x)]=1;
			c[stup[i][x].first][stup[i][x].second].push_back(x);
		}
		q.push(make_pair(l[i][x], i));
	}
}
 
 
int binary(int x, vector < int > &l){
	int lo=0, hi=l.size()-1, mid;
	while(lo<hi){
		mid=(lo+hi)/2;
		if(l[mid]<x){
			lo=mid+1;
		}
		else{
			hi=mid;
		}
	}
	return lo;
}
 
bool 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 0;
	}
	int pos1=binary(c1, r[r1][r2]);
	int pos2=binary(r1, c[c1][c2]);
/*	printf("novi\n");
	printf("%d %d\n", x, y);
	printf("%d %d\n", r1, r2);
	printf("%d %d\n", c1, c2);
	printf("%d %d\n", pos1, pos2);
	for(int i=0; i<r[r1][r2].size(); i++){
		printf("%d ", r[r1][r2][i]);
	}
	printf("\n");
	for(int i=0; i<c[c1][c2].size(); i++){
		printf("%d ", c[c1][c2][i]);
	}
	printf("\n");*/
	if(r[r1][r2][pos1]==c1 && r[r1][r2].size()-pos1-c2+c1-1>=0 && r[r1][r2][pos1+c2-c1]==c2
	&& c[c1][c2][pos2]==r1 && c[c1][c2].size()-pos2-r2+r1-1>=0 && c[c1][c2][pos2+r2-r1]==r2){
		if(!bio[hashiraj(r1, r2, c1, c2)]){
//			printf("cudo\n");
			bio[hashiraj(r1, r2, c1, c2)]=1;
			return 1;
		}
	}
	return 0;
}
 
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);
	}
	int br=0;
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			if(provjeri(i, j)){
				br++;
			}
		}
	}
	return br;
}
 
/*
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);
	}
	int br=0;
	for(int i=1; i<n-1; i++){
		for(int j=1; j<m-1; j++){
			if(provjeri(i, j)){
				br++;
			}
		}
	}
	printf("%d\n", br);
	return 0;
}*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 295092 KB Output is correct
2 Correct 285 ms 295556 KB Output is correct
3 Correct 270 ms 295672 KB Output is correct
4 Correct 282 ms 295648 KB Output is correct
5 Correct 273 ms 295416 KB Output is correct
6 Correct 271 ms 295516 KB Output is correct
7 Correct 270 ms 295488 KB Output is correct
8 Correct 268 ms 295260 KB Output is correct
9 Correct 270 ms 295456 KB Output is correct
10 Correct 269 ms 295492 KB Output is correct
11 Correct 269 ms 295544 KB Output is correct
12 Correct 270 ms 295544 KB Output is correct
13 Correct 269 ms 295088 KB Output is correct
14 Correct 267 ms 295188 KB Output is correct
15 Correct 270 ms 295200 KB Output is correct
16 Correct 269 ms 295032 KB Output is correct
17 Correct 289 ms 295044 KB Output is correct
18 Correct 339 ms 295160 KB Output is correct
19 Correct 315 ms 295416 KB Output is correct
20 Correct 270 ms 295404 KB Output is correct
21 Correct 316 ms 295160 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 295092 KB Output is correct
2 Correct 285 ms 295556 KB Output is correct
3 Correct 270 ms 295672 KB Output is correct
4 Correct 282 ms 295648 KB Output is correct
5 Correct 273 ms 295416 KB Output is correct
6 Correct 271 ms 295516 KB Output is correct
7 Correct 270 ms 295488 KB Output is correct
8 Correct 268 ms 295260 KB Output is correct
9 Correct 270 ms 295456 KB Output is correct
10 Correct 269 ms 295492 KB Output is correct
11 Correct 269 ms 295544 KB Output is correct
12 Correct 270 ms 295544 KB Output is correct
13 Correct 269 ms 295088 KB Output is correct
14 Correct 267 ms 295188 KB Output is correct
15 Correct 270 ms 295200 KB Output is correct
16 Correct 269 ms 295032 KB Output is correct
17 Correct 280 ms 297556 KB Output is correct
18 Correct 277 ms 297552 KB Output is correct
19 Correct 275 ms 297464 KB Output is correct
20 Correct 273 ms 296604 KB Output is correct
21 Correct 276 ms 297208 KB Output is correct
22 Correct 278 ms 297212 KB Output is correct
23 Correct 278 ms 297192 KB Output is correct
24 Correct 272 ms 296568 KB Output is correct
25 Correct 289 ms 295044 KB Output is correct
26 Correct 339 ms 295160 KB Output is correct
27 Correct 315 ms 295416 KB Output is correct
28 Correct 270 ms 295404 KB Output is correct
29 Correct 316 ms 295160 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 295092 KB Output is correct
2 Correct 285 ms 295556 KB Output is correct
3 Correct 270 ms 295672 KB Output is correct
4 Correct 282 ms 295648 KB Output is correct
5 Correct 273 ms 295416 KB Output is correct
6 Correct 271 ms 295516 KB Output is correct
7 Correct 270 ms 295488 KB Output is correct
8 Correct 268 ms 295260 KB Output is correct
9 Correct 270 ms 295456 KB Output is correct
10 Correct 269 ms 295492 KB Output is correct
11 Correct 269 ms 295544 KB Output is correct
12 Correct 270 ms 295544 KB Output is correct
13 Correct 269 ms 295088 KB Output is correct
14 Correct 267 ms 295188 KB Output is correct
15 Correct 270 ms 295200 KB Output is correct
16 Correct 269 ms 295032 KB Output is correct
17 Correct 280 ms 297556 KB Output is correct
18 Correct 277 ms 297552 KB Output is correct
19 Correct 275 ms 297464 KB Output is correct
20 Correct 273 ms 296604 KB Output is correct
21 Correct 276 ms 297208 KB Output is correct
22 Correct 278 ms 297212 KB Output is correct
23 Correct 278 ms 297192 KB Output is correct
24 Correct 272 ms 296568 KB Output is correct
25 Correct 341 ms 306632 KB Output is correct
26 Correct 340 ms 306652 KB Output is correct
27 Correct 346 ms 306936 KB Output is correct
28 Correct 303 ms 301100 KB Output is correct
29 Correct 338 ms 305228 KB Output is correct
30 Correct 342 ms 305372 KB Output is correct
31 Correct 338 ms 304960 KB Output is correct
32 Correct 375 ms 304784 KB Output is correct
33 Correct 289 ms 295044 KB Output is correct
34 Correct 339 ms 295160 KB Output is correct
35 Correct 315 ms 295416 KB Output is correct
36 Correct 270 ms 295404 KB Output is correct
37 Correct 316 ms 295160 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 295092 KB Output is correct
2 Correct 285 ms 295556 KB Output is correct
3 Correct 270 ms 295672 KB Output is correct
4 Correct 282 ms 295648 KB Output is correct
5 Correct 273 ms 295416 KB Output is correct
6 Correct 271 ms 295516 KB Output is correct
7 Correct 270 ms 295488 KB Output is correct
8 Correct 268 ms 295260 KB Output is correct
9 Correct 270 ms 295456 KB Output is correct
10 Correct 269 ms 295492 KB Output is correct
11 Correct 269 ms 295544 KB Output is correct
12 Correct 270 ms 295544 KB Output is correct
13 Correct 269 ms 295088 KB Output is correct
14 Correct 267 ms 295188 KB Output is correct
15 Correct 270 ms 295200 KB Output is correct
16 Correct 269 ms 295032 KB Output is correct
17 Correct 280 ms 297556 KB Output is correct
18 Correct 277 ms 297552 KB Output is correct
19 Correct 275 ms 297464 KB Output is correct
20 Correct 273 ms 296604 KB Output is correct
21 Correct 276 ms 297208 KB Output is correct
22 Correct 278 ms 297212 KB Output is correct
23 Correct 278 ms 297192 KB Output is correct
24 Correct 272 ms 296568 KB Output is correct
25 Correct 341 ms 306632 KB Output is correct
26 Correct 340 ms 306652 KB Output is correct
27 Correct 346 ms 306936 KB Output is correct
28 Correct 303 ms 301100 KB Output is correct
29 Correct 338 ms 305228 KB Output is correct
30 Correct 342 ms 305372 KB Output is correct
31 Correct 338 ms 304960 KB Output is correct
32 Correct 375 ms 304784 KB Output is correct
33 Correct 1281 ms 400136 KB Output is correct
34 Correct 1135 ms 400036 KB Output is correct
35 Correct 1099 ms 400060 KB Output is correct
36 Correct 1137 ms 399924 KB Output is correct
37 Correct 1471 ms 417912 KB Output is correct
38 Correct 1557 ms 418008 KB Output is correct
39 Correct 1472 ms 418316 KB Output is correct
40 Correct 1540 ms 410412 KB Output is correct
41 Correct 654 ms 336512 KB Output is correct
42 Correct 934 ms 347472 KB Output is correct
43 Correct 1779 ms 396356 KB Output is correct
44 Correct 1771 ms 399320 KB Output is correct
45 Correct 880 ms 351588 KB Output is correct
46 Correct 915 ms 347484 KB Output is correct
47 Correct 1598 ms 392268 KB Output is correct
48 Correct 1523 ms 393408 KB Output is correct
49 Correct 289 ms 295044 KB Output is correct
50 Correct 339 ms 295160 KB Output is correct
51 Correct 315 ms 295416 KB Output is correct
52 Correct 270 ms 295404 KB Output is correct
53 Correct 316 ms 295160 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 296440 KB Output is correct
2 Correct 283 ms 296204 KB Output is correct
3 Correct 280 ms 295416 KB Output is correct
4 Correct 268 ms 295032 KB Output is correct
5 Correct 275 ms 296540 KB Output is correct
6 Correct 276 ms 296440 KB Output is correct
7 Correct 276 ms 296568 KB Output is correct
8 Correct 275 ms 296444 KB Output is correct
9 Correct 275 ms 296412 KB Output is correct
10 Correct 272 ms 295544 KB Output is correct
11 Correct 275 ms 295900 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 295152 KB Output is correct
2 Correct 3737 ms 485468 KB Output is correct
3 Execution timed out 5105 ms 600652 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 295092 KB Output is correct
2 Correct 285 ms 295556 KB Output is correct
3 Correct 270 ms 295672 KB Output is correct
4 Correct 282 ms 295648 KB Output is correct
5 Correct 273 ms 295416 KB Output is correct
6 Correct 271 ms 295516 KB Output is correct
7 Correct 270 ms 295488 KB Output is correct
8 Correct 268 ms 295260 KB Output is correct
9 Correct 270 ms 295456 KB Output is correct
10 Correct 269 ms 295492 KB Output is correct
11 Correct 269 ms 295544 KB Output is correct
12 Correct 270 ms 295544 KB Output is correct
13 Correct 269 ms 295088 KB Output is correct
14 Correct 267 ms 295188 KB Output is correct
15 Correct 270 ms 295200 KB Output is correct
16 Correct 269 ms 295032 KB Output is correct
17 Correct 280 ms 297556 KB Output is correct
18 Correct 277 ms 297552 KB Output is correct
19 Correct 275 ms 297464 KB Output is correct
20 Correct 273 ms 296604 KB Output is correct
21 Correct 276 ms 297208 KB Output is correct
22 Correct 278 ms 297212 KB Output is correct
23 Correct 278 ms 297192 KB Output is correct
24 Correct 272 ms 296568 KB Output is correct
25 Correct 341 ms 306632 KB Output is correct
26 Correct 340 ms 306652 KB Output is correct
27 Correct 346 ms 306936 KB Output is correct
28 Correct 303 ms 301100 KB Output is correct
29 Correct 338 ms 305228 KB Output is correct
30 Correct 342 ms 305372 KB Output is correct
31 Correct 338 ms 304960 KB Output is correct
32 Correct 375 ms 304784 KB Output is correct
33 Correct 1281 ms 400136 KB Output is correct
34 Correct 1135 ms 400036 KB Output is correct
35 Correct 1099 ms 400060 KB Output is correct
36 Correct 1137 ms 399924 KB Output is correct
37 Correct 1471 ms 417912 KB Output is correct
38 Correct 1557 ms 418008 KB Output is correct
39 Correct 1472 ms 418316 KB Output is correct
40 Correct 1540 ms 410412 KB Output is correct
41 Correct 654 ms 336512 KB Output is correct
42 Correct 934 ms 347472 KB Output is correct
43 Correct 1779 ms 396356 KB Output is correct
44 Correct 1771 ms 399320 KB Output is correct
45 Correct 880 ms 351588 KB Output is correct
46 Correct 915 ms 347484 KB Output is correct
47 Correct 1598 ms 392268 KB Output is correct
48 Correct 1523 ms 393408 KB Output is correct
49 Correct 275 ms 296440 KB Output is correct
50 Correct 283 ms 296204 KB Output is correct
51 Correct 280 ms 295416 KB Output is correct
52 Correct 268 ms 295032 KB Output is correct
53 Correct 275 ms 296540 KB Output is correct
54 Correct 276 ms 296440 KB Output is correct
55 Correct 276 ms 296568 KB Output is correct
56 Correct 275 ms 296444 KB Output is correct
57 Correct 275 ms 296412 KB Output is correct
58 Correct 272 ms 295544 KB Output is correct
59 Correct 275 ms 295900 KB Output is correct
60 Correct 286 ms 295152 KB Output is correct
61 Correct 3737 ms 485468 KB Output is correct
62 Execution timed out 5105 ms 600652 KB Time limit exceeded
63 Halted 0 ms 0 KB -