Submission #1175321

#TimeUsernameProblemLanguageResultExecution timeMemory
1175321turali12Stone Arranging 2 (JOI23_ho_t1)C++20
0 / 100
2093 ms328 KiB
#include<bits/stdc++.h> using namespace std; signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); int n; cin>>n; vector<int>v(n); int first=-1,idx1=-1,idx2=-1; for(int i=0;i<n;i++){ cin>>v[i]; if(i==0){ first=v[i]; idx1=i; } if(i>0&&v[i]==first){ idx2=i; } } vector<int>ans(n); bool ok=true; while(ok){ for(int i=idx1;i<=idx2;i++){ ans[i]=first; } if(idx2==n-1){ ok=false; } else if(idx2+1==n-1){ ans[idx2+1]=v[idx2+1]; ok=false; } first=v[idx2+1]; idx1=idx2+1; for(int i=n-1;i>idx1+1;i--){ if(v[i]==first){ idx2=i; break; } } } for(int i=0;i<n;i++){ cout<<ans[i]<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...