# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637919 | Cross_Ratio | Sterilizing Spray (JOI15_sterilizing) | C++14 | 799 ms | 13496 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;
typedef long long ll;
struct Node {
ll sum;
ll mi, ma;
ll n, p;
Node() {
sum = mi = ma = 0;
n = -1, p = 0;
}
Node(ll v) {
sum = mi = ma = v;
n = -1, p = 0;
}
};
struct SegTree {
vector<Node> seg;
int MAX;
SegTree(int N) {
int i;
for(i=1;i<2*N;i*=2) {}
seg.resize(i);
MAX = i;
}
Node f(Node x, Node y) {
Node c;
c.sum = x.sum + y.sum;
c.ma = max(x.ma, y.ma);
c.mi = min(x.mi, y.mi);
Compilation message (stderr)
# | 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... |