# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654850 | benjaminkleyn | Wall (IOI14_wall) | C++17 | 615 ms | 69680 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.
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include "wall.h"
using namespace std;
typedef long long ll;
int m[8000000], M[8000000];
void push(int v, int tl, int tr)
{
if (tl == tr) return;
m[v*2] = min(m[v*2], m[v]);
m[v*2] = max(m[v*2], M[v]);
M[v*2] = min(M[v*2], m[v]);
M[v*2] = max(M[v*2], M[v]);
m[v*2+1] = min(m[v*2+1], m[v]);
m[v*2+1] = max(m[v*2+1], M[v]);
M[v*2+1] = min(M[v*2+1], m[v]);
M[v*2+1] = max(M[v*2+1], M[v]);
}
void update(int v, int tl, int tr, int l, int r, int val, int op)
{
push(v, tl, tr);
if (r < tl || tr < l) return;
# | 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... |