Submission #845181

#	Time	Username	Problem	Language	Result	Execution time	Memory
845181		vjudge1	Birmingham (COCI20_birmingham)	C++17	15 / 70	75 ms	10432 KiB

birmingham

#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#define int long long
#define pb push_back
#define lim 300000
#define till 40001
// # of primes till 1e6 = 7e4
using namespace std;
using namespace __gnu_pbds;

typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
using pii = array<int,2>;

const int mod=1000000007ll;

void solve(){
    int n,m,Q,k;
    cin>>n>>m>>Q>>k;
    queue<int>q;
    int vis[n];
    memset(vis,-1,sizeof(vis));
    for(int i=0;i<Q;i++){
        int tem;
        cin>>tem;
        tem--;
        q.push(tem);
        vis[tem]=0;
    }
    vector<int>v[n];
    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
        x--,y--;
        v[x].pb(y);
        v[y].pb(x);
    }
    //cerr<<v[2].size()<<"\n";
    while(q.size()){
        int top=q.front();
        q.pop();
        //cerr<<top<<" doing\n";
        for(int i:v[top]){
            if(vis[i]==-1){
                //cerr<<i<<" "<<vis[i]<<" ";
                vis[i]=vis[top]+1;
                q.push(i);
            }
        }
    }
    vector<int>days;
    days.pb(0);
    int now=k;
    for(int i=2;*days.rbegin()<n;i++){
        days.pb(*days.rbegin()+now);
        now+=i*k;
    }
    //cerr<<"ok\n";
    for(int i=0;i<n;i++){
        //cerr<<vis[i]<<" "<<*days.rbegin()<<"\n";
        cout<<lower_bound(days.begin(),days.end(),vis[i])-days.begin()<<" ";
    }
}


signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
#ifndef INTERACTIVE
    freopen("in","r",stdin);
#endif
    freopen("out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

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