제출 #709951

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
709951		pcc	Birmingham (COCI20_birmingham)	C++14	70 / 70	229 ms	10240 KiB

birmingham

#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int mxn = 1e5+10;
vector<int> paths[mxn];
int dist[mxn];

int main(){
    ll n,m,qq,k;
    fill(dist,dist+mxn,-1);
    cin>>n>>m>>qq>>k;
    queue<int> q;
    for(int i = 0;i<qq;i++){
        int x;
        cin>>x;
        q.push(x);
        dist[x] = 0;
    }
    for(int i = 0;i<m;i++){
        int a,b;
        cin>>a>>b;
        paths[a].push_back(b);
        paths[b].push_back(a);
    }
    while(!q.empty()){
        auto now = q.front();
        q.pop();
        for(auto nxt:paths[now]){
            if(dist[nxt] != -1)continue;
            dist[nxt] = dist[now]+1;
            q.push(nxt);
        }
    }
    for(int i = 1;i<=n;i++){
        ll l = 0,r = n;
        while(l != r){
            ll mid = (l+r)>>1;
            if(mid*(mid+1)/2*k>=dist[i])r = mid;
            else l = mid+1;
        }
        cout<<l<<' ';
    }
}
/*
6 8 1 1
6
1 3
1 5
1 6
2 5
2 6
3 4
3 5
5 6


*/

• 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