# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1159795 | gohchingjayk | 3D Histogram (COCI20_histogram) | C++20 | 2594 ms | 3396 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
constexpr int INF = 1ull << 60;
int widths[200000 + 5], heights[200000 + 5];
/*
struct Node {
Node *left = nullptr, *right = nullptr;
int l, r, m;
int width, height;
Node(int a, int b) {
l = a, r = b, m = (l + r) >> 1;
if (l == r) {
width = widths[l];
height = heights[l];
}
else {
left = new Node(l, m);
right = new Node(m + 1, r);
width = min(left->width, right->width);
height = min(left->height, right->height);
}
}
pair<int, int> rmq(int a, int b) {
if (a <= l && r <= b) return pair{width, height};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |