제출 #294846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
294846		_7_7_	Rectangles (IOI19_rect)	C++14	13 / 100	487 ms	267512 KiB

rect

#include "rect.h"
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 2512;
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;

int n, m, xl, xr, yl, yr, cnt;
vector < vi > a;
bool was[N][N];

bool in (int x, int y) {
	return x >= 0 && y >= 0 && x < n && y < m;                     	
}



void dfs (int x, int y) {
//	cerr << x << ' ' << y << endl;
	was[x][y] = 1;
	++cnt;
	xl = min(xl, x);
	xr = max(xr, x);
	yl = min(yl, y);
	yr = max(yr, y);


	for (int i = 0; i < 4; ++i) {
		int tox = x + dx[i], toy = y + dy[i];
		if (in(tox, toy) && !was[tox][toy] && !a[tox][toy])
			dfs(tox, toy);
	}
}

ll count_rectangles(vector < vi > _a) {
	a = _a;
	n = sz(a), m = sz(a[0]);

	if (n < 3 || m < 3)
		return 0;

	int ans = 0;
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < m; ++j) {
//			cerr << i << ' ' << j << endl;
			if (was[i][j] || a[i][j])
				continue;
			xl = yl = inf;
			xr = yr = 0;
			cnt = 0;
			dfs(i, j);
//			cerr << i << ' ' << j << ' ' << xl << ' ' << xr << ' ' << yl << ' ' << yr << ' ' << cnt << endl;
			if (!xl || !yl || xr == n - 1 || yr == m - 1 || cnt != (xr - xl + 1) * (yr - yl + 1));
			else
				++ans;
		}

	return ans;	
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 0 / 10
• Subtask 6: 13 / 13
• Subtask 7: 0 / 28