| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 489617 | ssense | 벽 (IOI14_wall) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "wall.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
//#define int long long
//#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//ssense
class SegmentTree{
public:
//DEFINITIONS
int N, sz, lim;
vector<pair<int, int>> lazy;
//BUILDING
SegmentTree(int n)
{
N = n;
sz = 4*N;
lazy.assign(4*N+1, {MXL, 0});
}
vint get(int k)
{
for(int i = 1; i <= N+k; i++)
{
push(i);
}
vint ans;
for(int i = k+1; i < N+k+1; i++)
{
ans.pb(min(lazy[i].fr, lazy[i].sc));
}
return ans;
}
void push(int v)
{
lazy[2*v].fr = min(lazy[2*v].fr, lazy[v].fr);
lazy[2*v].fr = max(lazy[2*v].fr, lazy[v].sc);
lazy[2*v].sc = max(lazy[2*v].sc, lazy[v].sc);
lazy[2*v].sc = min(lazy[2*v].sc, lazy[v].fr);
lazy[2*v+1].fr = min(lazy[2*v+1].fr, lazy[v].fr);
lazy[2*v+1].fr = max(lazy[2*v+1].fr, lazy[v].sc);
lazy[2*v+1].sc = max(lazy[2*v+1].sc, lazy[v].sc);
lazy[2*v+1].sc = min(lazy[2*v+1].sc, lazy[v].fr);
}
void update1(int v, int tl, int tr, int l, int r, int addend)
{
if (l > r){return;}
if (l == tl && tr == r)
{
lazy[v].fr = max(lazy[v].fr, addend);
lazy[v].sc = max(lazy[v].sc, addend);
return;
}
else
{
push(v);
lazy[v].fr = MX;
lazy[v].sc = 0;
int tm = (tl + tr) / 2;
update1(v*2, tl, tm, l, min(r, tm), addend);
update1(v*2+1, tm+1, tr, max(l, tm+1), r, addend);
}
}
void update2(int v, int tl, int tr, int l, int r, int addend)
{
if (l > r){return;}
if (l == tl && tr == r)
{
lazy[v].fr = min(lazy[v].fr, addend);
lazy[v].sc = min(lazy[v].sc, addend);
return;
}
else
{
push(v);
lazy[v].fr = MX;
lazy[v].sc = 0;
int tm = (tl + tr) / 2;
update2(v*2, tl, tm, l, min(r, tm), addend);
update2(v*2+1, tm+1, tr, max(l, tm+1), r, addend);
}
}
};
vector<int> buildWall(int n, int k, int type[], int l[], int r[], int h[])
{
SegmentTree st(n);
int kk = 1;
while(kk < n)
{
kk*=2;
}
for(int i = 0; i < k; i++)
{
if(type[i] == 1)
{
st.update1(1, 1, kk, l[i]+1, r[i]+1, h[i]);
}
else
{
st.update2(1, 1, kk, l[i]+1, r[i]+1, h[i]);
}
}
kk--;
vint ans = st.get(kk);
return ans;
}
/*
int32_t main(){
startt
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
*/
/*
7 3
4 1 3 4 0 2 3
10 6
1 1 8 4
2 4 9 1
2 3 6 5
1 0 5 3
1 2 2 5
2 6 7 0
10 1
1 1 8 4
*/