| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 889095 |
2023-12-18T20:21:02 Z |
aykhn |
Wall (IOI14_wall) |
C++17 |
|
1 ms |
2396 KB |
#include "wall.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 2e6 + 5;
pp(ll, ll) lazy[N << 2], ans[N];
void push(ll v)
{
if (lazy[v] == mpr(0ll, (ll)1e9))
return;
if (lazy[v].F > lazy[v << 1].S)
lazy[v << 1] = {lazy[v].F, lazy[v].F};
elif (lazy[v].S < lazy[v << 1].F)
lazy[v << 1] = {lazy[v].S, lazy[v].S};
else
lazy[v << 1].F = max(lazy[v].F, lazy[v << 1].F), lazy[v << 1].S = min(lazy[v << 1].S, lazy[v].S);
if (lazy[v].F > lazy[v << 1 | 1].S)
lazy[v << 1 | 1] = {lazy[v].F, lazy[v].F};
elif (lazy[v].S < lazy[v << 1 | 1].F)
lazy[v << 1 | 1] = {lazy[v].S, lazy[v].S};
else
lazy[v << 1 | 1].F = max(lazy[v].F, lazy[v << 1 | 1].F), lazy[v << 1 | 1].S = min(lazy[v << 1 | 1].S, lazy[v].S);
lazy[v] = {0ll, (ll)1e9};
}
void modifymin(ll i, ll j, ll val, ll l, ll r, ll v)
{push(v);
if (max(i, l) > min(j, r))
return;
if (i <= l and r <= j)
{
// lazy[v].S = min(lazy[v].S, val);
// if (lazy[v].F > lazy[v].S)
// lazy[v].F = lazy[v].S;
lazy[v] = {(ll)0, val};
push(v);
return;
}
ll mid = (l + r) >> 1;
modifymin(i, j, val, l, mid, v << 1);
modifymin(i, j, val, mid + 1, r, v << 1 | 1);
}
void modifymax(ll i, ll j, ll val, ll l, ll r, ll v)
{push(v);
if (max(i, l) > min(j, r))
return;
if (i <= l and r <= j)
{
// lazy[v].F = max(lazy[v].F, val);
// if (lazy[v].F > lazy[v].S)
// lazy[v].S = lazy[v].F;
lazy[v] = {val, (ll)1e9};
push(v);
return;
}
ll mid = (l + r) >> 1;
modifymax(i, j, val, l, mid, v << 1);
modifymax(i, j, val, mid + 1, r, v << 1 | 1);
}
void build(ll l, ll r, ll v)
{
if (l == r)
{
ans[l] = lazy[v];
return;
}
ll mid = (l + r) >> 1;
push(v);
build(l, mid, v << 1);
build(mid + 1, r, v << 1 | 1);
}
void init(ll l, ll r, ll v)
{
if (l == r)
{
lazy[l] = {0, 0};
return;
}
ll mid = (l + r) >> 1;
build(l, mid, v << 1);
build(mid + 1, r, v << 1 | 1);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
for (ll i = 0; i <= (n << 2); i++)
lazy[i] = mpr(0, 1e9);
init(0, n - 1, 1);
for (ll i = 0; i < k; i++)
if (op[i] == 1)
modifymax(left[i], right[i], height[i], 0, n - 1, 1);
else
modifymin(left[i], right[i], height[i], 0, n - 1, 1);
build(0, n - 1, 1);
for (ll i = 0; i < n; i++)
finalHeight[i] = ans[i].F;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2396 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
2396 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
