oj.uz

답안 #1008600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1008600 2024-06-26T15:28:30 Z PagodePaiva Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 1003848 KB 
#include "rect.h"
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 2510;
const int inf = 1e8;
int v[N][N];
int p1[N][N];
int p2[N][N];
int p3[N][N];
int p4[N][N];

struct Segtree{
	int tree[4*N];
	int join(int a, int b){
		return min(a, b);
	}
	void build(int node, int l, int r){
		if(l == r){
			tree[node] = inf;
			return;
		}
		int mid = (l+r)/2;
		build(2*node, l, mid);
		build(2*node+1, mid+1, r);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		return;
	}	
	void update(int node, int l, int r, int pos, int val){
		if(l == r){
			tree[node] = val;
			return;
		}
		int mid = (l+r)/2;
		if(l <= pos and pos <= mid) update(2*node, l, mid, pos, val);
		else update(2*node+1, mid+1, r, pos, val);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		return;
	}
	int query(int node, int l, int r, int tl, int tr){
		if(l <= tl and tr <= r) return tree[node];
		if(l > tr or tl > r) return inf;
		int mid = (tl+tr)/2;
		return join(query(2*node, l, r, tl, mid), query(2*node+1, l, r, mid+1, tr));
	}
} seg1[N], seg3[N];

struct Segtree2{
	int tree[4*N];
	int join(int a, int b){
		return max(a, b);
	}
	void build(int node, int l, int r){
		if(l == r){
			tree[node] = -1;
			return;
		}
		int mid = (l+r)/2;
		build(2*node, l, mid);
		build(2*node+1, mid+1, r);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		return;
	}	
	void update(int node, int l, int r, int pos, int val){
		if(l == r){
			tree[node] = val;
			return;
		}
		int mid = (l+r)/2;
		if(l <= pos and pos <= mid) update(2*node, l, mid, pos, val);
		else update(2*node+1, mid+1, r, pos, val);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		return;
	}
	int query(int node, int l, int r, int tl, int tr){
		if(l <= tl and tr <= r) return tree[node];
		if(l > tr or tl > r) return -1;
		int mid = (tl+tr)/2;
		return join(query(2*node, l, r, tl, mid), query(2*node+1, l, r, mid+1, tr));
	}
} seg2[N], seg4[N];

set <array <int, 4>> s;
int n, m;

