oj.uz

답안 #170111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
170111 2019-12-24T03:18:02 Z socho Rectangles (IOI19_rect) C++14
50 / 100
 5000 ms 246108 KB 
#include "rect.h"
#include "bits/stdc++.h"
#include <cstdio>
#include <unistd.h>
#include <cassert>
#include <string>
using namespace std;

int n, m;
vector<vector<pair<int, int> > > par;
vector<vector<int> > lowi, lowj, highi, highj;
vector<vector<int> > grid;
vector<vector<int> > pf;

void setup(int n, int m) {
	for (int i=0; i<n; i++) {
		par.push_back(vector<pair<int, int> >(m));
		lowi.push_back(vector<int>(m));
		lowj.push_back(vector<int>(m));
		highi.push_back(vector<int>(m));
		highj.push_back(vector<int>(m));
	}
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			par[i][j] = make_pair(i, j);
			lowi[i][j] = i;
			lowj[i][j] = j;
			highi[i][j] = i;
			highj[i][j] = j;
		}
	}
}

pair<int, int> parent(pair<int, int> where) {
	if (par[where.first][where.second] == where) return where;
	return par[where.first][where.second] = parent(par[where.first][where.second]);
}

bool arc(pair<int, int> a, pair<int, int> b) {
	return parent(a) == parent(b);
}

void connect(pair<int, int> a, pair<int, int> b) {
	if (arc(a, b)) return;
	pair<int, int> ax = parent(a);
	pair<int, int> bx = parent(b);
	par[bx.first][bx.second] = ax;
	lowi[ax.first][ax.second] = min(lowi[ax.first][ax.second], lowi[bx.first][bx.second]);
	lowj[ax.first][ax.second] = min(lowj[ax.first][ax.second], lowj[bx.first][bx.second]);
	highi[ax.first][ax.second] = max(highi[ax.first][ax.second], highi[bx.first][bx.second]);
	highj[ax.first][ax.second] = max(highj[ax.first][ax.second], highj[bx.first][bx.second]);
}

int getlowi(pair<int, int> a) {
	a = parent(a);
	return lowi[a.first][a.second];
}

int getlowj(pair<int, int> a) {
	a = parent(a);
	return lowj[a.first][a.second];
}

int gethighi(pair<int, int> a) {
	a = parent(a);
	return highi[a.first][a.second];
}

int gethighj(pair<int, int> a) {
	a = parent(a);
	return highj[a.first][a.second];
}

void dopf() {
	for (int i=1; i<n; i++) {
		pf[i][0] = pf[i-1][0] + grid[i][0];
	}
	for (int i=1; i<m; i++) {
		pf[0][i] = pf[0][i-1] + grid[0][i];
	}
	for (int i=1; i<n; i++) {
		for (int j=1; j<m; j++) {
			pf[i][j] = pf[i-1][j] + pf[i][j-1] - pf[i-1][j-1] + grid[i][j];
		}
	}
}

int pfq(int a, int b) {
	if (a < 0) return 0;
	if (b < 0) return 0;
	return pf[min(n-1, a)][min(m-1, b)];
}

