oj.uz

Submission #155613

# Submission time Handle Problem Language Result Execution time Memory
155613 2019-09-29T08:51:24 Z vanic Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 610080 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>
#include <set>
#include <array>
 
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 > bio2, bio3;
set < array < int, 4 > > bio;

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, bool p, int y, int z){
	int lo=0, hi, mid;
	if(p){
		hi=r[y][z].size()-1;
	}
	else{
		hi=c[y][z].size()-1;
	}
	while(lo<hi){
		mid=(lo+hi)/2;
		if(p){
			if(r[y][z][mid]<x){
				lo=mid+1;
			}
			else{
				hi=mid;
			}
		}
		else{
			if(c[y][z][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, 1, r1, r2);
	int pos2=binary(r1, 0, 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.find({r1, r2, c1, c2})==bio.end()){
//			printf("cudo\n");
			bio.insert({r1, r2, c1, c2});
			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 321 ms 295032 KB Output is correct
2 Correct 294 ms 295544 KB Output is correct
3 Correct 292 ms 295580 KB Output is correct
4 Correct 291 ms 295672 KB Output is correct
5 Correct 288 ms 295396 KB Output is correct
6 Correct 291 ms 295544 KB Output is correct
7 Correct 320 ms 295416 KB Output is correct
8 Correct 289 ms 295260 KB Output is correct
9 Correct 291 ms 295672 KB Output is correct
10 Correct 331 ms 295552 KB Output is correct
11 Correct 309 ms 295544 KB Output is correct
12 Correct 291 ms 295544 KB Output is correct
13 Correct 290 ms 295032 KB Output is correct
14 Correct 288 ms 295280 KB Output is correct
15 Correct 292 ms 295288 KB Output is correct
16 Correct 290 ms 295108 KB Output is correct
17 Correct 292 ms 295032 KB Output is correct
18 Correct 290 ms 295088 KB Output is correct
19 Correct 291 ms 295516 KB Output is correct
20 Correct 289 ms 295548 KB Output is correct
21 Correct 310 ms 295124 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 295032 KB Output is correct
2 Correct 294 ms 295544 KB Output is correct
3 Correct 292 ms 295580 KB Output is correct
4 Correct 291 ms 295672 KB Output is correct
5 Correct 288 ms 295396 KB Output is correct
6 Correct 291 ms 295544 KB Output is correct
7 Correct 320 ms 295416 KB Output is correct
8 Correct 289 ms 295260 KB Output is correct
9 Correct 291 ms 295672 KB Output is correct
10 Correct 331 ms 295552 KB Output is correct
11 Correct 309 ms 295544 KB Output is correct
12 Correct 291 ms 295544 KB Output is correct
13 Correct 290 ms 295032 KB Output is correct
14 Correct 288 ms 295280 KB Output is correct
15 Correct 292 ms 295288 KB Output is correct
16 Correct 290 ms 295108 KB Output is correct
17 Correct 297 ms 297492 KB Output is correct
18 Correct 302 ms 297520 KB Output is correct
19 Correct 299 ms 297588 KB Output is correct
20 Correct 293 ms 296668 KB Output is correct
21 Correct 299 ms 297356 KB Output is correct
22 Correct 306 ms 297356 KB Output is correct
23 Correct 344 ms 297208 KB Output is correct
24 Correct 294 ms 296572 KB Output is correct
25 Correct 292 ms 295032 KB Output is correct
26 Correct 290 ms 295088 KB Output is correct
27 Correct 291 ms 295516 KB Output is correct
28 Correct 289 ms 295548 KB Output is correct
29 Correct 310 ms 295124 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 295032 KB Output is correct
2 Correct 294 ms 295544 KB Output is correct
3 Correct 292 ms 295580 KB Output is correct
4 Correct 291 ms 295672 KB Output is correct
5 Correct 288 ms 295396 KB Output is correct
6 Correct 291 ms 295544 KB Output is correct
7 Correct 320 ms 295416 KB Output is correct
8 Correct 289 ms 295260 KB Output is correct
9 Correct 291 ms 295672 KB Output is correct
10 Correct 331 ms 295552 KB Output is correct
11 Correct 309 ms 295544 KB Output is correct
12 Correct 291 ms 295544 KB Output is correct
13 Correct 290 ms 295032 KB Output is correct
14 Correct 288 ms 295280 KB Output is correct
15 Correct 292 ms 295288 KB Output is correct
16 Correct 290 ms 295108 KB Output is correct
17 Correct 297 ms 297492 KB Output is correct
18 Correct 302 ms 297520 KB Output is correct
19 Correct 299 ms 297588 KB Output is correct
20 Correct 293 ms 296668 KB Output is correct
21 Correct 299 ms 297356 KB Output is correct
22 Correct 306 ms 297356 KB Output is correct
23 Correct 344 ms 297208 KB Output is correct
24 Correct 294 ms 296572 KB Output is correct
25 Correct 364 ms 306800 KB Output is correct
26 Correct 416 ms 306680 KB Output is correct
27 Correct 415 ms 306820 KB Output is correct
28 Correct 352 ms 301244 KB Output is correct
29 Correct 416 ms 305272 KB Output is correct
30 Correct 371 ms 305304 KB Output is correct
31 Correct 357 ms 305016 KB Output is correct
32 Correct 389 ms 304804 KB Output is correct
33 Correct 292 ms 295032 KB Output is correct
34 Correct 290 ms 295088 KB Output is correct
35 Correct 291 ms 295516 KB Output is correct
36 Correct 289 ms 295548 KB Output is correct
37 Correct 310 ms 295124 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 295032 KB Output is correct
2 Correct 294 ms 295544 KB Output is correct
3 Correct 292 ms 295580 KB Output is correct
4 Correct 291 ms 295672 KB Output is correct
5 Correct 288 ms 295396 KB Output is correct
6 Correct 291 ms 295544 KB Output is correct
7 Correct 320 ms 295416 KB Output is correct
8 Correct 289 ms 295260 KB Output is correct
9 Correct 291 ms 295672 KB Output is correct
10 Correct 331 ms 295552 KB Output is correct
11 Correct 309 ms 295544 KB Output is correct
12 Correct 291 ms 295544 KB Output is correct
13 Correct 290 ms 295032 KB Output is correct
14 Correct 288 ms 295280 KB Output is correct
15 Correct 292 ms 295288 KB Output is correct
16 Correct 290 ms 295108 KB Output is correct
17 Correct 297 ms 297492 KB Output is correct
18 Correct 302 ms 297520 KB Output is correct
19 Correct 299 ms 297588 KB Output is correct
20 Correct 293 ms 296668 KB Output is correct
21 Correct 299 ms 297356 KB Output is correct
22 Correct 306 ms 297356 KB Output is correct
23 Correct 344 ms 297208 KB Output is correct
24 Correct 294 ms 296572 KB Output is correct
25 Correct 364 ms 306800 KB Output is correct
26 Correct 416 ms 306680 KB Output is correct
27 Correct 415 ms 306820 KB Output is correct
28 Correct 352 ms 301244 KB Output is correct
29 Correct 416 ms 305272 KB Output is correct
30 Correct 371 ms 305304 KB Output is correct
31 Correct 357 ms 305016 KB Output is correct
32 Correct 389 ms 304804 KB Output is correct
33 Correct 1333 ms 397160 KB Output is correct
34 Correct 1222 ms 397092 KB Output is correct
35 Correct 1115 ms 397108 KB Output is correct
36 Correct 1113 ms 397224 KB Output is correct
37 Correct 1440 ms 415016 KB Output is correct
38 Correct 1569 ms 414880 KB Output is correct
39 Correct 1525 ms 414956 KB Output is correct
40 Correct 1579 ms 407352 KB Output is correct
41 Correct 671 ms 335700 KB Output is correct
42 Correct 831 ms 346836 KB Output is correct
43 Correct 1667 ms 394836 KB Output is correct
44 Correct 1833 ms 396152 KB Output is correct
45 Correct 917 ms 350136 KB Output is correct
46 Correct 934 ms 345776 KB Output is correct
47 Correct 1538 ms 389740 KB Output is correct
48 Correct 1517 ms 389800 KB Output is correct
49 Correct 292 ms 295032 KB Output is correct
50 Correct 290 ms 295088 KB Output is correct
51 Correct 291 ms 295516 KB Output is correct
52 Correct 289 ms 295548 KB Output is correct
53 Correct 310 ms 295124 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 296528 KB Output is correct
2 Correct 335 ms 296312 KB Output is correct
3 Correct 292 ms 295512 KB Output is correct
4 Correct 290 ms 295132 KB Output is correct
5 Correct 297 ms 296632 KB Output is correct
6 Correct 299 ms 296636 KB Output is correct
7 Correct 297 ms 296568 KB Output is correct
8 Correct 298 ms 296548 KB Output is correct
9 Correct 298 ms 296440 KB Output is correct
10 Correct 291 ms 295676 KB Output is correct
11 Correct 316 ms 296156 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 295108 KB Output is correct
2 Correct 3384 ms 485700 KB Output is correct
3 Execution timed out 5060 ms 610080 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 295032 KB Output is correct
2 Correct 294 ms 295544 KB Output is correct
3 Correct 292 ms 295580 KB Output is correct
4 Correct 291 ms 295672 KB Output is correct
5 Correct 288 ms 295396 KB Output is correct
6 Correct 291 ms 295544 KB Output is correct
7 Correct 320 ms 295416 KB Output is correct
8 Correct 289 ms 295260 KB Output is correct
9 Correct 291 ms 295672 KB Output is correct
10 Correct 331 ms 295552 KB Output is correct
11 Correct 309 ms 295544 KB Output is correct
12 Correct 291 ms 295544 KB Output is correct
13 Correct 290 ms 295032 KB Output is correct
14 Correct 288 ms 295280 KB Output is correct
15 Correct 292 ms 295288 KB Output is correct
16 Correct 290 ms 295108 KB Output is correct
17 Correct 297 ms 297492 KB Output is correct
18 Correct 302 ms 297520 KB Output is correct
19 Correct 299 ms 297588 KB Output is correct
20 Correct 293 ms 296668 KB Output is correct
21 Correct 299 ms 297356 KB Output is correct
22 Correct 306 ms 297356 KB Output is correct
23 Correct 344 ms 297208 KB Output is correct
24 Correct 294 ms 296572 KB Output is correct
25 Correct 364 ms 306800 KB Output is correct
26 Correct 416 ms 306680 KB Output is correct
27 Correct 415 ms 306820 KB Output is correct
28 Correct 352 ms 301244 KB Output is correct
29 Correct 416 ms 305272 KB Output is correct
30 Correct 371 ms 305304 KB Output is correct
31 Correct 357 ms 305016 KB Output is correct
32 Correct 389 ms 304804 KB Output is correct
33 Correct 1333 ms 397160 KB Output is correct
34 Correct 1222 ms 397092 KB Output is correct
35 Correct 1115 ms 397108 KB Output is correct
36 Correct 1113 ms 397224 KB Output is correct
37 Correct 1440 ms 415016 KB Output is correct
38 Correct 1569 ms 414880 KB Output is correct
39 Correct 1525 ms 414956 KB Output is correct
40 Correct 1579 ms 407352 KB Output is correct
41 Correct 671 ms 335700 KB Output is correct
42 Correct 831 ms 346836 KB Output is correct
43 Correct 1667 ms 394836 KB Output is correct
44 Correct 1833 ms 396152 KB Output is correct
45 Correct 917 ms 350136 KB Output is correct
46 Correct 934 ms 345776 KB Output is correct
47 Correct 1538 ms 389740 KB Output is correct
48 Correct 1517 ms 389800 KB Output is correct
49 Correct 322 ms 296528 KB Output is correct
50 Correct 335 ms 296312 KB Output is correct
51 Correct 292 ms 295512 KB Output is correct
52 Correct 290 ms 295132 KB Output is correct
53 Correct 297 ms 296632 KB Output is correct
54 Correct 299 ms 296636 KB Output is correct
55 Correct 297 ms 296568 KB Output is correct
56 Correct 298 ms 296548 KB Output is correct
57 Correct 298 ms 296440 KB Output is correct
58 Correct 291 ms 295676 KB Output is correct
59 Correct 316 ms 296156 KB Output is correct
60 Correct 295 ms 295108 KB Output is correct
61 Correct 3384 ms 485700 KB Output is correct
62 Execution timed out 5060 ms 610080 KB Time limit exceeded
63 Halted 0 ms 0 KB -