| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1368939 | vidux | Rectangles (IOI19_rect) | C++17 | 4 ms | 500 KiB |
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long count_rectangles(std::vector<std::vector<int> > a) {
int n = (int)a.size();
if (n < 3) return 0;
int m = (int)a[0].size();
vector<int> ok(m), b = a[1];
for (int i = 1; i < m-1; i++) ok[i] = (a[0][i] > a[1][i] && a[1][i] < a[2][i]);
ll ans = 0;
for (int l = 1; l < m-1; l++) {
int mn = b[l];
for (int r = l; r < m-1; r++) {
if (!ok[r]) break;
mn = min(mn, b[r]);
if (b[l-1] > mn && mn < b[r+1]) ans++;
}
}
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
