# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291136 | ivan24 | Wall (IOI14_wall) | C++14 | 1452 ms | 132672 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 "wall.h"
#include <bits/stdc++.h>
using namespace std;
using ll = int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second
const ll INF = 1e9;
class SegmentTree {
private:
vi st, data;
vii lzy;
ll n;
ll left(ll x){ return (x << 1); }
ll right(ll x) { return ((x << 1) + 1); }
ii cmbNodes(ii lhs, ii rhs){
ii ans = ii(max(lhs.F,rhs.F),min(lhs.S,rhs.S));
if (ans.F <= ans.S) return ans;
if (lhs.S < rhs.F) ans.F = lhs.S;
else ans.S = lhs.F;
return ans;
}
void rangeUpdate (ll i, ll l, ll r, ll ul, ll ur, ii newNode){
# | 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... |