제출 #293242

#제출 시각아이디문제언어결과실행 시간메모리
293242rqiRectangles (IOI19_rect)C++14
8 / 100
5060 ms28408 KiB
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;

const int MOD = 1000000007;

#define ins insert
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define all(x) begin(x), end(x)

const int mx = 2505;
int n, m;

ll count_rectangles(vector<vi> a){
	n = sz(a);
	m = sz(a[0]);
	ll ans = 0;
	for(int x1 = 1; x1+1 < sz(a); x1++){
		for(int y1 = 1; y1+1 < sz(a[0]); y1++){
			for(int x2 = x1; x2+1 < sz(a); x2++){
				for(int y2 = y1; y2+1 < sz(a[0]); y2++){
					bool works = 1;
					for(int i = x1; i <= x2; i++){
						for(int j = y1; j <= y2; j++){
							if(a[i][j] >= min(a[i][y1-1], min(a[i][y2+1], min(a[x1-1][j], a[x2+1][j])))) works = 0;
						}
					}
					if(works) ans++;
				}
			}
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...