제출 #415323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
415323		peuch	Rectangles (IOI19_rect)	C++17	0 / 100	35 ms	12876 KiB

rect

#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
 
const int MAXN = 710;
 
bitset<MAXN> lVal[MAXN][MAXN];
bitset<MAXN> cVal[MAXN][MAXN];
 
long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = a.size();
	int m = a[0].size();
	
	for(int i = 1; i < n - 1; i++){
		for(int j = 1; j < m - 1; j++){
			int maxi = 0;
			for(int k = j; k < m - 1; k++){
				maxi = max(maxi, a[i][k]);
				lVal[i][j][k] = maxi < a[i][j - 1] && maxi < a[i][k + 1];
			}
		}
	}
	for(int i = 1; i < m - 1; i++){
		for(int j = 1; j < n - 1; j++){
			int maxi = 0;
			for(int k = j; k < n - 1; k++){
				maxi = max(maxi, a[k][i]);
				cVal[i][j][k] = maxi < a[j - 1][i] && maxi < a[k + 1][i];
			}
		}
	}
	
	long long ans = 0;
	
	for(int i = 1; i < n - 1; i++){
		for(int j = 1; j < m - 1; j++){
			vector<int> marc (m, true);
			for(int k = i; k < n - 1; k++){
				bool flag = true;
				for(int l = j; l < m - 1; l++){
					marc[l] &= lVal[k][j][l];
					if(marc[l] == 0) continue;
					if(cVal[l][i][k] == 0) flag = false;
					if(!flag) continue;
					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: 0 / 13
• Subtask 7: 0 / 28