Submission #987573

#	Time	Username	Problem	Language	Result	Execution time	Memory
987573		modwwe	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	250 ms	147900 KiB

Main

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void ngha();
const int mod2=1e9+7;
const int  mod1=998244353;
struct ib
{
    int a;
    int b;
};
struct icd
{
    int a,b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c, d,e;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
main()
{
//#ifndef ONLINE_JUDGE
    /// fin(task),fou(task);
//#endif
    NHP
//modwwe
    //  cin>>res;
    ngha();

}
stack<int> s[200001];
int a[200001];
int t[800001];
void build(int node,int l,int r)
{ t[node]=-1;
     if(l==r)
     {
         t[node]=a[l];
         return;
     }
     int mid=l+r>>1;
      build(node<<1,l,mid);
      build(node<<1|1,mid+1,r);
}
void ff(int x)
{
     for(int i=x*2;i<=x*2+1;i++)
     {
         t[i]=t[x];
     }
     t[x]=-1;
}
void upd(int node,int l,int r,int l1,int r1,int c)
{
     if(l>r1||r<l1) return;
      if(l>=l1&&r<=r1)
      {
          t[node]=c;
           return;
      }
      if(t[node]!=-1) ff(node);
      int mid=l+r>>1;
      upd(node<<1,l,mid,l1,r1,c);
      upd(node<<1|1,mid+1,r,l1,r1,c);
}
int get(int node,int l,int r,int l1,int r1)
 {
     if(l>r1||r<l1) return -1;
      if(l>=l1&&r<=r1) return t[node];
      int mid=l+r>>1;
      if(t[node]!=-1)ff(node);
       return max(get(node<<1,l,mid,l1,r1),get(node<<1|1,mid+1,r,l1,r1));
 }
vector<int> v;
void ngha()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
         cin>>a[i];
         v.pb(a[i]);
    }
    sort(v.begin(),v.end());
     for(int i=1;i<=n;i++) a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin();
build(1,1,n);
     for(int i=1;i<=n;i++)
     {
         while(s[a[i]].size()&&get(1,1,n,s[a[i]].top(),s[a[i]].top())!=a[i])
         {
              s[a[i]].pop();
         }
         if(s[a[i]].size()==0) {         s[a[i]].push(i);
  continue;}
        s2=s[a[i]].top();
         upd(1,1,n,s2,i,a[i]);
             s[a[i]].push(i);

     }
     for(int i=1;i<=n;i++)
        cout<<v[get(1,1,n,i,i)]<<"\n";
    }

Compilation message (stderr)

Main.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~
Main.cpp: In function 'void build(long long int, long long int, long long int)':
Main.cpp:66:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |      int mid=l+r>>1;
      |              ~^~
Main.cpp: In function 'void upd(long long int, long long int, long long int, long long int, long long int, long long int)':
Main.cpp:87:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   87 |       int mid=l+r>>1;
      |               ~^~
Main.cpp: In function 'long long int get(long long int, long long int, long long int, long long int, long long int)':
Main.cpp:95:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   95 |       int mid=l+r>>1;
      |               ~^~

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40