oj.uz

Submission #1003916

# Submission time Handle Problem Language Result Execution time Memory
1003916 2024-06-20T19:55:03 Z vjudge1 Paint (COI20_paint) C++17
48 / 100
 3000 ms 63052 KB 
#include<bits/stdc++.h>
using namespace std;

#define N 200010
#define M 50
#define INFLL 2000000000000000020
#define pb push_back

typedef long long ll;
typedef pair<ll,ll> pll;

ll h;
ll n,m;
ll head[N];
ll color[N];
bool marc[N];
unordered_set<ll>reach[N];
vector<ll>merges;

ll transform(ll i,ll j)
{
    return i*m+j-m;
}

ll Dx[10]={-1,0,1,0};
ll Dy[10]={0,1,0,-1};

bool valid(ll i,ll j)
{
    return (bool)(i>0 && i<=n && j>0 && j<=m);
}

void DFS(ll i,ll j)
{
    ll x=transform(i,j),k,ni,nj,y;
    marc[x]=true;
    head[x]=h;
    for(k=0;k<4;k++)
    {
        ni=i+Dx[k];
        nj=j+Dy[k];
        y=transform(ni,nj);
        if(!valid(ni,nj))
            continue;
        if(color[y]==color[x])
        {
            if(!marc[y])
                DFS(ni,nj);
        }else
            reach[h].insert(y);
    }
    return;
}

ll Find(ll u)
{
    if(head[u]==u)
        return u;
    return head[u]=Find(head[u]);
}

void merge(ll u,ll v)
{
    if(reach[u].size()<reach[v].size())
        swap(u,v);
    head[v]=u;
    for(auto x : reach[v])
    {
        if(Find(x)==u)
            continue;
        reach[u].insert(x);
    }
    reach[u].erase(v);
    return;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    ll q,x,i,j,c,u,v;

    cin >> n >> m;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            x=transform(i,j);
            cin >> color[x];
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            x=transform(i,j);
            if(marc[x])
                continue;
            h=x;
            DFS(i,j);
        }
    }
    cin >> q;
    while(q)
    {
        q--;
        cin >> i >> j >> c;
        x=transform(i,j);
        u=Find(x);
        color[u]=c;
        for(auto r : reach[u])
        {
            v=Find(r);
            if(u==v)
                continue;
            if(color[v]==c)
            {
                merges.pb(v);
            }
        }
        while(!merges.empty())
        {
            u=Find(u);
            merge(u,merges.back());
            merges.pop_back();
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            x=transform(i,j);
            u=Find(x);
            cout << color[u] << ((j==m) ? '\n' : ' ');
        }
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 3 ms 13144 KB Output is correct
3 Correct 10 ms 15280 KB Output is correct
4 Correct 8 ms 14684 KB Output is correct
5 Correct 72 ms 14432 KB Output is correct
6 Correct 41 ms 14524 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 21256 KB Output is correct
2 Correct 86 ms 26092 KB Output is correct
3 Correct 450 ms 43144 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 62892 KB Output is correct
2 Correct 175 ms 63052 KB Output is correct
3 Correct 246 ms 62716 KB Output is correct
4 Correct 487 ms 62056 KB Output is correct
5 Correct 567 ms 58536 KB Output is correct

Subtask #4
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 46392 KB Output is correct
2 Execution timed out 3058 ms 44224 KB Time limit exceeded
3 Halted 0 ms 0 KB -