# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
943737 | Pannda | Fish 2 (JOI22_fish2) | C++17 | 4038 ms | 14424 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
struct Paint {
struct Node {
int mn, cnt;
int lazy = 0;
void add(int delta) {
mn += delta;
lazy += delta;
}
void merge(Node a, Node b) {
mn = min(a.mn, b.mn);
cnt = 0;
if (a.mn == mn) cnt += a.cnt;
if (b.mn == mn) cnt += b.cnt;
}
};
int n;
vector<Node> nodes;
Paint(int n) : n(n), nodes(4 * n) {
auto dfs = [&](auto self, int idx, int l, int r) -> void {
if (l + 1 == r) {
nodes[idx].mn = 0;
nodes[idx].cnt = 1;
} else {
int m = (l + r) >> 1;
self(self, 2 * idx + 1, l, m);
# | 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... |