Submission #901417

#TimeUsernameProblemLanguageResultExecution timeMemory
901417SuPythonyStone Arranging 2 (JOI23_ho_t1)C++17
35 / 100
38 ms1960 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { int n; cin>>n; int cols[n]; for (int i=0; i<n; i++) { int c; cin>>c; cols[i]=c; } int s=cols[0]; int ind=-1; for (int i=n-1; i>=0; i--) { if (cols[i]==s) { ind=i; break; } } for (int i=0; i<n; i++) { if (i<=ind) cout<<s<<"\n"; else cout<<cols[i]<<"\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...