| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1134094 | alterio | Rectangles (IOI19_rect) | C++20 | 5094 ms | 34116 KiB |
#include <bits/stdc++.h>
#include "rect.h"
using namespace std;
#define ll long long
ll ans = 0;
vector<vector<int>> a;
void check(int x1, int y1, int x2, int y2) {
for (int i = x1; i <= x2; i++) {
for (int j = y1; j <= y2; j++) {
if ((a[i][j] >= a[i][y1 - 1]) || (a[i][j] >= a[i][y2 + 1]) || (a[i][j] >= a[x1 - 1][j]) || (a[i][j] >= a[x2 + 1][j])) return;
}
}
ans++;
}
ll count_rectangles(vector<vector<int>> _a) {
a = _a;
int n = a.size(), m = a[0].size();
for (int i = 1; i < n - 1; i++) {
for (int j = 1; j < m - 1; j++) {
for (int l = i; l < n - 1; l++) {
for (int w = j; w < m - 1; w++) {
check(i, j, l, w);
}
}
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
