# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933496 | ksujay2 | Fish 2 (JOI22_fish2) | C++17 | 1544 ms | 15192 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;
using ll = long long;
const int MXN = 1e5 + 1;
const ll INF = 1e18;
// count min segtree
const int SEGTSZ = 2 << 17;
struct D {
int cnt, mn, lz;
} segt[SEGTSZ];
void pull(int s) {
segt[s].mn = min(segt[2 * s].mn, segt[2 * s + 1].mn);
segt[s].cnt = (segt[2 * s].mn == segt[s].mn ? segt[2 * s].cnt : 0) + (segt[2 * s + 1].mn == segt[s].mn ? segt[2 * s + 1].cnt : 0);
segt[s].mn += segt[s].lz;
}
void build(int s, int lb, int rb) {
if(lb == rb) {
segt[s].cnt = 1;
return;
}
int m = (lb + rb) / 2;
build(2 * s, lb, m);
build(2 * s + 1, m + 1, rb);
pull(s);
}
# | 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... |