Submission #570429

#	Time	Username	Problem	Language	Result	Execution time	Memory
570429		NekoRolly	Birmingham (COCI20_birmingham)	C++17	70 / 70	137 ms	10112 KiB

birmingham

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+4;

int n,m,q,k;
vector<int> adj[N];
queue<int> d;
int dis[N];

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

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

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

	for (int a; q; q--){ cin >> a;
		dis[a] = 0; d.push(a);
	}

	for (int a,b; m; m--){ cin >> a >> b;
		adj[a].push_back(b), adj[b].push_back(a);
	}

	for (int u; d.size(); d.pop()){ u = d.front();
		for (int v : adj[u]) if (dis[v] == -1){
			dis[v] = dis[u]+1; d.push(v);
		}
	}

	for (int i=1,l,r; i<=n; i++){ l = 0, r = n;
		while (l < r){ int m = (l+r)>>1;
			if (1ll*m*(m+1)/2*k < dis[i]) l = m+1;
			else r = m;
		}
		cout << l << " ";
	}	
	cout << "\n";

    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