| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1145524 | ezzzay | Stone Arranging 2 (JOI23_ho_t1) | C++20 | 137 ms | 2276 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb puhs_back
const int N=3e5+5;
int a[N];
signed main(){
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
int r=n;
while(a[r-1]==a[n])r--;
for(int i=1;i<r;i++)a[i]=a[1];
for(int i=1;i<=n;i++)cout<<a[i]<<endl;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
