oj.uz

답안 #536680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536680 2022-03-13T20:02:33 Z MOUF_MAHMALAT Izlet (COI19_izlet) C++14
0 / 100
 778 ms 53728 KB 
#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
#define F first
#define S second
using namespace std;
typedef int ll;
ll n,t,a[3009][3009],p[3009],sz[3009],c[3009],b[3009];
vector<vector<ll> >v;
ll gp(ll z)
{
    if(p[z]==z)
        return z;
    return p[z]=gp(p[z]);
}
bool mrg(ll x,ll y)
{
    x=gp(x),y=gp(y);
    if(x==y)
        return 0;
    if(sz[x]<sz[y])
        swap(x,y);
    p[y]=x;
    sz[x]+=sz[y];
    return 1;
}
void dfs(ll d,ll p,ll co,ll x,ll root)
{
    if(b[c[d]]==0)
        x++;
    b[c[d]]++;
    if(a[d][root]>x)
    {
        b[c[d]]--;
        while(b[co])
            co++;
        b[co]++;
        x++;
        c[d]=co;
    }
    //cout<<d<<" "<<c[d]<<"\n";
    for(auto&z:v[d])
        if(z!=p)
            dfs(z,d,co,x,root);
    b[c[d]]--;
}
void go(ll d,ll p)
{
    for(auto&z:v[d])
        if(z!=p)
        {
            cout<<"\n"<<z<<" "<<d;
            go(z,d);
        }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>t>>n;
    for(ll i=1; i<=n; i++)
        for(ll j=1; j<=n; j++)
            cin>>a[i][j];
    for(ll i=1; i<=n; i++)
        p[i]=i,sz[i]=1;
    v.resize(n+1);
    for(ll k=1; k<3; k++)
        for(ll i=1; i<=n; i++)
            for(ll j=1; j<=n; j++)
                if(a[i][j]==k&&mrg(i,j))
                {
                    v[i].push_back(j);
                    v[j].push_back(i);
                }
    for(ll i=1;i<=n;i++)
        c[i]=1;
    for(ll i=1; i<=n; i++)
    {
        memset(b,0,sizeof b);
        //cout<<i<<"\n";
        dfs(i,0,c[i],0,i);
    }
    for(ll i=1; i<=n; i++)
        cout<<c[i]<<" ";
    go(1,0);
    return 0;
}

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 778 ms 53728 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -