제출 #348001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348001		tengiz05	Rectangles (IOI19_rect)	C++17	37 / 100	5090 ms	39660 KiB

rect

#include "rect.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> a;
bool check(int r1, int c1, int r2, int c2){
	for(int i=r1;i<=r2;i++){
		for(int j=c1;j<=c2;j++){
			int t = min(min(a[i][c1-1], a[i][c2+1]), min(a[r1-1][j], a[r2+1][j]));
			if(a[i][j] >= t)return false;
		}
	}return true;
}

void print(int r1, int c1, int r2, int c2){
	for(int i=r1;i<=r2;i++){
		for(int j=c1;j<=c2;j++){
			cout << a[i][j] << ' ';
		}cout << '\n';
	}cout << '\n';
}

long long count_rectangles(vector<vector<int>> a){
	::a = a;
	n = a.size();
	m = a[0].size();
	int ans = 0;
	for(int i=1;i<n-1;i++){
		for(int j=1;j<m-1;j++){
			for(int I=i;I<n-1;I++){
				for(int J=j;J<m-1;J++){
					//~ if(check(i,j,I,J)){
						//~ cout << i << ' ' << j << "; " << I << ' ' << J << '\n';
						//~ print(i,j,I,J);
					//~ }
					ans += check(i,j,I,J);
				}
			}
		}
	}return ans;
}

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