제출 #391538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391538		phathnv	Birmingham (COCI20_birmingham)	C++11	70 / 70	138 ms	10452 KiB

birmingham

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <int, int> ii;

const int N = 1e5 + 1;

int n, m, q, k;
vector <int> known, adj[N];

int d[N];

void readInput(){
    scanf("%d %d %d %d", &n, &m, &q, &k);
    for(int i = 1; i <= q; i++){
        int x;
        scanf("%d", &x);
        known.push_back(x);
    }
    for(int i = 1; i <= m; i++){
        int u, v;
        scanf("%d %d", &u, &v);
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
}

void solve(){
    queue <int> qu;
    for(int i = 1; i <= n; i++)
        d[i] = -1;
    for(int x : known){
        d[x] = 0;
        qu.push(x);
    }

    while (!qu.empty()){
        int u = qu.front();
        qu.pop();

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

    for(int i = 1; i <= n; i++){
        int res = 0;
        int cur = k;
        while (d[i] > 0){
            res++;
            d[i] -= cur;
            cur += k;
        }
        printf("%d ", res);
    }
}

int main(){
    readInput();
    solve();
    return 0;
}

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

birmingham.cpp: In function 'void readInput()':
birmingham.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |     scanf("%d %d %d %d", &n, &m, &q, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
birmingham.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   19 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
birmingham.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |         scanf("%d %d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~

• 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