Submission #392098

#	Time	Username	Problem	Language	Result	Execution time	Memory
392098		sad	Birmingham (COCI20_birmingham)	C++14	70 / 70	225 ms	11632 KiB

birmingham

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
int n,m,k,qq;
const int N=100090;
vector<int>v[N];
queue<pair<int,int>>q;
int dis[N],vis[N];
int ch(ll c,ll ds)
{
    c*=(c+1);c/=2;
    c*=k;
    if(c>ds)return 0;
    return 1;
}
int main()
{
    cin>>n>>m>>qq>>k;
    for(int i=0;i<qq;i++)
    {
        int x;cin>>x;q.push({x,0});
    }
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
        v[x].pb(y);
        v[y].pb(x);
    }
    while(!q.empty())
    {
        pair<int,int>x=q.front();
        q.pop();
        if(vis[x.fi])continue;
        vis[x.fi]=1;
        dis[x.fi]=x.se;
        for(auto it:v[x.fi])
        {
            if(vis[it])continue;
            q.push({it,x.se+1});
        }
    }
    for(int i=1;i<n+1;i++)
    {

        int st=0,en=100090;
        while(st<en)
        {
            int mid=(st+en)/2;
            if(ch(mid,dis[i]))
                st=mid+1;
            else en=mid;
        }
        st--;
        ll c=(st)*(st+1);
        c/=2;
        c*=k;
        if(dis[i]>c)st++;
        cout<<st<<" ";
    }


}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5