bool check(int r1, int c1, int r2, int c2){
	if(s.find({r1, c1, r2, c2}) != s.end()) return false;
	if(r1 == 0 or r2 == n+1 or r2-r1 <= 1) return false;
	if(c1 == 0 or c2 == m+1 or c2-c1 <= 1) return false;
	if(r1+1 > r2-1 or c1+1 > c2-1) return false;
	if(c1 <= 0 or c1 > m or c2 <= 0 or c2 > m or r1 <= 0 or r1 > n or r2 <= 0 or r2 > n) return false;
	int x1 = seg1[c1].query(1,r1+1, r2-1, 1, n);
	if(c1+1 <= x1 and x1 <= c2-1) return false;
	x1 = seg2[c2].query(1, r1+1, r2-1, 1, n);
	if(c1 < x1 and x1 < c2) return false;
	int x2 = seg3[r1].query(1, c1+1, c2-1, 1, m);
	if(r1 < x2 and x2 < r2) return false;
	x2 = seg4[r2].query(1, c1+1, c2-1, 1, m);
	if(r1 < x2 and x2 < r2) return false;
	s.insert({r1, c1, r2, c2});
	return true;
}
long long count_rectangles(std::vector<std::vector<int32_t> > a) {
	n = a.size(), m = a[0].size();
	s.clear();
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			v[i][j] = a[i-1][j-1];
		}
	}
	for(int i = 1;i <= n;i++){
		stack <int> s;
		for(int j = 1;j <= m;j++){
			if(s.empty()) s.push(j);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[i][t]){
						p1[i][t] = j;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(j);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p1[i][t] = m+1;
			s.pop();
		}
	}
	for(int i = 1;i <= n;i++){
		stack <int> s;
		for(int j = m;j > 0;j--){
			if(s.empty()) s.push(j);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[i][t]){
						p2[i][t] = j;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(j);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p2[i][t] = 0;
			s.pop();
		}
	}
	for(int j = 1;j <= m;j++){
		stack <int> s;
		for(int i = 1;i <= n;i++){
			if(s.empty()) s.push(i);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[t][j]){
						p3[t][j] = i;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(i);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p3[t][j] = n+1;
			s.pop();
		}
	}
	for(int j = 1;j <= m;j++){
		stack <int> s;
		for(int i = n;i > 0;i--){
			if(s.empty()) s.push(i);
			else{
				while(!s.empty()){
					int t = s.top();
					if(v[i][j] >= v[t][j]){
						p4[t][j] = i;
						s.pop();
					}
					else{
						break;
					}
				}
				s.push(i);
			}
		}
		while(!s.empty()){
			int t = s.top();
			p4[t][j] = 0;
			s.pop();
		}
	}
	for(int i = 1;i <= m;i++){
		seg1[i].build(1, 1, n);
		seg2[i].build(1, 1, n);
	}
	for(int i = 1;i <= n;i++){
		seg3[i].build(1, 1, m);
		seg4[i].build(1, 1, m);
	}
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			seg1[j].update(1, 1, n, i, p1[i][j]);
			seg2[j].update(1, 1, n, i, p2[i][j]);
			seg3[i].update(1, 1, m, j, p3[i][j]);
			seg4[i].update(1, 1, m, j, p4[i][j]);
		}
	}
	for(int r1 = 1;r1 < n;r1++){
		for(int c1 = 1;c1 < m;c1++){
			int r2 = p3[r1][c1+1];
			int c2 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg1[c1].query(1, r1+1, r2-1, 1, n) : -1);
			check(r1, c1, r2, c2);
			c2 = p1[r1+1][c1];
			r2 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg3[r1].query(1, c1+1, c2-1, 1, m) : -1);
			check(r1, c1, r2, c2);
		}
	}
	for(int r1 = 1;r1 < n;r1++){
		for(int c2 = m;c2 > 1;c2--){
			int c1 = p2[r1+1][c2];
			int r2 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg3[r1].query(1, c1+1, c2-1, 1, m) : -1);
			check(r1, c1, r2, c2);
			r2 = p3[r1][c2-1];
			c1 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg2[c2].query(1, r1+1, r2-1, 1, n) : -1);
			check(r1, c1, r2, c2);
		}
	}
	for(int r2 = n;r2 > 1;r2--){
		for(int c1 = 1;c1 < m;c1++){
			int r1 = p4[r2][c1+1];
			int c2 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg1[c1].query(1, r1+1, r2-1, 1, n) : -1);
			check(r1, c1, r2, c2);
			c2 = p1[r2-1][c1];
			r1 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg4[r2].query(1, c1+1, c2-1, 1, m) : -1);
			check(r1, c1, r2, c2);
			/*
			int c2 = p1[r2-1][c1];
			int r1 = p4[r2][c1+1];
			check(r1, c1, r2, c2);
			*/
		}
	}
	for(int r2 = n;r2 > 1;r2--){
		for(int c2 = m;c2 > 1;c2--){
			int c1 = p2[r2-1][c2];
			int r1 = (1 <= c1+1 and c1+1 <= c2-1 and c2-1 <= m ? seg4[r2].query(1, c1+1, c2-1, 1, m) : -1);
			check(r1, c1, r2, c2);
			r1 = p4[r2][c2-1];
			c1 = (1 <= r1+1 and r1+1 <= r2-1 and r2-1 <= n ? seg2[c2].query(1, r1+1, r2-1, 1, n) : -1);
			check(r1, c1, r2, c2);
			/*
			int c1 = p2[r2-1][c2];
			int r1 = p4[r2][c2-1];
			check(r1, c1, r2, c2);
			*/
		}
	}
	return s.size();
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 1 ms 1724 KB Output is correct
3 Correct 2 ms 1552 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 2 ms 1624 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 448 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 1628 KB Output is correct
20 Correct 0 ms 1372 KB Output is correct
21 Correct 1 ms 600 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 1 ms 1724 KB Output is correct
3 Correct 2 ms 1552 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 2 ms 1624 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 448 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 1628 KB Output is correct
20 Correct 0 ms 1372 KB Output is correct
21 Correct 1 ms 600 KB Output is correct
22 Correct 9 ms 4700 KB Output is correct
23 Correct 7 ms 4760 KB Output is correct
24 Correct 7 ms 4700 KB Output is correct
25 Correct 4 ms 4300 KB Output is correct
26 Correct 6 ms 4444 KB Output is correct
27 Correct 6 ms 4444 KB Output is correct
28 Correct 8 ms 4444 KB Output is correct
29 Correct 4 ms 3420 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 1 ms 1724 KB Output is correct
3 Correct 2 ms 1552 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 2 ms 1624 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 9 ms 4700 KB Output is correct
18 Correct 7 ms 4760 KB Output is correct
19 Correct 7 ms 4700 KB Output is correct
20 Correct 4 ms 4300 KB Output is correct
21 Correct 6 ms 4444 KB Output is correct
22 Correct 6 ms 4444 KB Output is correct
23 Correct 8 ms 4444 KB Output is correct
24 Correct 4 ms 3420 KB Output is correct
25 Correct 0 ms 448 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 1628 KB Output is correct
28 Correct 0 ms 1372 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 55 ms 16052 KB Output is correct
31 Correct 48 ms 16212 KB Output is correct
32 Correct 54 ms 16264 KB Output is correct
33 Correct 33 ms 13288 KB Output is correct
34 Correct 43 ms 13908 KB Output is correct
35 Correct 47 ms 14116 KB Output is correct
36 Correct 40 ms 14160 KB Output is correct
37 Correct 40 ms 13904 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 1 ms 1724 KB Output is correct
3 Correct 2 ms 1552 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 2 ms 1624 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 9 ms 4700 KB Output is correct
18 Correct 7 ms 4760 KB Output is correct
19 Correct 7 ms 4700 KB Output is correct
20 Correct 4 ms 4300 KB Output is correct
21 Correct 6 ms 4444 KB Output is correct
22 Correct 6 ms 4444 KB Output is correct
23 Correct 8 ms 4444 KB Output is correct
24 Correct 4 ms 3420 KB Output is correct
25 Correct 55 ms 16052 KB Output is correct
26 Correct 48 ms 16212 KB Output is correct
27 Correct 54 ms 16264 KB Output is correct
28 Correct 33 ms 13288 KB Output is correct
29 Correct 43 ms 13908 KB Output is correct
30 Correct 47 ms 14116 KB Output is correct
31 Correct 40 ms 14160 KB Output is correct
32 Correct 40 ms 13904 KB Output is correct
33 Correct 0 ms 448 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 1628 KB Output is correct
36 Correct 0 ms 1372 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 315 ms 96920 KB Output is correct
39 Correct 305 ms 96852 KB Output is correct
40 Correct 306 ms 97024 KB Output is correct
41 Correct 268 ms 96988 KB Output is correct
42 Correct 878 ms 135508 KB Output is correct
43 Correct 845 ms 135172 KB Output is correct
44 Correct 886 ms 135508 KB Output is correct
45 Correct 798 ms 128696 KB Output is correct
46 Correct 365 ms 96336 KB Output is correct
47 Correct 470 ms 98384 KB Output is correct
48 Correct 726 ms 108708 KB Output is correct
49 Correct 686 ms 110420 KB Output is correct
50 Correct 310 ms 65364 KB Output is correct
51 Correct 302 ms 58192 KB Output is correct
52 Correct 657 ms 109392 KB Output is correct
53 Correct 704 ms 110420 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 22364 KB Output is correct
2 Correct 9 ms 19200 KB Output is correct
3 Correct 8 ms 22296 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 11 ms 22364 KB Output is correct
6 Correct 11 ms 22212 KB Output is correct
7 Correct 12 ms 22364 KB Output is correct
8 Correct 13 ms 22360 KB Output is correct
9 Correct 11 ms 22364 KB Output is correct
10 Correct 7 ms 21336 KB Output is correct
11 Correct 8 ms 21728 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 448 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 0 ms 1372 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 860 KB Output is correct
7 Correct 3108 ms 493904 KB Output is correct
8 Execution timed out 5137 ms 1003848 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 1 ms 1724 KB Output is correct
3 Correct 2 ms 1552 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 2 ms 1624 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 9 ms 4700 KB Output is correct
18 Correct 7 ms 4760 KB Output is correct
19 Correct 7 ms 4700 KB Output is correct
20 Correct 4 ms 4300 KB Output is correct
21 Correct 6 ms 4444 KB Output is correct
22 Correct 6 ms 4444 KB Output is correct
23 Correct 8 ms 4444 KB Output is correct
24 Correct 4 ms 3420 KB Output is correct
25 Correct 55 ms 16052 KB Output is correct
26 Correct 48 ms 16212 KB Output is correct
27 Correct 54 ms 16264 KB Output is correct
28 Correct 33 ms 13288 KB Output is correct
29 Correct 43 ms 13908 KB Output is correct
30 Correct 47 ms 14116 KB Output is correct
31 Correct 40 ms 14160 KB Output is correct
32 Correct 40 ms 13904 KB Output is correct
33 Correct 315 ms 96920 KB Output is correct
34 Correct 305 ms 96852 KB Output is correct
35 Correct 306 ms 97024 KB Output is correct
36 Correct 268 ms 96988 KB Output is correct
37 Correct 878 ms 135508 KB Output is correct
38 Correct 845 ms 135172 KB Output is correct
39 Correct 886 ms 135508 KB Output is correct
40 Correct 798 ms 128696 KB Output is correct
41 Correct 365 ms 96336 KB Output is correct
42 Correct 470 ms 98384 KB Output is correct
43 Correct 726 ms 108708 KB Output is correct
44 Correct 686 ms 110420 KB Output is correct
45 Correct 310 ms 65364 KB Output is correct
46 Correct 302 ms 58192 KB Output is correct
47 Correct 657 ms 109392 KB Output is correct
48 Correct 704 ms 110420 KB Output is correct
49 Correct 11 ms 22364 KB Output is correct
50 Correct 9 ms 19200 KB Output is correct
51 Correct 8 ms 22296 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 11 ms 22364 KB Output is correct
54 Correct 11 ms 22212 KB Output is correct
55 Correct 12 ms 22364 KB Output is correct
56 Correct 13 ms 22360 KB Output is correct
57 Correct 11 ms 22364 KB Output is correct
58 Correct 7 ms 21336 KB Output is correct
59 Correct 8 ms 21728 KB Output is correct
60 Correct 0 ms 860 KB Output is correct
61 Correct 3108 ms 493904 KB Output is correct
62 Execution timed out 5137 ms 1003848 KB Time limit exceeded
63 Halted 0 ms 0 KB -