| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 392058 | A_D | Paint (COI20_paint) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#define int long long
#define ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
const int N=2e5+100;
int a[N];
int l[N];
int r[N];
int fl(int u)
{
if(u==l[u]){
if(u==1)return u;
if(a[u-1]!=a[u]||r[u-1]!=u-1){
return u;
}
else{
return l[u]=fl(u-1);
}
}
return l[u]=fl(l[u]);
}
int fr(int u)
{
if(u==r[u]){
if(u==n)return u;
if(a[u+1]!=a[u]||l[u+1]!=u+1){
return u;
}
else{
return r[u]=fr(u+1);
}
}
return r[u]=fr(r[u]);
}
void solve()
{
int n;
cin>>n>>n;
for(int i=1;i<=n;i++){
l[i]=i;
r[i]=i;
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++){
l[i]=fl(i);
r[i]=fr(i);
}
int q;
cin>>q;
while(q--){
int i,c;
scanf("%d",&i);
scanf("%d",&i);
scanf("%d",&c);
l[i]=fl(i);
r[i]=fr(i);
a[l[i]]=c;
a[r[i]]=c;
}
for(int i=1;i<=n;i++){
int ans=fl(i);
ans=a[ans];
printf("%d ",ans);
}
}
main()
{
//freopen(".in","r",stdin);freopen(".out","w",stdout);
int t=1;
// cin>>t;
while(t--)solve();
}
