# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393462 | A_D | Paint (COI20_paint) | C++14 | 134 ms | 8916 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=1e6+100;
int a[N];
int l[N];
int r[N];
void compine(int a,int b)
{
r[a]=r[b];
l[b]=l[a];
}
int fl(int u)
{
if(u==l[u])return l[u];
return l[u]=fl(l[u]);
}
int fr(int u)
{
if(u==r[u])return r[u];
return r[u]=fr(r[u]);
}
void solve()
{
int n;
cin>>n>>n;
for(int i=1;i<=n;i++)cin>>a[i],l[i]=i,r[i]=i;
for(int i=1;i<n;i++){
if(a[i]==a[i+1]){
compine(i,i+1);
}
}
int q;
cin>>q;
while(q--){
int i,c;
scanf("%lld",&i);
scanf("%lld",&i);
scanf("%lld",&c);
int le=fl(i);
int ri=fr(i);
a[le]=c;
a[ri]=c;
if(le!=1){
if(a[le]==a[le-1]){
compine(le-1,le);
}
}
if(ri!=n){
if(a[ri]==a[ri+1]){
compine(ri,ri+1);
}
}
}
for(int i=1;i<=n;i++){
int x=fl(i);
x=a[x];
cout<<x<<" ";
}
}
main()
{
//freopen(".in","r",stdin);freopen(".out","w",stdout);
int t=1;
// cin>>t;
while(t--)solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |