제출 #1175328

#제출 시각아이디문제언어결과실행 시간메모리
1175328turali12Stone Arranging 2 (JOI23_ho_t1)C++20
25 / 100
2093 ms1864 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=v; for(int i=0;i<n;i++){ bool ok=false; for(int j=0;j<i;j++){ if(ans[j]==v[i]&&!ok){ ok=true; } if(ok){ ans[j]=v[i]; } } } 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...