제출 #217477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
217477		papa	Birmingham (COCI20_birmingham)	C++14	70 / 70	112 ms	11500 KiB

birmingham

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

//ideja je da nadjemo rastojanje
//svakog cvora od pocetnih
//i da onda vidimo koji im je lower_bound
//u nizu prefiksnih suma k,3k,6k...

//treba da se testira

int n,m,q;
ll k;
vector<int> adj[100005];
queue<int> qq;
ll dist[100005];
vector<ll> s;

void rasiri()
{
    while(!qq.empty())
    {
        int cv = qq.front();
        qq.pop();
        for(int x : adj[cv])
        {
            if(dist[x]==-1)
            {
                dist[x] = dist[cv]+1;
                qq.push(x);
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cerr.tie(0);

    cin >> n >> m >> q >> k;

    for(int i=1;i<=n;i++)
        dist[i] = -1;

    for(ll i = k;i<=n;i+=k)
    {
        if(i==k) s.push_back(k);
        else
        {
            s.push_back(s.back() + i);
        }
    }

    for(int i=1;i<=q;i++)
    {
        int x;
        cin >> x;
        qq.push(x);
        dist[x] = 0;
    }

    for(int i=1;i<=m;i++)
    {
        int u,v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    rasiri();

    for(int i=1;i<=n;i++)
    {
        if(dist[i]==0)
        {
            cout << 0 << " ";
            continue;
        }
        vector<ll>::iterator it;
        it = lower_bound(s.begin(),s.end(),dist[i]);
        int dani = it-s.begin()+1;
        cout << dani << " ";
    }
    return 0;
}

• 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