oj.uz

Submission #155603

# Submission time Handle Problem Language Result Execution time Memory
155603 2019-09-29T08:16:38 Z vanic Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 607604 KB 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#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;
}*/

Compilation message

rect.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 295132 KB Output is correct
2 Correct 302 ms 295656 KB Output is correct
3 Correct 291 ms 295672 KB Output is correct
4 Correct 319 ms 295600 KB Output is correct
5 Correct 304 ms 295436 KB Output is correct
6 Correct 316 ms 295644 KB Output is correct
7 Correct 293 ms 295444 KB Output is correct
8 Correct 291 ms 295316 KB Output is correct
9 Correct 301 ms 295504 KB Output is correct
10 Correct 301 ms 295564 KB Output is correct
11 Correct 364 ms 295548 KB Output is correct
12 Correct 329 ms 295644 KB Output is correct
13 Correct 319 ms 295132 KB Output is correct
14 Correct 289 ms 295152 KB Output is correct
15 Correct 301 ms 295160 KB Output is correct
16 Correct 297 ms 295160 KB Output is correct
17 Correct 319 ms 295032 KB Output is correct
18 Correct 287 ms 295028 KB Output is correct
19 Correct 287 ms 295388 KB Output is correct
20 Correct 288 ms 295588 KB Output is correct
21 Correct 288 ms 295288 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 295132 KB Output is correct
2 Correct 302 ms 295656 KB Output is correct
3 Correct 291 ms 295672 KB Output is correct
4 Correct 319 ms 295600 KB Output is correct
5 Correct 304 ms 295436 KB Output is correct
6 Correct 316 ms 295644 KB Output is correct
7 Correct 293 ms 295444 KB Output is correct
8 Correct 291 ms 295316 KB Output is correct
9 Correct 301 ms 295504 KB Output is correct
10 Correct 301 ms 295564 KB Output is correct
11 Correct 364 ms 295548 KB Output is correct
12 Correct 329 ms 295644 KB Output is correct
13 Correct 319 ms 295132 KB Output is correct
14 Correct 289 ms 295152 KB Output is correct
15 Correct 301 ms 295160 KB Output is correct
16 Correct 297 ms 295160 KB Output is correct
17 Correct 298 ms 297472 KB Output is correct
18 Correct 303 ms 297568 KB Output is correct
19 Correct 296 ms 297464 KB Output is correct
20 Correct 292 ms 296568 KB Output is correct
21 Correct 298 ms 297180 KB Output is correct
22 Correct 304 ms 297336 KB Output is correct
23 Correct 298 ms 297140 KB Output is correct
24 Correct 294 ms 296620 KB Output is correct
25 Correct 319 ms 295032 KB Output is correct
26 Correct 287 ms 295028 KB Output is correct
27 Correct 287 ms 295388 KB Output is correct
28 Correct 288 ms 295588 KB Output is correct
29 Correct 288 ms 295288 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 295132 KB Output is correct
2 Correct 302 ms 295656 KB Output is correct
3 Correct 291 ms 295672 KB Output is correct
4 Correct 319 ms 295600 KB Output is correct
5 Correct 304 ms 295436 KB Output is correct
6 Correct 316 ms 295644 KB Output is correct
7 Correct 293 ms 295444 KB Output is correct
8 Correct 291 ms 295316 KB Output is correct
9 Correct 301 ms 295504 KB Output is correct
10 Correct 301 ms 295564 KB Output is correct
11 Correct 364 ms 295548 KB Output is correct
12 Correct 329 ms 295644 KB Output is correct
13 Correct 319 ms 295132 KB Output is correct
14 Correct 289 ms 295152 KB Output is correct
15 Correct 301 ms 295160 KB Output is correct
16 Correct 297 ms 295160 KB Output is correct
17 Correct 298 ms 297472 KB Output is correct
18 Correct 303 ms 297568 KB Output is correct
19 Correct 296 ms 297464 KB Output is correct
20 Correct 292 ms 296568 KB Output is correct
21 Correct 298 ms 297180 KB Output is correct
22 Correct 304 ms 297336 KB Output is correct
23 Correct 298 ms 297140 KB Output is correct
24 Correct 294 ms 296620 KB Output is correct
25 Correct 362 ms 306704 KB Output is correct
26 Correct 360 ms 306564 KB Output is correct
27 Correct 356 ms 306592 KB Output is correct
28 Correct 323 ms 301028 KB Output is correct
29 Correct 353 ms 305096 KB Output is correct
30 Correct 361 ms 305068 KB Output is correct
31 Correct 350 ms 304544 KB Output is correct
32 Correct 356 ms 304632 KB Output is correct
33 Correct 319 ms 295032 KB Output is correct
34 Correct 287 ms 295028 KB Output is correct
35 Correct 287 ms 295388 KB Output is correct
36 Correct 288 ms 295588 KB Output is correct
37 Correct 288 ms 295288 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 295132 KB Output is correct
2 Correct 302 ms 295656 KB Output is correct
3 Correct 291 ms 295672 KB Output is correct
4 Correct 319 ms 295600 KB Output is correct
5 Correct 304 ms 295436 KB Output is correct
6 Correct 316 ms 295644 KB Output is correct
7 Correct 293 ms 295444 KB Output is correct
8 Correct 291 ms 295316 KB Output is correct
9 Correct 301 ms 295504 KB Output is correct
10 Correct 301 ms 295564 KB Output is correct
11 Correct 364 ms 295548 KB Output is correct
12 Correct 329 ms 295644 KB Output is correct
13 Correct 319 ms 295132 KB Output is correct
14 Correct 289 ms 295152 KB Output is correct
15 Correct 301 ms 295160 KB Output is correct
16 Correct 297 ms 295160 KB Output is correct
17 Correct 298 ms 297472 KB Output is correct
18 Correct 303 ms 297568 KB Output is correct
19 Correct 296 ms 297464 KB Output is correct
20 Correct 292 ms 296568 KB Output is correct
21 Correct 298 ms 297180 KB Output is correct
22 Correct 304 ms 297336 KB Output is correct
23 Correct 298 ms 297140 KB Output is correct
24 Correct 294 ms 296620 KB Output is correct
25 Correct 362 ms 306704 KB Output is correct
26 Correct 360 ms 306564 KB Output is correct
27 Correct 356 ms 306592 KB Output is correct
28 Correct 323 ms 301028 KB Output is correct
29 Correct 353 ms 305096 KB Output is correct
30 Correct 361 ms 305068 KB Output is correct
31 Correct 350 ms 304544 KB Output is correct
32 Correct 356 ms 304632 KB Output is correct
33 Correct 1368 ms 396832 KB Output is correct
34 Correct 1226 ms 396828 KB Output is correct
35 Correct 1099 ms 396836 KB Output is correct
36 Correct 1110 ms 396920 KB Output is correct
37 Correct 1541 ms 414720 KB Output is correct
38 Correct 1575 ms 414480 KB Output is correct
39 Correct 1569 ms 414684 KB Output is correct
40 Correct 1484 ms 407100 KB Output is correct
41 Correct 657 ms 335396 KB Output is correct
42 Correct 846 ms 346552 KB Output is correct
43 Correct 1715 ms 394688 KB Output is correct
44 Correct 1736 ms 395668 KB Output is correct
45 Correct 881 ms 349912 KB Output is correct
46 Correct 891 ms 345524 KB Output is correct
47 Correct 1504 ms 389372 KB Output is correct
48 Correct 1533 ms 389712 KB Output is correct
49 Correct 319 ms 295032 KB Output is correct
50 Correct 287 ms 295028 KB Output is correct
51 Correct 287 ms 295388 KB Output is correct
52 Correct 288 ms 295588 KB Output is correct
53 Correct 288 ms 295288 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 296440 KB Output is correct
2 Correct 295 ms 296260 KB Output is correct
3 Correct 299 ms 295476 KB Output is correct
4 Correct 310 ms 295160 KB Output is correct
5 Correct 305 ms 296440 KB Output is correct
6 Correct 299 ms 296440 KB Output is correct
7 Correct 294 ms 296468 KB Output is correct
8 Correct 294 ms 296440 KB Output is correct
9 Correct 294 ms 296388 KB Output is correct
10 Correct 293 ms 295484 KB Output is correct
11 Correct 312 ms 296076 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 295144 KB Output is correct
2 Correct 3581 ms 485628 KB Output is correct
3 Execution timed out 5049 ms 607604 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 295132 KB Output is correct
2 Correct 302 ms 295656 KB Output is correct
3 Correct 291 ms 295672 KB Output is correct
4 Correct 319 ms 295600 KB Output is correct
5 Correct 304 ms 295436 KB Output is correct
6 Correct 316 ms 295644 KB Output is correct
7 Correct 293 ms 295444 KB Output is correct
8 Correct 291 ms 295316 KB Output is correct
9 Correct 301 ms 295504 KB Output is correct
10 Correct 301 ms 295564 KB Output is correct
11 Correct 364 ms 295548 KB Output is correct
12 Correct 329 ms 295644 KB Output is correct
13 Correct 319 ms 295132 KB Output is correct
14 Correct 289 ms 295152 KB Output is correct
15 Correct 301 ms 295160 KB Output is correct
16 Correct 297 ms 295160 KB Output is correct
17 Correct 298 ms 297472 KB Output is correct
18 Correct 303 ms 297568 KB Output is correct
19 Correct 296 ms 297464 KB Output is correct
20 Correct 292 ms 296568 KB Output is correct
21 Correct 298 ms 297180 KB Output is correct
22 Correct 304 ms 297336 KB Output is correct
23 Correct 298 ms 297140 KB Output is correct
24 Correct 294 ms 296620 KB Output is correct
25 Correct 362 ms 306704 KB Output is correct
26 Correct 360 ms 306564 KB Output is correct
27 Correct 356 ms 306592 KB Output is correct
28 Correct 323 ms 301028 KB Output is correct
29 Correct 353 ms 305096 KB Output is correct
30 Correct 361 ms 305068 KB Output is correct
31 Correct 350 ms 304544 KB Output is correct
32 Correct 356 ms 304632 KB Output is correct
33 Correct 1368 ms 396832 KB Output is correct
34 Correct 1226 ms 396828 KB Output is correct
35 Correct 1099 ms 396836 KB Output is correct
36 Correct 1110 ms 396920 KB Output is correct
37 Correct 1541 ms 414720 KB Output is correct
38 Correct 1575 ms 414480 KB Output is correct
39 Correct 1569 ms 414684 KB Output is correct
40 Correct 1484 ms 407100 KB Output is correct
41 Correct 657 ms 335396 KB Output is correct
42 Correct 846 ms 346552 KB Output is correct
43 Correct 1715 ms 394688 KB Output is correct
44 Correct 1736 ms 395668 KB Output is correct
45 Correct 881 ms 349912 KB Output is correct
46 Correct 891 ms 345524 KB Output is correct
47 Correct 1504 ms 389372 KB Output is correct
48 Correct 1533 ms 389712 KB Output is correct
49 Correct 298 ms 296440 KB Output is correct
50 Correct 295 ms 296260 KB Output is correct
51 Correct 299 ms 295476 KB Output is correct
52 Correct 310 ms 295160 KB Output is correct
53 Correct 305 ms 296440 KB Output is correct
54 Correct 299 ms 296440 KB Output is correct
55 Correct 294 ms 296468 KB Output is correct
56 Correct 294 ms 296440 KB Output is correct
57 Correct 294 ms 296388 KB Output is correct
58 Correct 293 ms 295484 KB Output is correct
59 Correct 312 ms 296076 KB Output is correct
60 Correct 291 ms 295144 KB Output is correct
61 Correct 3581 ms 485628 KB Output is correct
62 Execution timed out 5049 ms 607604 KB Time limit exceeded
63 Halted 0 ms 0 KB -