結果

問題 No.318 学学学学学
ユーザー Yang33
提出日時 2018-10-01 17:43:48
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 203 ms / 2,000 ms
コード長 3,494 bytes
コンパイル時間 1,685 ms
コンパイル使用メモリ 186,632 KB
実行使用メモリ 19,132 KB
最終ジャッジ日時 2024-06-22 18:43:56
合計ジャッジ時間 5,383 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9; const LL LINF = 1e16;
const LL MOD = 1000000007; const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* ----- 2018/10/01 Problem: yukicoder 318 / Link: http://yukicoder.me/problems/no/318 ----- */
/* ------------
---------- */
/* ----------
-------- */
struct Node {
Node() :val(0) {} // e
Node(long long x) :val(x) {}
long long val;
};
struct Lazy {
Lazy() :set(0), lazyval(0) {}
bool set;
long long lazyval;
};
long long out_range =0;
typedef long long ll;
struct LazySegTreeP {
long long N;
vector<Node> dat;
vector<Lazy> lazy;
inline Node merge(Node& a, Node& b) {
Node node;
node.val = max(a.val, b.val);
return node;
}
void lazy_push(ll k, ll queryL, ll queryR) {
if (lazy[k].set == 0)return;
dat[k].val = lazy[k].lazyval;
if (k < N - 1) {
lazy_set(2 * k + 1, lazy[k].lazyval);
lazy_set(2 * k + 2, lazy[k].lazyval);
}
lazy[k].lazyval = 0;
lazy[k].set = 0;
}
inline void lazy_set(ll k, ll val) {
lazy[k].set = 1;
lazy[k].lazyval = val;
}
inline void fix(ll k) {
dat[k] = merge(dat[k * 2 + 1], dat[k * 2 + 2]);
}
LazySegTreeP(int _N) {
N = 1;
while (N < _N)N *= 2;
dat = vector<Node>(N * 2 - 1);
lazy = vector<Lazy>(N * 2 - 1);
}
inline void lazy_update(ll queryL, ll queryR, ll val, ll k = 0, ll nodeL = 0, ll nodeR = -1) {
if (nodeR == -1)nodeR = N;
lazy_push(k, nodeL, nodeR);
if (nodeR <= queryL || queryR <= nodeL) { return; }
if (queryL <= nodeL && nodeR <= queryR) {
lazy_set(k, val);
lazy_push(k, nodeL, nodeR);
return;
}
ll nodeM = (nodeL + nodeR) / 2;
lazy_update(queryL, queryR, val, k * 2 + 1, nodeL, nodeM);
lazy_update(queryL, queryR, val, k * 2 + 2, nodeM, nodeR);
fix(k);
return;
}
Node query(ll queryL, ll queryR, ll k, ll nodeL, ll nodeR) {
lazy_push(k, nodeL, nodeR);
if (nodeR <= queryL || queryR <= nodeL) { return Node(out_range); }
if (queryL <= nodeL && nodeR <= queryR) { return dat[k]; }
ll nodeM = (nodeL + nodeR) / 2;
Node vl = query(queryL, queryR, k * 2 + 1, nodeL, nodeM);
Node vr = query(queryL, queryR, k * 2 + 2, nodeM, nodeR);
return merge(vr, vl);
}
inline Node query(int a, int b) {
return query(a, b, 0, 0, N);
}
};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
LL N; cin >> N;
map<int, int>L, R;
VI a(N);
FOR(i, 0, N) {
cin >> a[i];
if (L.find(a[i]) == L.end())
L[a[i]] = 1e9+10;
L[a[i]] = min(L[a[i]], i);
R[a[i]] = max(R[a[i]], i);
}
SORT(a);
UNIQ(a);
LazySegTreeP seg(N);
FOR(i, 0, SZ(a)) {
seg.lazy_update(L[a[i]], R[a[i]] + 1, a[i]);
}
FOR(i, 0, N) {
cout << seg.query(i, i + 1).val << " \n"[i == N - 1];
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0