제출 #603360

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
603360		SeDunion	Rectangles (IOI19_rect)	C++17	8 / 100	5059 ms	25952 KiB

rect

#include "rect.h"
#include<iostream>
#include<vector>

using namespace std;
using ll = long long;

ll count_rectangles(vector<vector<int>>a) {
	int n = a.size(), m = a[0].size();
	ll ans = 0;
	for (int r1 = 1 ; r1 < n - 1 ; ++ r1) {
		for (int r2 = r1 ; r2 < n - 1 ; ++ r2) {
			for (int c1 = 1 ; c1 < m - 1 ; ++ c1) {
				for (int c2 = c1 ; c2 < m - 1 ; ++ c2) {
					bool ok = true;
					for (int i = r1 ; i <= r2 ; ++ i) {
						for (int j = c1 ; j <= c2 ; ++ j) {
							ok &= a[i][j] < a[i][c1 - 1] && a[i][j] < a[i][c2 + 1];
							ok &= a[i][j] < a[r1 - 1][j] && a[i][j] < a[r2 + 1][j];
						}
					}
					ans += ok;
				}
			}
		}
	}
	return ans;
}

• Subtask 1: 8 / 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