Submission #1019346

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019346		mindiyak	Rectangles (IOI19_rect)	C++14	0 / 100	5038 ms	343532 KiB

rect

#include "rect.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

int N,M;
vvi arr;
ll ans = 0;

void dfs(int a,int b){
	if(arr[a][b] == 1)return;

	queue<pi> pq;
	pq.push({a,b});
	vpi nodes;
	vi r(N,0),c(M,0);
	set<pi> visited;
	bool can = true;
	int row = 0,column = 0,rowc = 0,colc = 0;

	// cout << a << " " << b << endl;

	while(!pq.empty()){
		pi node = pq.front();pq.pop();
		if(visited.count(node))continue;

		if(node.F == 0 && arr[node.F][node.S] == 0)can = false;
		if(node.S == 0 && arr[node.F][node.S] == 0)can = false;
		if(node.F == (N-1) && arr[node.F][node.S] == 0)can = false;
		if(node.S == (M-1) && arr[node.F][node.S] == 0)can = false;

		if(node.F > 0 && node.F < (N-1) && node.S > 0 && node.S < (M-1) && arr[node.F][node.S] == 0){
			visited.insert(node);
			nodes.pb(node);
			r[node.F] += 1;
			c[node.S] += 1;
			pq.push({node.F-1,node.S});
			pq.push({node.F+1,node.S});
			pq.push({node.F,node.S-1});
			pq.push({node.F,node.S+1});
		}
	}

	FOR(i,0,N){
		if(r[i] == 0)continue;
		if(row!=0 && row!=r[i]){
			can = false;
			break;
		}
		row = r[i];
		rowc++;
	}
	FOR(i,0,M){
		if(can == false)break;
		if(c[i] == 0)continue;
		if(column!=0 && column!=c[i]){
			can = false;
			break;
		}
		column = c[i];
		colc++;
	}

	// for(int i:r)cout << i << " ";
	// cout << " - " << row << " - " << rowc << endl;
	// for(int i:c)cout << i << " ";
	// cout << " - " << column << " - " << colc << endl;
	// cout << can << endl;

	if(can){
		ans += 1;
	}

	for(auto node:nodes)arr[node.F][node.S] = 1;

	// for(auto as:arr){
	// 	for(auto aas:as){{
	// 		cout << aas << " ";
	// 	}}cout << endl;
	// }
	// cout << endl;
}

ll count_rectangles(vvi a) {
	N = a.size();M = a[0].size();
	// cout << endl;
	arr = a;
	FOR(i,1,N-1){
		FOR(j,1,M-1){
			dfs(i,j);
		}
	}
	return ans;
}

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