Submission #908778

#	Time	Username	Problem	Language	Result	Execution time	Memory
908778		Andreibatman	Colors (RMI18_colors)	C++14	47 / 100	3054 ms	8016 KiB

colors

#include <bits/stdc++.h>
#define NMAX 150010
using namespace std;
vector<int>v[NMAX];
int a[NMAX],b[NMAX],n,m,x,y,i,j,ok,t,color,viz[NMAX],p,culoare[NMAX];
queue<int>q;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        ok=1;
        for(i=1;i<=n;i++)
            v[i].clear();
        for(i=1;i<=n;i++)
        {
            cin>>a[i];
            culoare[a[i]]++;
        }
        for(i=1;i<=n;i++)
            cin>>b[i];
        for(i=1;i<=m;i++)
        {
            cin>>x>>y;
            v[x].push_back(y);
            v[y].push_back(x);
        }
        for(color=n;color>=1;color--)
        {
            if(culoare[color]==0)
                continue;
            while(!q.empty())
                q.pop();
            for(i=1;i<=n;i++)
                if(a[i]==color)
                {
                    q.push(i);
                    viz[i]=color;
                }
                else if(a[i]!=b[i] && color<b[i])
                {
                    ok=0;
                    break;
                }
            if(ok==0)
                break;
            while(!q.empty())
            {
                p=q.front();
                q.pop();
                for(auto it:v[p])
                    if(viz[it]!=color && a[it]>color && a[it]>b[it])
                    {
                        a[it]=color;
                        viz[it]=color;
                        q.push(it);
                    }
            }
        }
        for(i=1;i<=n;i++)
            if(a[i]!=b[i])
                ok=0;
        cout<<ok<<'\n';
    }
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 7 / 7
• Subtask 3: 8 / 8
• Subtask 4: 0 / 15
• Subtask 5: 7 / 7
• Subtask 6: 0 / 16
• Subtask 7: 10 / 10
• Subtask 8: 0 / 22