# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997780 | coolboy19521 | Wall (IOI14_wall) | C++17 | 638 ms | 244052 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"
#include "wall.h"
using namespace std;
const int sz = 5e6;
struct que {
int ad, rm;
que() : ad(INT_MIN), rm(INT_MAX) {}
que(int le, int ri) : ad(le), rm(ri) {}
};
int st[sz * 4];
que lz[sz * 4];
void merge(que& le, que& ri) {
// le.ad = max(le.ad, ri.ad);
// le.rm = min(le.rm, ri.rm);
// le.ad = min(le.ad, le.rm);
le.rm = min(le.rm, ri.rm);
// le.rm = max(le.rm, ri.ad);
le.ad = max(le.ad, ri.ad);
le.ad = min(le.ad, ri.rm);
}
void relax(int v, int le, int ri) {
if (lz[v].ad != INT_MIN || lz[v].rm != INT_MAX) {
if (lz[v].ad != INT_MIN) {
st[v] = max(st[v], lz[v].ad);
# | 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... |