| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 202569 | galen_colin | 벽 (IOI14_wall) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
// template<typename A, typename B> ll max(A x, B y) {
// return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
// return x < y ? x : y;
// }
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
void usaco(string filename) {
// #pragma message("be careful, freopen may be wrong")
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
namespace interactor {
}
using namespace interactor;
void buildWall(int n, int q, int op[], int left[], int right[], int height[], int finalHeight[]);
int main() {
// freopen("file.in", "r", stdin);
int n, q;
cin >> n >> q;
int op[q];
int left[q];
int right[q];
int height[q];
int finalHeight[n];
f0r(i, q) cin >> op[i] >> left[i] >> right[i] >> height[i];
f0r(i, n) finalHeight[i] = 0;
buildWall(n, q, op, left, right, height, finalHeight);
// buildWall(3, 3,
// new int[3]{1, 1, 2},
// new int[3]{0, 1, 0},
// new int[3]{1, 2, 1},
// new int[3]{2, 4, 3},
// new int[3]{0, 0, 0});
}
// #include "wall.h"
ll n, m, k, q, Q, T, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;
set<pair<int, pii> > ss;
const int block = 90;
pair<int, pii> st[100005][block], en[100005][block];
int scnt[100005], ecnt[100005];
void buildWall(int n, int q, int op[], int left[], int right[], int height[], int a[]) {
f0r(i, n) a[i] = 0;
ms(scnt, 0);
ms(ecnt, 0);
int mn = 0, mx = 0;
f0r(i, q) {
mn = min(mn, height[i]);
mx = max(mx, height[i]);
}
int stop = 0;
int last = 0;
while (stop < q) {
stop += block;
if (stop > q) stop = q;
f1r(i, last, stop) {
int l = left[i], r = right[i], h = height[i];
st[l][scnt[l]++] = mp(i, mp(op[i], h));
en[r + 1][ecnt[r + 1]++] = mp(i, mp(op[i], h));
}
pii free = mp(mn, mx);
int fin = -1;
f0r(i, n) {
bool changed = 0;
f0r(j, scnt[i]) {
changed = 1;
ss.insert(st[i][j]);
}
f0r(j, ecnt[i]) {
changed = 1;
ss.erase(en[i][j]);
}
if (changed) {
free = mp(mn, mx);
fin = -1;
for (pair<int, pii> x: ss) {
pii v = x.s;
int h = v.s;
if (v.f == 1) {
if (h >= free.s) {
free.f = free.s = h;
fin = h;
} else if (h >= free.f) {
free.f = h;
}
} else {
if (h <= free.f) {
free.f = free.s = h;
fin = h;
} else if (h <= free.s) {
free.s = h;
}
}
}
}
if (fin == -1) {
if (a[i] < free.f) a[i] = free.f;
else if (a[i] > free.s) a[i] = free.s;
} else a[i] = fin;
}
ms(scnt, 0);
ms(ecnt, 0);
ss.clear();
last += block;
if (stop == q) break;
}
ao(a, n);
}
// int main() {
// io;
// // freopen("case", "r", stdin);
// // freopen("test.txt", "r", stdin);
// // freopen("case", "w", stdout);
// // freopen("file.in", "r", stdin);
// // usaco("file");
// }