| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 465043 | nkato | Wall (IOI14_wall) | C++17 | 0 ms | 0 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;
/////////////////////// MACROS ////////////////////////////////////////////
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcTU> using PR = pair<T,U>;
tcTU> using omap = unordered_map<T, U>;
tcT> using oset = unordered_set<T>;
tcT> using mset = multiset<T>;
#define mp make_pair
#define fi first
#define se second
#define sz(x) int((x).size())
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define ppb pop_back()
#define ppf pop_front()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
// LOOPS
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_, a)
#define each(a,x) for (auto& a: x)
/////////////////////// IMPORANT VARS /////////////////////////////////////
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INFL = 1e18+10;
const int INF = 1e9+10;
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
tcT> using pql = priority_queue<T,vector<T>,less<T>>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define nl '\n'
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// tcT> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// #define ook order_of_key
// #define fbo find_by_order
// struct chash {
// const uint64_t C = ll(2e18*PI)+71;
// const int RANDOM = rng();
// ll operator()(ll x) const {
// return __builtin_bswap64((x^RANDOM)*C); }
// };
// template<class K,class V> using um = unordered_map<K,V,chash>;
// template<class K,class V> using ht = gp_hash_table<K,V,chash>;
// template<class K,class V> V get(ht<K,V>& u, K x) {
// auto it = u.find(x); return it == end(u) ? 0 : it->s; }
tcT> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
tcT> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
/////////////////////// TO_STRING /////////////////////////////////////////
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
return b ? "true" : "false";
#else
return ts((int)b);
#endif
}
tcTU> str ts(pair<T,U> p) {
#ifdef LOCAL
return "("+ts(p.fi)+", "+ts(p.se)+")";
#else
return ts(p.fi)+" "+ts(p.se);
#endif
}
tcTU> str ts(V<pair<T, U>> v) {
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
tcT> str ts(T v) {
#ifdef LOCAL
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
#else
bool fst = 1; str res = "";
for (const auto& x: v) {
if (!fst) res += " ";
fst = 0; res += ts(x);
}
return res;
#endif
}
///////////////////////// DEBUG ///////////////////////////////////////////
#define tcTUU tcT, class ...U
void DBG() { cerr << "]" << endl; }
tcTUU> void DBG(const T& t, const U&... u) {
cerr << ts(t); if (sizeof...(u)) cerr << ", ";
DBG(u...); }
#ifdef LOCAL
#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
<< __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
#define dbg(...) 0
#define chk(...) 0
#endif
///////////////////////// FILE I/O ////////////////////////////////////////
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setPrec() { cout << fixed << setprecision(15); }
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void setIO(str s = "") {
unsyncIO(); setPrec();
#ifndef LOCAL
if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for USACO
#endif
}
///////////////////////// TEMPLATE ABOVE //////////////////////////////////
// REMEMBER
// - Don't focus on only one approach
// - Read Problem Fully
// - Think of Edges Cases
// - Implement carefully
const int nax = 1e5+10;
struct T {
int l, r;
};
struct LazySeg {
const T ID = {0, nax}; const pi IDL = {-1, 0};
V<T> seg; vpi lazy; int n, N;
void init(int _n) { n = 1; while(n < _n) n *= 2; N = _n; seg.assign(2*n, ID), lazy.assign(2*n, IDL); }
void updx(int x, pi v) {
if (v.fi == 1) {
ckmax(seg[x].l, v.se);
} else {
ckmin(seg[x].r, v.se);
}
if (seg[x].l > seg[x].r) {
seg[x].l = seg[x].r = v.se;
}
}
void push(int x) {
if (lazy[x].fi == -1) return;
F0R(i, 2) updx(2*x+i, lazy[x]);
lazy[x] = IDL;
}
void upd(int lo, int hi, pi v, int x,int L, int R) {
push(x); if (hi < L || R < lo) return;
if (lo <= L && R <= hi) {
lazy[x] = v; push(x); return; }
int M = (L+R)/2;
upd(lo, hi, v, 2*x+0, L, M);
upd(lo, hi, v, 2*x+1, M+1, R);
}
T get(int i, int x, int L, int R) {
push(x);
if (L == R) {
return seg[x];
}
int m = (L+R)/2;
if (i <= m) return get(i, 2*x+0, L, m);
else return get(i, 2*x+1, m+1, R);
}
void upd(int lo, int hi, pi v) { upd(lo, hi, v, 1, 0, n-1); }
T get(int i) { return get(i, 1, 0, n-1); };
void solve(int* finalHeight) {
F0R(i, N) finalHeight[i] = get(i).l;
}
} st;
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
st.init(n);
F0R(i, k) {
st.upd(left[i], right[i], mp(op[i], height[i]));
}
st.solve(finalHeight);
}
int main() {
return 0;
}