int qpf(int a, int b, int c, int d) {
	return pfq(c, d) + pfq(a-1, b-1) - pfq(c, b-1) - pfq(a-1, d);
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	
	n = a.size();
	m = a[0].size();
	grid = a;
	pf = a;
	dopf();
	
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			if (a[i][j] != 0 && a[i][j] != 1) {
				int count = 0;
	
				for (int i=1; i<n-1; i++) {
					for (int j=1; j<m-1; j++) {
						for (int k=i; k<n-1; k++) {
							for (int l=j; l<m-1; l++) {
								// check i,j to k,l
								bool ok = true;
								for (int x=i; x<=k && ok; x++) {
									for (int y=j; y<=l && ok; y++) {
										if (a[x][y] >= a[i-1][y]) ok = false;
										if (a[x][y] >= a[k+1][y]) ok = false;
										if (a[x][y] >= a[x][j-1]) ok = false;
										if (a[x][y] >= a[x][l+1]) ok = false;
									}
								}
								count += ok;
							}
						}
					}
				}
				
				return count;
			}
		}
	}
	
	setup(n, m);
	for (int i=0; i<n-1; i++) {
		for (int j=0; j<m; j++) {
			if (a[i][j] == 0 && a[i+1][j] == 0) {
				// cout << i << ' ' << j << ' ' << i + 1 << ' ' << j << endl;
				connect(make_pair(i, j), make_pair(i+1, j));
			}
		}
	}
	for (int i=0; i<n; i++) {
		for (int j=0; j<m-1; j++) {
			if (a[i][j] == 0 && a[i][j+1] == 0) {
				// cout << i << ' ' << j << ' ' << i << ' ' << j + 1 << endl;
				connect(make_pair(i, j), make_pair(i, j+1));
			}
		}
	}
	
	int res = 0;
	
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			pair<int, int> f = make_pair(i, j);
			// cout << i << ':' << j << " par: " << parent(f).first << ':' << parent(f).second << " val: " << a[i][j] << endl;
			if (parent(f) == f && a[i][j] == 0) {
				// cout << "SEARCH" << endl;
				int li = getlowi(f);
				int hi = gethighi(f);
				int lj = getlowj(f);
				int hj = gethighj(f);
				if (li == 0) continue;
				if (lj == 0) continue;
				if (hi == n-1) continue;
				if (hj == m-1) continue;
				// cout << li << ' ' << lj << ' ' << hi << ' ' << hj << endl;
				// cout << " > " << i << ' ' << j << endl;
				if (qpf(li, lj, hi, hj) == 0) {
					// cout << " USE " << endl;
					res++;
				}
			}
		}
	}
	
	return res;
	
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 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 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 66 ms 496 KB Output is correct
18 Correct 64 ms 632 KB Output is correct
19 Correct 66 ms 504 KB Output is correct
20 Correct 53 ms 496 KB Output is correct
21 Correct 60 ms 504 KB Output is correct
22 Correct 60 ms 504 KB Output is correct
23 Correct 60 ms 504 KB Output is correct
24 Correct 18 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 66 ms 496 KB Output is correct
18 Correct 64 ms 632 KB Output is correct
19 Correct 66 ms 504 KB Output is correct
20 Correct 53 ms 496 KB Output is correct
21 Correct 60 ms 504 KB Output is correct
22 Correct 60 ms 504 KB Output is correct
23 Correct 60 ms 504 KB Output is correct
24 Correct 18 ms 376 KB Output is correct
25 Correct 2357 ms 1236 KB Output is correct
26 Correct 2354 ms 1244 KB Output is correct
27 Correct 2353 ms 1400 KB Output is correct
28 Correct 1896 ms 1128 KB Output is correct
29 Correct 2236 ms 1196 KB Output is correct
30 Correct 2239 ms 1348 KB Output is correct
31 Correct 2163 ms 1276 KB Output is correct
32 Correct 2130 ms 1272 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 66 ms 496 KB Output is correct
18 Correct 64 ms 632 KB Output is correct
19 Correct 66 ms 504 KB Output is correct
20 Correct 53 ms 496 KB Output is correct
21 Correct 60 ms 504 KB Output is correct
22 Correct 60 ms 504 KB Output is correct
23 Correct 60 ms 504 KB Output is correct
24 Correct 18 ms 376 KB Output is correct
25 Correct 2357 ms 1236 KB Output is correct
26 Correct 2354 ms 1244 KB Output is correct
27 Correct 2353 ms 1400 KB Output is correct
28 Correct 1896 ms 1128 KB Output is correct
29 Correct 2236 ms 1196 KB Output is correct
30 Correct 2239 ms 1348 KB Output is correct
31 Correct 2163 ms 1276 KB Output is correct
32 Correct 2130 ms 1272 KB Output is correct
33 Execution timed out 5095 ms 9720 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 504 KB Output is correct
2 Correct 16 ms 504 KB Output is correct
3 Correct 3 ms 660 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 30 ms 632 KB Output is correct
6 Correct 30 ms 504 KB Output is correct
7 Correct 31 ms 504 KB Output is correct
8 Correct 30 ms 552 KB Output is correct
9 Correct 27 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 427 ms 113756 KB Output is correct
3 Correct 926 ms 244856 KB Output is correct
4 Correct 933 ms 246016 KB Output is correct
5 Correct 961 ms 245880 KB Output is correct
6 Correct 556 ms 121604 KB Output is correct
7 Correct 1032 ms 230672 KB Output is correct
8 Correct 1092 ms 246108 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 66 ms 496 KB Output is correct
18 Correct 64 ms 632 KB Output is correct
19 Correct 66 ms 504 KB Output is correct
20 Correct 53 ms 496 KB Output is correct
21 Correct 60 ms 504 KB Output is correct
22 Correct 60 ms 504 KB Output is correct
23 Correct 60 ms 504 KB Output is correct
24 Correct 18 ms 376 KB Output is correct
25 Correct 2357 ms 1236 KB Output is correct
26 Correct 2354 ms 1244 KB Output is correct
27 Correct 2353 ms 1400 KB Output is correct
28 Correct 1896 ms 1128 KB Output is correct
29 Correct 2236 ms 1196 KB Output is correct
30 Correct 2239 ms 1348 KB Output is correct
31 Correct 2163 ms 1276 KB Output is correct
32 Correct 2130 ms 1272 KB Output is correct
33 Execution timed out 5095 ms 9720 KB Time limit exceeded
34 Halted 0 ms 0 KB -