제출 #1019546

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

birmingham

// Practice makes perfect
#include <bits/stdc++.h>
#include <queue>
using namespace std;

#define fastIO ios_base::sync_with_stdio(0); cin.tie(0);
#define file "bmh"
#define ll long long
const int maxn = 1e5 + 5;

int n, m, q, ans[maxn], d[maxn];
ll k;
bool vis[maxn];
queue<int> qu;
vector<int> g[maxn];

void bfs() {
    while (qu.size()) {
        int u = qu.front();
        qu.pop();
        for (int i = 0; i < g[u].size(); ++i) {
            int v = g[u][i];
            if (!vis[v]) {
                vis[v] = 1;
                qu.push(v);
                d[v] = d[u] + 1;
            }
        }
    }
}

int main() {
    fastIO
    cin >> n >> m >> q >> k;
    for (int i = 1; i <= n; ++i)
        ans[i] = INT_MAX;
    for (int i = 1; i <= q; ++i) {
        int x;
        cin >> x;
        qu.push(x);
        vis[x] = 1;
        d[x] = 0;
        ans[x] = 0;
    }
    while (m--) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    bfs();
    for (int i = 1; i <= n; ++i) {
        if (!d[i])
            continue;
        int lo = 1, hi = n;
        while (lo <= hi) {
            ll mi = (lo + hi) >> 1;
            if ((mi * (mi + 1) / 2) * k >= d[i]) {
                ans[i] = min(ans[i], (int) mi);
                hi = mi - 1;
            }
            else
                lo = mi + 1;
        }
    }
    for (int i = 1; i <= n; ++i)
        cout << ans[i] << " ";
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

birmingham.cpp: In function 'void bfs()':
birmingham.cpp:21:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |         for (int i = 0; i < g[u].size(); ++i) {
      |                         ~~^~~~~~~~~~~~~

• 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