結果
問題 | No.318 学学学学学 |
ユーザー |
![]() |
提出日時 | 2020-01-28 01:27:55 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 271 ms / 2,000 ms |
コード長 | 6,940 bytes |
コンパイル時間 | 2,605 ms |
コンパイル使用メモリ | 193,300 KB |
実行使用メモリ | 18,820 KB |
最終ジャッジ日時 | 2024-09-14 17:54:44 |
合計ジャッジ時間 | 8,140 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include "bits/stdc++.h"using namespace std;#define Rep(i,n) for(int i=0;i<(int)(n);i++)#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)#define REP(i,n) for(ll i=0;i<(ll)(n);i++)#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)#define all(a) (a).begin(),(a).end()#define SORT(a) sort((a).begin(),(a).end())#define oorret 0#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()#define IOS cin.tie(0),ios::sync_with_stdio(false)typedef long long ll;typedef unsigned long long ull;typedef std::pair<ll, ll> P;template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }template<class Type>struct is_vector : std::false_type {};template<class ValueType, class Alloc>struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};template <typename T> inline std::ostream& operator << (std::ostream& out, const std::vector<T>& v) {if (v.empty())return out;constexpr bool is_vector_v = is_vector<T>::value;if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : "");else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : "");return out;}inline void put() {}template<class T> inline void put(const T& first) { std::cout << first << "\n"; }template<class T, class... N> inline void put(const T& first, const N& ... rest) { std::cout << first << " "; put(rest...); }inline void putn() {}template<class T, class... N> inline void putn(const T& first, const N& ... rest) { std::cout << first << "\n"; putn(rest...); }template<typename T>class LazySegmentTree{public:int sz = 1;int contFlag;T elemUp; // upの単位元T elemPr; // procの単位元vector<T> seg; // セグメント木のデータ配列vector<T> lazy; // 遅延評価用の配列T up(T& a,T b){ // 更新関数if(b==elemUp)return a;if(a==elemUp)return b;//return a+b; // 加算return b; // 代入}T proc(T& a,T b){ // 評価関数if(b==elemPr)return a;if(a==elemPr)return b;//if(a>b)return a;// max//return b;//if(a<b)return a;// min//return b;return a+b; // 加算}T cont(T& a,int b){ // aをb回procした値if(b<=0)return elemPr;if(b%2==0){T c = cont(a,b/2);return proc(c,c);}else{return proc(a,cont(a,b-1));}return a;}T contSum(T& a,int b){ // procが加算のときreturn a*b;}T contId(T& a,int b){ // procが繰り返しても同じ値になるもの(max,min,etc...)return a;}LazySegmentTree(int n,T ep=0,T eu=0,int cf=0):elemPr(ep),elemUp(eu),contFlag(cf){while (sz < n) sz <<= 1;seg.clear();lazy.clear();seg.resize(sz * 2, elemPr);lazy.resize(sz * 2, elemUp);}void init(std::vector<T> ary){ // aryで初期化するconst int n = (int)ary.size();for(int i=0;i<n;++i){set(i,ary[i]);}for(int i=sz-2;i>=0;--i){seg[i] = proc(seg[2*i+1], seg[2*i+2]);}}void init(T a){ // sz個の全要素をaで初期化するfor(int i=0;i<sz;++i){set(i,a);}for(int i=sz-2;i>=0;--i){seg[i] = proc(seg[2*i+1], seg[2*i+2]);}}inline void set(const int& k, const T& x) {// 左からk番目の葉にxを代入するseg[sz - 1 + k] = x;}// k 番目のノードについて遅延評価を行うvoid eval(int k, int l, int r) { // k = [l,r)if(lazy[k] != elemUp) {int len = r-l;if(len > 1){lazy[2*k+1] = up(lazy[2*k+1],lazy[k]);lazy[2*k+2] = up(lazy[2*k+2],lazy[k]);}if(contFlag==0){seg[k] = up(seg[k],cont(lazy[k],len));}else if(contFlag==1){seg[k] = up(seg[k],contSum(lazy[k],len));}else if(contFlag==2){seg[k] = up(seg[k],contId(lazy[k],len));}lazy[k] = elemUp;}}void update(int a,int b,T x,int k=0,int l=0,int r=-1){ // i in [a,b)に更新up(seg[i],a)を適用if(r < 0) r = sz;eval(k, l, r);if(b <= l || r <= a) return;if(a <= l && r <= b){// 被覆lazy[k] = up(lazy[k],x);eval(k, l, r);}else{// 非被覆update(a, b, x, 2*k+1, l, (l+r)/2);update(a, b, x, 2*k+2, (l+r)/2, r);seg[k] = proc(seg[2*k+1], seg[2*k+2]);}}T query(int a, int b, int k=0, int l=0, int r=-1) {if(r < 0) r = sz;if(b <= l || r <= a) return elemPr;eval(k, l, r);if(a <= l && r <= b) return seg[k];T vl = query(a, b, 2*k+1, l, (l+r)/2);T vr = query(a, b, 2*k+2, (l+r)/2, r);return proc(vl, vr);}};template<typename T>vector<int> Coordinate_compression(vector<T>& a){int n = a.size();map<T,int> mp;Rep(i,n){mp[a[i]] = 0;}int cnt = 0;for(auto v:mp){mp[v.first] = cnt++;}vector<int> res(n);REP(i,n){res[i] = mp[a[i]];}return res;}template <typename T>vector<pair<int, T>> rle(vector<T> a){int n = (int)a.size();vector<pair<int, T>> res;if (n == 0){return res;}T now = a[0];int con = 0;for (int i = 0; i < n; ++i){if (a[i] == now){con++;}else{res.push_back(pair<int, T>(con, now));now = a[i];con = 1;}}res.push_back(pair<int, T>(con, now));return res;}int main(){int n;cin >> n;vector<ll> a(n),c(n);REP(i,n){cin >> a[i];c[i] = a[i];}sort(all(c));auto rl = rle(c);LazySegmentTree<ll> lst(n,0,INT_MAX,1);lst.init(a);auto cc = Coordinate_compression(a);map<ll,int> mp;Rep(i,n){mp[a[i]] = 0;}int cnt = 0;for(auto v:mp){mp[v.first] = cnt++;}vector<P> p(n,P(n+1,-1));REP(i,n){chmin(p[cc[i]].first,i);chmax(p[cc[i]].second,i);}REP(i,n){if(p[i].first!=n+1&&p[i].second!=-1){int s = p[i].first;int t = p[i].second+1;lst.update(s,t,rl[i].second);}}REP(i,n){cout << lst.query(i,i+1) << " ";}cout << "\n";return 0;}