제출 #212271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
212271		model_code	Birmingham (COCI20_birmingham)	C++17	70 / 70	131 ms	8568 KiB

birmingham

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;

#define TRACE(x) cerr << #x << "  " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<

#define fi first
#define sec second
#define mp make_pair
#define pb push_back

const int MAXN = 100100;

int n, m, k, q;
int dist[MAXN], ans[MAXN];
int bio[MAXN];

vector <int> v[MAXN];

queue <int> Q;

void bfs() {
  int cvor;
  while (!Q.empty()) {
    cvor = Q.front();
    Q.pop();
    for (auto ncvor : v[cvor]) {
      if (bio[ncvor]) continue;
      bio[ncvor] = 1;
      Q.push(ncvor);
      dist[ncvor] = dist[cvor] + 1;
    }
  }
}

int main() {
  scanf("%d %d %d %d",&n,&m,&q,&k);
  REP(i, q) {
    int x;
    scanf("%d",&x);
    if (!bio[x]) Q.push(x);
    bio[x] = 1;
  }

  REP(i, m) {
    int a, b;
    scanf("%d %d",&a,&b);
    v[a].pb(b);
    v[b].pb(a);
  }

  bfs();

  int pt = 1, j = 1;
  while (pt < MAXN) {
    FOR(i, pt, pt + j * k) {
      if (i < MAXN) ans[i] = j;
    }
    pt += j * k;
    j++;
  }

  FOR(i, 1, n + 1) {
    printf("%d ",ans[dist[i]]);
  }
  puts("");

  return 0;
}

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

code1.cpp: In function 'int main()':
code1.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d %d",&n,&m,&q,&k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
code1.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&x);
     ~~~~~^~~~~~~~~
code1.cpp:56:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&a,&b);
     ~~~~~^~~~~~~~~~~~~~~

• 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