結果
| 問題 | No.318 学学学学学 |
| ユーザー |
 smiken_61
|
| 提出日時 | 2018-12-23 19:54:59 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 173 ms / 2,000 ms |
| コード長 | 13,688 bytes |
| コンパイル時間 | 2,354 ms |
| コンパイル使用メモリ | 178,432 KB |
| 実行使用メモリ | 20,708 KB |
| 最終ジャッジ日時 | 2024-06-22 18:46:04 |
| 合計ジャッジ時間 | 5,127 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
#include <bits/stdc++.h>// #include <boost/multiprecision/cpp_int.hpp>#define int long long#define inf 1000000007#define pa pair<int,int>#define ll long long#define pal pair<double,double>#define ppap pair<pa,int>#define PI 3.14159265358979323846#define paa pair<int,char>#define mp make_pair#define pb push_back#define EPS (1e-10)int dx[8]={0,1,0,-1,1,1,-1,-1};int dy[8]={1,0,-1,0,-1,1,1,-1};using namespace std;class pa3{public:int x,y,z;pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}bool operator < (const pa3 &p) const{if(x!=p.x) return x<p.x;if(y!=p.y) return y<p.y;return z<p.z;//return x != p.x ? x<p.x: y<p.y;}bool operator > (const pa3 &p) const{if(x!=p.x) return x>p.x;if(y!=p.y) return y>p.y;return z>p.z;//return x != p.x ? x<p.x: y<p.y;}bool operator == (const pa3 &p) const{return x==p.x && y==p.y && z==p.z;}bool operator != (const pa3 &p) const{return !( x==p.x && y==p.y && z==p.z);}};class pa4{public:int x;int y,z,w;pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}bool operator < (const pa4 &p) const{if(x!=p.x) return x<p.x;if(y!=p.y) return y<p.y;if(z!=p.z)return z<p.z;return w<p.w;//return x != p.x ? x<p.x: y<p.y;}bool operator > (const pa4 &p) const{if(x!=p.x) return x>p.x;if(y!=p.y) return y>p.y;if(z!=p.z)return z>p.z;return w>p.w;//return x != p.x ? x<p.x: y<p.y;}bool operator == (const pa4 &p) const{return x==p.x && y==p.y && z==p.z &&w==p.w;}};class pa2{public:int x,y;pa2(int x=0,int y=0):x(x),y(y) {}pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}bool operator < (const pa2 &p) const{return y != p.y ? y<p.y: x<p.x;}bool operator > (const pa2 &p) const{return x != p.x ? x<p.x: y<p.y;}bool operator == (const pa2 &p) const{return abs(x-p.x)==0 && abs(y-p.y)==0;}bool operator != (const pa2 &p) const{return !(abs(x-p.x)==0 && abs(y-p.y)==0);}};/*class Point{public:double x,y;Point(double x=0,double y=0):x(x),y(y) {}Point operator + (Point p) {return Point(x+p.x,y+p.y);}Point operator - (Point p) {return Point(x-p.x,y-p.y);}Point operator * (double a) {return Point(x*a,y*a);}Point operator / (double a) {return Point(x/a,y/a);}double absv() {return sqrt(norm());}double norm() {return x*x+y*y;}bool operator < (const Point &p) const{return x != p.x ? x<p.x: y<p.y;}bool operator == (const Point &p) const{return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;}};typedef Point Vector;#define pl pair<int,pas>struct Segment{Point p1,p2;};double dot(Vector a,Vector b){return a.x*b.x+a.y*b.y;}double cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;}bool parareru(Point a,Point b,Point c,Point d){// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;return abs(cross(a-b,d-c))<EPS;}double distance_ls_p(Point a, Point b, Point c) {if ( dot(b-a, c-a) < EPS ) return (c-a).absv();if ( dot(a-b, c-b) < EPS ) return (c-b).absv();return abs(cross(b-a, c-a)) / (b-a).absv();}bool is_intersected_ls(Segment a,Segment b) {if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){// cout<<"sss"<<endl;if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;return false;}else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1,a.p2-b.p1) < EPS );}double segment_dis(Segment a,Segment b){if(is_intersected_ls(a,b))return 0;double r=distance_ls_p(a.p1, a.p2, b.p1);r=min(r,distance_ls_p(a.p1, a.p2, b.p2));r=min(r,distance_ls_p(b.p1, b.p2, a.p2));r=min(r,distance_ls_p(b.p1, b.p2, a.p1));return r;}Point intersection_ls(Segment a, Segment b) {Point ba = b.p2-b.p1;double d1 = abs(cross(ba, a.p1-b.p1));double d2 = abs(cross(ba, a.p2-b.p1));double t = d1 / (d1 + d2);return a.p1 + (a.p2-a.p1) * t;}*/string itos( int i ) {ostringstream s ;s << i ;return s.str() ;}int gcd(int v,int b){if(v>b) return gcd(b,v);if(v==b) return b;if(b%v==0) return v;return gcd(v,b%v);}double distans(double x1,double y1,double x2,double y2){double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);return sqrt(rr);}int mod;int extgcd(int a, int b, int &x, int &y) {if (b == 0) {x = 1;y = 0;return a;}int d = extgcd(b, a%b, y, x);y -= a/b * x;return d;}int pr[1000010];int inv[1000010];int beki(int wa,int rr,int warukazu){if(rr==0) return 1%warukazu;if(rr==1) return wa%warukazu;wa%=warukazu;if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;ll zx=beki(wa,rr/2,warukazu);return (zx*zx)%warukazu;}double bekid(double w,int r){if(r==0) return 1.0;if(r==1) return w;if(r%2) return bekid(w,r-1)*w;double f=bekid(w,r/2);return f*f;}int comb(int nn,int rr){int r=pr[nn]*inv[rr];r%=mod;r*=inv[nn-rr];r%=mod;return r;}void gya(int ert){pr[0]=1;for(int i=1;i<ert;i++){pr[i]=(pr[i-1]*i)%mod;}for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);}// cin.tie(0);// ios::sync_with_stdio(false);//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;//sort(ve.begin(),ve.end(),greater<int>());//----------------kokomade tenpure------------struct seg_rangeupd_getpoint{// 1// 2 3// 4 5 6 7private:public:// (1<<15)=32768// 1<<16 = 65536// 1<<17 = 131072// 1<<18 = 262144int cor=(1<<17);vector<int> vec;void shoki1(){vec.resize(2*cor+3, inf);}void shoki2(){vec[1]=(1ll<<31)-1;//初期値}void chien(int k,int l,int r){if(l+1<r)if(vec[k]!=inf){vec[2*k]=vec[k];vec[2*k+1]=vec[k];vec[k]=inf;}}void rangeupd(int a,int b,int w, int k=1,int l=0,int r=-3){//[a,b)を wに変更if(r<0) r=cor;if(a<=l && r<=b){vec[k]=w;return ;}if(r<=a || b<=l){return ;}chien(k,l,r);// cout<<k<<" "<<l<<" "<<r<<endl;rangeupd(a,b,w,k*2,l,(l+r)/2);rangeupd(a,b,w,k*2+1,(l+r)/2,r);return ;}// [a,b)// k-th node// k no kukanha [l,r)int getpoint(int x){x+=cor;int ans=0;while(1){if(x==0) break;if(vec[x]!=inf) ans=vec[x];x/=2;}return ans;}void pre(){for(int i=1;i<2*cor;i++){cout<<vec[i]<<" ";if(((i+1)&(-(i+1)))==i+1) cout<<endl;}}};seg_rangeupd_getpoint se;set<int> sse;map<int,int>ma;int gya1[100020];int a[100020];int ra[100020][2];signed main(){cin.tie(0);ios::sync_with_stdio(false);se.shoki1();se.shoki2();int n;cin>>n;for(int i=1;i<=n;i++){cin>>a[i];sse.insert(a[i]);}int cn=0;for(auto it=sse.begin();it!=sse.end();it++){ma[*it]=cn;gya1[cn]=*it;ra[cn][0]=inf;ra[cn][1]=-inf;cn++;}for(int i=1;i<=n;i++)a[i]=ma[a[i]];for(int i=1;i<=n;i++){ra[a[i]][0]=min(ra[a[i]][0],i);ra[a[i]][1]=max(ra[a[i]][1],i);}for(int i=0;i<cn;i++){se.rangeupd(ra[i][0],ra[i][1]+1,i);}for(int i=1;i<=n;i++){int t=se.getpoint(i);cout<<gya1[t]<<" ";}cout<<endl;return 0;}