제출 #1019232

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019232		mindiyak	Rectangles (IOI19_rect)	C++17	18 / 100	5072 ms	520816 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;
set<pair<pi,pi>> visited;

void dfs(int a,int b,int c,int d,int wa,int wb,int wc,int wd){
	if(c<a)swap(a,c);
	if(d<b)swap(b,d);
	if(visited.count({{a,b},{c,d}}))return;
	if(a == 0 || b == 0 || c == (N-1) || d == (M-1))return;
	visited.insert({{a,b},{c,d}});
	bool bad = false;
	FOR(i,min(a,wa),max(wc,c)+1){
		FOR(j,min(b,wb),max(wd,d)+1){
			// if(arr[i][j] >= arr[b-1][j])return;
			// if(arr[i][j] >= arr[d+1][j])return;
			// if(arr[i][j] >= arr[i][a-1])return;
			// if(arr[i][j] >= arr[i][c+1])return;
			if(arr[i][j] >= arr[i][b-1])bad = true;
			if(arr[i][j] >= arr[i][d+1])bad = true;
			if(arr[i][j] >= arr[a-1][j])bad = true;
			if(arr[i][j] >= arr[c+1][j])bad = true;
			if(bad)break;
		}
	}
	// cout << a << " " << b << " " << c << " " << d  << " " << bad << endl;

	if(!bad)ans ++;
	if(!bad){wa=a;wb=b;wc=c;wd=d;}
	dfs(a-1,b,c,d,wa,wb,wc,wd);
	dfs(a,b-1,c,d,wa,wb,wc,wd);
	dfs(a,b,c+1,d,wa,wb,wc,wd);
	dfs(a,b,c,d+1,wa,wb,wc,wd);
}

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

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